Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > caofrss | 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 | ⊢ (𝜑 → (𝐹 ∘𝑟 𝑅𝐺 → 𝐹 ∘𝑟 𝑇𝐺)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | caofref.2 | . . . . 5 ⊢ (𝜑 → 𝐹:𝐴⟶𝑆) | |
2 | 1 | ffvelrnda 5523 | . . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) ∈ 𝑆) |
3 | caofcom.3 | . . . . 5 ⊢ (𝜑 → 𝐺:𝐴⟶𝑆) | |
4 | 3 | ffvelrnda 5523 | . . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) ∈ 𝑆) |
5 | caofrss.4 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝑅𝑦 → 𝑥𝑇𝑦)) | |
6 | 5 | ralrimivva 2491 | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥𝑅𝑦 → 𝑥𝑇𝑦)) |
7 | 6 | adantr 274 | . . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥𝑅𝑦 → 𝑥𝑇𝑦)) |
8 | breq1 3902 | . . . . . 6 ⊢ (𝑥 = (𝐹‘𝑤) → (𝑥𝑅𝑦 ↔ (𝐹‘𝑤)𝑅𝑦)) | |
9 | breq1 3902 | . . . . . 6 ⊢ (𝑥 = (𝐹‘𝑤) → (𝑥𝑇𝑦 ↔ (𝐹‘𝑤)𝑇𝑦)) | |
10 | 8, 9 | imbi12d 233 | . . . . 5 ⊢ (𝑥 = (𝐹‘𝑤) → ((𝑥𝑅𝑦 → 𝑥𝑇𝑦) ↔ ((𝐹‘𝑤)𝑅𝑦 → (𝐹‘𝑤)𝑇𝑦))) |
11 | breq2 3903 | . . . . . 6 ⊢ (𝑦 = (𝐺‘𝑤) → ((𝐹‘𝑤)𝑅𝑦 ↔ (𝐹‘𝑤)𝑅(𝐺‘𝑤))) | |
12 | breq2 3903 | . . . . . 6 ⊢ (𝑦 = (𝐺‘𝑤) → ((𝐹‘𝑤)𝑇𝑦 ↔ (𝐹‘𝑤)𝑇(𝐺‘𝑤))) | |
13 | 11, 12 | imbi12d 233 | . . . . 5 ⊢ (𝑦 = (𝐺‘𝑤) → (((𝐹‘𝑤)𝑅𝑦 → (𝐹‘𝑤)𝑇𝑦) ↔ ((𝐹‘𝑤)𝑅(𝐺‘𝑤) → (𝐹‘𝑤)𝑇(𝐺‘𝑤)))) |
14 | 10, 13 | rspc2va 2777 | . . . 4 ⊢ ((((𝐹‘𝑤) ∈ 𝑆 ∧ (𝐺‘𝑤) ∈ 𝑆) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥𝑅𝑦 → 𝑥𝑇𝑦)) → ((𝐹‘𝑤)𝑅(𝐺‘𝑤) → (𝐹‘𝑤)𝑇(𝐺‘𝑤))) |
15 | 2, 4, 7, 14 | syl21anc 1200 | . . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤)𝑅(𝐺‘𝑤) → (𝐹‘𝑤)𝑇(𝐺‘𝑤))) |
16 | 15 | ralimdva 2476 | . 2 ⊢ (𝜑 → (∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑅(𝐺‘𝑤) → ∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑇(𝐺‘𝑤))) |
17 | ffn 5242 | . . . 4 ⊢ (𝐹:𝐴⟶𝑆 → 𝐹 Fn 𝐴) | |
18 | 1, 17 | syl 14 | . . 3 ⊢ (𝜑 → 𝐹 Fn 𝐴) |
19 | ffn 5242 | . . . 4 ⊢ (𝐺:𝐴⟶𝑆 → 𝐺 Fn 𝐴) | |
20 | 3, 19 | syl 14 | . . 3 ⊢ (𝜑 → 𝐺 Fn 𝐴) |
21 | caofref.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
22 | inidm 3255 | . . 3 ⊢ (𝐴 ∩ 𝐴) = 𝐴 | |
23 | eqidd 2118 | . . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) = (𝐹‘𝑤)) | |
24 | eqidd 2118 | . . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) = (𝐺‘𝑤)) | |
25 | 18, 20, 21, 21, 22, 23, 24 | ofrfval 5958 | . 2 ⊢ (𝜑 → (𝐹 ∘𝑟 𝑅𝐺 ↔ ∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑅(𝐺‘𝑤))) |
26 | 18, 20, 21, 21, 22, 23, 24 | ofrfval 5958 | . 2 ⊢ (𝜑 → (𝐹 ∘𝑟 𝑇𝐺 ↔ ∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑇(𝐺‘𝑤))) |
27 | 16, 25, 26 | 3imtr4d 202 | 1 ⊢ (𝜑 → (𝐹 ∘𝑟 𝑅𝐺 → 𝐹 ∘𝑟 𝑇𝐺)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1316 ∈ wcel 1465 ∀wral 2393 class class class wbr 3899 Fn wfn 5088 ⟶wf 5089 ‘cfv 5093 ∘𝑟 cofr 5949 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 683 ax-5 1408 ax-7 1409 ax-gen 1410 ax-ie1 1454 ax-ie2 1455 ax-8 1467 ax-10 1468 ax-11 1469 ax-i12 1470 ax-bndl 1471 ax-4 1472 ax-14 1477 ax-17 1491 ax-i9 1495 ax-ial 1499 ax-i5r 1500 ax-ext 2099 ax-coll 4013 ax-sep 4016 ax-pow 4068 ax-pr 4101 |
This theorem depends on definitions: df-bi 116 df-3an 949 df-tru 1319 df-nf 1422 df-sb 1721 df-eu 1980 df-mo 1981 df-clab 2104 df-cleq 2110 df-clel 2113 df-nfc 2247 df-ral 2398 df-rex 2399 df-reu 2400 df-rab 2402 df-v 2662 df-sbc 2883 df-csb 2976 df-un 3045 df-in 3047 df-ss 3054 df-pw 3482 df-sn 3503 df-pr 3504 df-op 3506 df-uni 3707 df-iun 3785 df-br 3900 df-opab 3960 df-mpt 3961 df-id 4185 df-xp 4515 df-rel 4516 df-cnv 4517 df-co 4518 df-dm 4519 df-rn 4520 df-res 4521 df-ima 4522 df-iota 5058 df-fun 5095 df-fn 5096 df-f 5097 df-f1 5098 df-fo 5099 df-f1o 5100 df-fv 5101 df-ofr 5951 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |