| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > caofrss | Structured version Visualization version GIF version | ||
| Description: Transfer a relation subset law to the function relation. (Contributed by Mario Carneiro, 28-Jul-2014.) |
| Ref | Expression |
|---|---|
| caofref.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| caofref.2 | ⊢ (𝜑 → 𝐹:𝐴⟶𝑆) |
| caofcom.3 | ⊢ (𝜑 → 𝐺:𝐴⟶𝑆) |
| caofrss.4 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝑅𝑦 → 𝑥𝑇𝑦)) |
| Ref | Expression |
|---|---|
| caofrss | ⊢ (𝜑 → (𝐹 ∘r 𝑅𝐺 → 𝐹 ∘r 𝑇𝐺)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | caofref.2 | . . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶𝑆) | |
| 2 | 1 | ffvelcdmda 7038 | . . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) ∈ 𝑆) |
| 3 | caofcom.3 | . . . . 5 ⊢ (𝜑 → 𝐺:𝐴⟶𝑆) | |
| 4 | 3 | ffvelcdmda 7038 | . . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) ∈ 𝑆) |
| 5 | caofrss.4 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝑅𝑦 → 𝑥𝑇𝑦)) | |
| 6 | 5 | ralrimivva 3181 | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥𝑅𝑦 → 𝑥𝑇𝑦)) |
| 7 | 6 | adantr 480 | . . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥𝑅𝑦 → 𝑥𝑇𝑦)) |
| 8 | breq1 5103 | . . . . . 6 ⊢ (𝑥 = (𝐹‘𝑤) → (𝑥𝑅𝑦 ↔ (𝐹‘𝑤)𝑅𝑦)) | |
| 9 | breq1 5103 | . . . . . 6 ⊢ (𝑥 = (𝐹‘𝑤) → (𝑥𝑇𝑦 ↔ (𝐹‘𝑤)𝑇𝑦)) | |
| 10 | 8, 9 | imbi12d 344 | . . . . 5 ⊢ (𝑥 = (𝐹‘𝑤) → ((𝑥𝑅𝑦 → 𝑥𝑇𝑦) ↔ ((𝐹‘𝑤)𝑅𝑦 → (𝐹‘𝑤)𝑇𝑦))) |
| 11 | breq2 5104 | . . . . . 6 ⊢ (𝑦 = (𝐺‘𝑤) → ((𝐹‘𝑤)𝑅𝑦 ↔ (𝐹‘𝑤)𝑅(𝐺‘𝑤))) | |
| 12 | breq2 5104 | . . . . . 6 ⊢ (𝑦 = (𝐺‘𝑤) → ((𝐹‘𝑤)𝑇𝑦 ↔ (𝐹‘𝑤)𝑇(𝐺‘𝑤))) | |
| 13 | 11, 12 | imbi12d 344 | . . . . 5 ⊢ (𝑦 = (𝐺‘𝑤) → (((𝐹‘𝑤)𝑅𝑦 → (𝐹‘𝑤)𝑇𝑦) ↔ ((𝐹‘𝑤)𝑅(𝐺‘𝑤) → (𝐹‘𝑤)𝑇(𝐺‘𝑤)))) |
| 14 | 10, 13 | rspc2va 3590 | . . . 4 ⊢ ((((𝐹‘𝑤) ∈ 𝑆 ∧ (𝐺‘𝑤) ∈ 𝑆) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥𝑅𝑦 → 𝑥𝑇𝑦)) → ((𝐹‘𝑤)𝑅(𝐺‘𝑤) → (𝐹‘𝑤)𝑇(𝐺‘𝑤))) |
| 15 | 2, 4, 7, 14 | syl21anc 838 | . . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤)𝑅(𝐺‘𝑤) → (𝐹‘𝑤)𝑇(𝐺‘𝑤))) |
| 16 | 15 | ralimdva 3150 | . 2 ⊢ (𝜑 → (∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑅(𝐺‘𝑤) → ∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑇(𝐺‘𝑤))) |
| 17 | 1 | ffnd 6671 | . . 3 ⊢ (𝜑 → 𝐹 Fn 𝐴) |
| 18 | 3 | ffnd 6671 | . . 3 ⊢ (𝜑 → 𝐺 Fn 𝐴) |
| 19 | caofref.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 20 | inidm 4181 | . . 3 ⊢ (𝐴 ∩ 𝐴) = 𝐴 | |
| 21 | eqidd 2738 | . . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) = (𝐹‘𝑤)) | |
| 22 | eqidd 2738 | . . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) = (𝐺‘𝑤)) | |
| 23 | 17, 18, 19, 19, 20, 21, 22 | ofrfval 7642 | . 2 ⊢ (𝜑 → (𝐹 ∘r 𝑅𝐺 ↔ ∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑅(𝐺‘𝑤))) |
| 24 | 17, 18, 19, 19, 20, 21, 22 | ofrfval 7642 | . 2 ⊢ (𝜑 → (𝐹 ∘r 𝑇𝐺 ↔ ∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑇(𝐺‘𝑤))) |
| 25 | 16, 23, 24 | 3imtr4d 294 | 1 ⊢ (𝜑 → (𝐹 ∘r 𝑅𝐺 → 𝐹 ∘r 𝑇𝐺)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∀wral 3052 class class class wbr 5100 ⟶wf 6496 ‘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: (None) |
| Copyright terms: Public domain | W3C validator |