| 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 2738 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = (𝐹‘𝑥)) | |
| 7 | eqidd 2738 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐺‘𝑥) = (𝐺‘𝑥)) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | ofrfval 7642 | . . . . 5 ⊢ (𝜑 → (𝐹 ∘r 𝑅𝐺 ↔ ∀𝑥 ∈ 𝑆 (𝐹‘𝑥)𝑅(𝐺‘𝑥))) |
| 9 | 8 | biimpa 476 | . . . 4 ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥)𝑅(𝐺‘𝑥)) |
| 10 | fveq2 6842 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋)) | |
| 11 | fveq2 6842 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝐺‘𝑥) = (𝐺‘𝑋)) | |
| 12 | 10, 11 | breq12d 5113 | . . . . 5 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥)𝑅(𝐺‘𝑥) ↔ (𝐹‘𝑋)𝑅(𝐺‘𝑋))) |
| 13 | 12 | rspccv 3575 | . . . 4 ⊢ (∀𝑥 ∈ 𝑆 (𝐹‘𝑥)𝑅(𝐺‘𝑥) → (𝑋 ∈ 𝑆 → (𝐹‘𝑋)𝑅(𝐺‘𝑋))) |
| 14 | 9, 13 | syl 17 | . . 3 ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺) → (𝑋 ∈ 𝑆 → (𝐹‘𝑋)𝑅(𝐺‘𝑋))) |
| 15 | 14 | 3impia 1118 | . 2 ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → (𝐹‘𝑋)𝑅(𝐺‘𝑋)) |
| 16 | simp1 1137 | . . 3 ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝜑) | |
| 17 | inss1 4191 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴 | |
| 18 | 5, 17 | eqsstrri 3983 | . . . 4 ⊢ 𝑆 ⊆ 𝐴 |
| 19 | simp3 1139 | . . . 4 ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝑆) | |
| 20 | 18, 19 | sselid 3933 | . . 3 ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝐴) |
| 21 | ofval.6 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑋) = 𝐶) | |
| 22 | 16, 20, 21 | syl2anc 585 | . 2 ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → (𝐹‘𝑋) = 𝐶) |
| 23 | inss2 4192 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵 | |
| 24 | 5, 23 | eqsstrri 3983 | . . . 4 ⊢ 𝑆 ⊆ 𝐵 |
| 25 | 24, 19 | sselid 3933 | . . 3 ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝐵) |
| 26 | ofval.7 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐵) → (𝐺‘𝑋) = 𝐷) | |
| 27 | 16, 25, 26 | syl2anc 585 | . 2 ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → (𝐺‘𝑋) = 𝐷) |
| 28 | 15, 22, 27 | 3brtr3d 5131 | 1 ⊢ ((𝜑 ∧ 𝐹 ∘r 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝐶𝑅𝐷) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ∩ cin 3902 class class class wbr 5100 Fn wfn 6495 ‘cfv 6500 ∘r cofr 7631 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pr 5379 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-ofr 7633 |
| This theorem is referenced by: gsumle 20086 mhpmulcl 22104 itg1le 25682 ftc1anclem5 37948 |
| Copyright terms: Public domain | W3C validator |