| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ofrval | 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 | ⊢ (𝐴 ∩ 𝐵) = 𝑆 |
| ofrval.6 | ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑋) = 𝐶) |
| ofrval.7 | ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐵) → (𝐺‘𝑋) = 𝐷) |
| Ref | Expression |
|---|---|
| ofrval | ⊢ ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝐶𝑅𝐷) |
| 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 2230 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = (𝐹‘𝑥)) | |
| 7 | eqidd 2230 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝐺‘𝑥) = (𝐺‘𝑥)) | |
| 8 | 1, 2, 3, 4, 5, 6, 7 | ofrfval 6239 | . . . . 5 ⊢ (𝜑 → (𝐹 ∘𝑟 𝑅𝐺 ↔ ∀𝑥 ∈ 𝑆 (𝐹‘𝑥)𝑅(𝐺‘𝑥))) |
| 9 | 8 | biimpa 296 | . . . 4 ⊢ ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺) → ∀𝑥 ∈ 𝑆 (𝐹‘𝑥)𝑅(𝐺‘𝑥)) |
| 10 | fveq2 5635 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝐹‘𝑥) = (𝐹‘𝑋)) | |
| 11 | fveq2 5635 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝐺‘𝑥) = (𝐺‘𝑋)) | |
| 12 | 10, 11 | breq12d 4099 | . . . . 5 ⊢ (𝑥 = 𝑋 → ((𝐹‘𝑥)𝑅(𝐺‘𝑥) ↔ (𝐹‘𝑋)𝑅(𝐺‘𝑋))) |
| 13 | 12 | rspccv 2905 | . . . 4 ⊢ (∀𝑥 ∈ 𝑆 (𝐹‘𝑥)𝑅(𝐺‘𝑥) → (𝑋 ∈ 𝑆 → (𝐹‘𝑋)𝑅(𝐺‘𝑋))) |
| 14 | 9, 13 | syl 14 | . . 3 ⊢ ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺) → (𝑋 ∈ 𝑆 → (𝐹‘𝑋)𝑅(𝐺‘𝑋))) |
| 15 | 14 | 3impia 1224 | . 2 ⊢ ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → (𝐹‘𝑋)𝑅(𝐺‘𝑋)) |
| 16 | simp1 1021 | . . 3 ⊢ ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝜑) | |
| 17 | inss1 3425 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴 | |
| 18 | 5, 17 | eqsstrri 3258 | . . . 4 ⊢ 𝑆 ⊆ 𝐴 |
| 19 | simp3 1023 | . . . 4 ⊢ ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝑆) | |
| 20 | 18, 19 | sselid 3223 | . . 3 ⊢ ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝐴) |
| 21 | ofrval.6 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐴) → (𝐹‘𝑋) = 𝐶) | |
| 22 | 16, 20, 21 | syl2anc 411 | . 2 ⊢ ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → (𝐹‘𝑋) = 𝐶) |
| 23 | inss2 3426 | . . . . 5 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐵 | |
| 24 | 5, 23 | eqsstrri 3258 | . . . 4 ⊢ 𝑆 ⊆ 𝐵 |
| 25 | 24, 19 | sselid 3223 | . . 3 ⊢ ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝐵) |
| 26 | ofrval.7 | . . 3 ⊢ ((𝜑 ∧ 𝑋 ∈ 𝐵) → (𝐺‘𝑋) = 𝐷) | |
| 27 | 16, 25, 26 | syl2anc 411 | . 2 ⊢ ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → (𝐺‘𝑋) = 𝐷) |
| 28 | 15, 22, 27 | 3brtr3d 4117 | 1 ⊢ ((𝜑 ∧ 𝐹 ∘𝑟 𝑅𝐺 ∧ 𝑋 ∈ 𝑆) → 𝐶𝑅𝐷) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∧ w3a 1002 = wceq 1395 ∈ wcel 2200 ∀wral 2508 ∩ cin 3197 class class class wbr 4086 Fn wfn 5319 ‘cfv 5324 ∘𝑟 cofr 6229 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-14 2203 ax-ext 2211 ax-coll 4202 ax-sep 4205 ax-pow 4262 ax-pr 4297 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-rex 2514 df-reu 2515 df-rab 2517 df-v 2802 df-sbc 3030 df-csb 3126 df-un 3202 df-in 3204 df-ss 3211 df-pw 3652 df-sn 3673 df-pr 3674 df-op 3676 df-uni 3892 df-iun 3970 df-br 4087 df-opab 4149 df-mpt 4150 df-id 4388 df-xp 4729 df-rel 4730 df-cnv 4731 df-co 4732 df-dm 4733 df-rn 4734 df-res 4735 df-ima 4736 df-iota 5284 df-fun 5326 df-fn 5327 df-f 5328 df-f1 5329 df-fo 5330 df-f1o 5331 df-fv 5332 df-ofr 6231 |
| This theorem is referenced by: psrbaglesuppg 14676 |
| Copyright terms: Public domain | W3C validator |