![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ofrval | Structured version Visualization version GIF version |
Description: Exhibit a function relation at a point. (Contributed by Mario Carneiro, 28-Jul-2014.) |
Ref | Expression |
---|---|
offval.1 | ⊢ (𝜑 → 𝐹 Fn 𝐴) |
offval.2 | ⊢ (𝜑 → 𝐺 Fn 𝐵) |
offval.3 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
offval.4 | ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
offval.5 | ⊢ (𝐴 ∩ 𝐵) = 𝑆 |
ofval.6 | ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑋) = 𝐶) |
ofval.7 | ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐵) → (𝐺‘𝑋) = 𝐷) |
Ref | Expression |
---|---|
ofrval | ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝐶𝑅𝐷) |
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 2741 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = (𝐹‘𝑥)) | |
7 | eqidd 2741 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐺‘𝑥) = (𝐺‘𝑥)) | |
8 | 1, 2, 3, 4, 5, 6, 7 | ofrfval 7724 | . . . . 5 ⊢ (𝜑 → (𝐹 ∘r 𝑅𝐺 ↔ ∀𝑥 ∈ 𝑆 (𝐹‘𝑥)𝑅(𝐺‘𝑥))) |
9 | 8 | biimpa 476 | . . . 4 ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥)𝑅(𝐺‘𝑥)) |
10 | fveq2 6920 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋)) | |
11 | fveq2 6920 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝐺‘𝑥) = (𝐺‘𝑋)) | |
12 | 10, 11 | breq12d 5179 | . . . . 5 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥)𝑅(𝐺‘𝑥) ↔ (𝐹‘𝑋)𝑅(𝐺‘𝑋))) |
13 | 12 | rspccv 3632 | . . . 4 ⊢ (∀𝑥 ∈ 𝑆 (𝐹‘𝑥)𝑅(𝐺‘𝑥) → (𝑋 ∈ 𝑆 → (𝐹‘𝑋)𝑅(𝐺‘𝑋))) |
14 | 9, 13 | syl 17 | . . 3 ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺) → (𝑋 ∈ 𝑆 → (𝐹‘𝑋)𝑅(𝐺‘𝑋))) |
15 | 14 | 3impia 1117 | . 2 ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → (𝐹‘𝑋)𝑅(𝐺‘𝑋)) |
16 | simp1 1136 | . . 3 ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝜑) | |
17 | inss1 4258 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴 | |
18 | 5, 17 | eqsstrri 4044 | . . . 4 ⊢ 𝑆 ⊆ 𝐴 |
19 | simp3 1138 | . . . 4 ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝑆) | |
20 | 18, 19 | sselid 4006 | . . 3 ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝐴) |
21 | ofval.6 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑋) = 𝐶) | |
22 | 16, 20, 21 | syl2anc 583 | . 2 ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → (𝐹‘𝑋) = 𝐶) |
23 | inss2 4259 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵 | |
24 | 5, 23 | eqsstrri 4044 | . . . 4 ⊢ 𝑆 ⊆ 𝐵 |
25 | 24, 19 | sselid 4006 | . . 3 ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝐵) |
26 | ofval.7 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐵) → (𝐺‘𝑋) = 𝐷) | |
27 | 16, 25, 26 | syl2anc 583 | . 2 ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → (𝐺‘𝑋) = 𝐷) |
28 | 15, 22, 27 | 3brtr3d 5197 | 1 ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝐶𝑅𝐷) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 ∀wral 3067 ∩ cin 3975 class class class wbr 5166 Fn wfn 6568 ‘cfv 6573 ∘r cofr 7713 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-rep 5303 ax-sep 5317 ax-nul 5324 ax-pr 5447 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-ral 3068 df-rex 3077 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-ofr 7715 |
This theorem is referenced by: mhpmulcl 22176 itg1le 25768 gsumle 33074 ftc1anclem5 37657 |
Copyright terms: Public domain | W3C validator |