ofrval - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > ofrval		Structured version Visualization version GIF version

Theorem ofrval 7697

Description: Exhibit a function relation at a point. (Contributed by Mario Carneiro, 28-Jul-2014.)

**Hypotheses**
Ref	Expression
offval.1	⊢ (𝜑 → 𝐹 Fn 𝐴)
offval.2	⊢ (𝜑 → 𝐺 Fn 𝐵)
offval.3	⊢ (𝜑 → 𝐴 ∈ 𝑉)
offval.4	⊢ (𝜑 → 𝐵 ∈ 𝑊)
offval.5	⊢ (𝐴 ∩ 𝐵) = 𝑆
ofval.6	⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑋) = 𝐶)
ofval.7	⊢ ((𝜑 ∧ 𝑋 ∈ 𝐵) → (𝐺‘𝑋) = 𝐷)

**Assertion**
Ref	Expression
ofrval	⊢ ((𝜑 ∧ 𝐹 ∘_r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝐶𝑅𝐷)

Proof of Theorem ofrval Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		offval.1	. . . . . 6 ⊢ (𝜑 → 𝐹 Fn 𝐴)
2		offval.2	. . . . . 6 ⊢ (𝜑 → 𝐺 Fn 𝐵)
3		offval.3	. . . . . 6 ⊢ (𝜑 → 𝐴 ∈ 𝑉)
4		offval.4	. . . . . 6 ⊢ (𝜑 → 𝐵 ∈ 𝑊)
5		offval.5	. . . . . 6 ⊢ (𝐴 ∩ 𝐵) = 𝑆
6		eqidd 2729	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = (𝐹‘𝑥))
7		eqidd 2729	. . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐺‘𝑥) = (𝐺‘𝑥))
8	1, 2, 3, 4, 5, 6, 7	ofrfval 7695	. . . . 5 ⊢ (𝜑 → (𝐹 ∘_r 𝑅𝐺 ↔ ∀𝑥 ∈ 𝑆 (𝐹‘𝑥)𝑅(𝐺‘𝑥)))
9	8	biimpa 476	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∘_r 𝑅𝐺) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥)𝑅(𝐺‘𝑥))
10		fveq2 6897	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋))
11		fveq2 6897	. . . . . 6 ⊢ (𝑥 = 𝑋 → (𝐺‘𝑥) = (𝐺‘𝑋))
12	10, 11	breq12d 5161	. . . . 5 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥)𝑅(𝐺‘𝑥) ↔ (𝐹‘𝑋)𝑅(𝐺‘𝑋)))
13	12	rspccv 3606	. . . 4 ⊢ (∀𝑥 ∈ 𝑆 (𝐹‘𝑥)𝑅(𝐺‘𝑥) → (𝑋 ∈ 𝑆 → (𝐹‘𝑋)𝑅(𝐺‘𝑋)))
14	9, 13	syl 17	. . 3 ⊢ ((𝜑 ∧ 𝐹 ∘_r 𝑅𝐺) → (𝑋 ∈ 𝑆 → (𝐹‘𝑋)𝑅(𝐺‘𝑋)))
15	14	3impia 1115	. 2 ⊢ ((𝜑 ∧ 𝐹 ∘_r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → (𝐹‘𝑋)𝑅(𝐺‘𝑋))
16		simp1 1134	. . 3 ⊢ ((𝜑 ∧ 𝐹 ∘_r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝜑)
17		inss1 4229	. . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴
18	5, 17	eqsstrri 4015	. . . 4 ⊢ 𝑆 ⊆ 𝐴
19		simp3 1136	. . . 4 ⊢ ((𝜑 ∧ 𝐹 ∘_r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝑆)
20	18, 19	sselid 3978	. . 3 ⊢ ((𝜑 ∧ 𝐹 ∘_r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝐴)
21		ofval.6	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑋) = 𝐶)
22	16, 20, 21	syl2anc 583	. 2 ⊢ ((𝜑 ∧ 𝐹 ∘_r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → (𝐹‘𝑋) = 𝐶)
23		inss2 4230	. . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵
24	5, 23	eqsstrri 4015	. . . 4 ⊢ 𝑆 ⊆ 𝐵
25	24, 19	sselid 3978	. . 3 ⊢ ((𝜑 ∧ 𝐹 ∘_r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝐵)
26		ofval.7	. . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐵) → (𝐺‘𝑋) = 𝐷)
27	16, 25, 26	syl2anc 583	. 2 ⊢ ((𝜑 ∧ 𝐹 ∘_r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → (𝐺‘𝑋) = 𝐷)
28	15, 22, 27	3brtr3d 5179	1 ⊢ ((𝜑 ∧ 𝐹 ∘_r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝐶𝑅𝐷)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1085 = wceq 1534 ∈ wcel 2099 ∀wral 3058 ∩ cin 3946 class class class wbr 5148 Fn wfn 6543 ‘cfv 6548 ∘_r cofr 7684

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pr 5429

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-ral 3059 df-rex 3068 df-reu 3374 df-rab 3430 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4324 df-if 4530 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4909 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5576 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-iota 6500 df-fun 6550 df-fn 6551 df-f 6552 df-f1 6553 df-fo 6554 df-f1o 6555 df-fv 6556 df-ofr 7686

This theorem is referenced by: mhpmulcl 22072 itg1le 25642 gsumle 32804 ftc1anclem5 37170

W3C validator

	
		OSZAR »