![]() |
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 7098 | . . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) ∈ 𝑆) |
3 | caofcom.3 | . . . . 5 ⊢ (𝜑 → 𝐺:𝐴⟶𝑆) | |
4 | 3 | ffvelcdmda 7098 | . . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) ∈ 𝑆) |
5 | caofrss.4 | . . . . . 6 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝑅𝑦 → 𝑥𝑇𝑦)) | |
6 | 5 | ralrimivva 3191 | . . . . 5 ⊢ (𝜑 → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥𝑅𝑦 → 𝑥𝑇𝑦)) |
7 | 6 | adantr 479 | . . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥𝑅𝑦 → 𝑥𝑇𝑦)) |
8 | breq1 5156 | . . . . . 6 ⊢ (𝑥 = (𝐹‘𝑤) → (𝑥𝑅𝑦 ↔ (𝐹‘𝑤)𝑅𝑦)) | |
9 | breq1 5156 | . . . . . 6 ⊢ (𝑥 = (𝐹‘𝑤) → (𝑥𝑇𝑦 ↔ (𝐹‘𝑤)𝑇𝑦)) | |
10 | 8, 9 | imbi12d 343 | . . . . 5 ⊢ (𝑥 = (𝐹‘𝑤) → ((𝑥𝑅𝑦 → 𝑥𝑇𝑦) ↔ ((𝐹‘𝑤)𝑅𝑦 → (𝐹‘𝑤)𝑇𝑦))) |
11 | breq2 5157 | . . . . . 6 ⊢ (𝑦 = (𝐺‘𝑤) → ((𝐹‘𝑤)𝑅𝑦 ↔ (𝐹‘𝑤)𝑅(𝐺‘𝑤))) | |
12 | breq2 5157 | . . . . . 6 ⊢ (𝑦 = (𝐺‘𝑤) → ((𝐹‘𝑤)𝑇𝑦 ↔ (𝐹‘𝑤)𝑇(𝐺‘𝑤))) | |
13 | 11, 12 | imbi12d 343 | . . . . 5 ⊢ (𝑦 = (𝐺‘𝑤) → (((𝐹‘𝑤)𝑅𝑦 → (𝐹‘𝑤)𝑇𝑦) ↔ ((𝐹‘𝑤)𝑅(𝐺‘𝑤) → (𝐹‘𝑤)𝑇(𝐺‘𝑤)))) |
14 | 10, 13 | rspc2va 3620 | . . . 4 ⊢ ((((𝐹‘𝑤) ∈ 𝑆 ∧ (𝐺‘𝑤) ∈ 𝑆) ∧ ∀𝑥 ∈ 𝑆 ∀𝑦 ∈ 𝑆 (𝑥𝑅𝑦 → 𝑥𝑇𝑦)) → ((𝐹‘𝑤)𝑅(𝐺‘𝑤) → (𝐹‘𝑤)𝑇(𝐺‘𝑤))) |
15 | 2, 4, 7, 14 | syl21anc 836 | . . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤)𝑅(𝐺‘𝑤) → (𝐹‘𝑤)𝑇(𝐺‘𝑤))) |
16 | 15 | ralimdva 3157 | . 2 ⊢ (𝜑 → (∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑅(𝐺‘𝑤) → ∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑇(𝐺‘𝑤))) |
17 | 1 | ffnd 6729 | . . 3 ⊢ (𝜑 → 𝐹 Fn 𝐴) |
18 | 3 | ffnd 6729 | . . 3 ⊢ (𝜑 → 𝐺 Fn 𝐴) |
19 | caofref.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
20 | inidm 4220 | . . 3 ⊢ (𝐴 ∩ 𝐴) = 𝐴 | |
21 | eqidd 2727 | . . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) = (𝐹‘𝑤)) | |
22 | eqidd 2727 | . . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) = (𝐺‘𝑤)) | |
23 | 17, 18, 19, 19, 20, 21, 22 | ofrfval 7700 | . 2 ⊢ (𝜑 → (𝐹 ∘r 𝑅𝐺 ↔ ∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑅(𝐺‘𝑤))) |
24 | 17, 18, 19, 19, 20, 21, 22 | ofrfval 7700 | . 2 ⊢ (𝜑 → (𝐹 ∘r 𝑇𝐺 ↔ ∀𝑤 ∈ 𝐴 (𝐹‘𝑤)𝑇(𝐺‘𝑤))) |
25 | 16, 23, 24 | 3imtr4d 293 | 1 ⊢ (𝜑 → (𝐹 ∘r 𝑅𝐺 → 𝐹 ∘r 𝑇𝐺)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 = wceq 1534 ∈ wcel 2099 ∀wral 3051 class class class wbr 5153 ⟶wf 6550 ‘cfv 6554 ∘r cofr 7689 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2697 ax-rep 5290 ax-sep 5304 ax-nul 5311 ax-pr 5433 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2704 df-cleq 2718 df-clel 2803 df-nfc 2878 df-ne 2931 df-ral 3052 df-rex 3061 df-reu 3365 df-rab 3420 df-v 3464 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4326 df-if 4534 df-sn 4634 df-pr 4636 df-op 4640 df-uni 4914 df-iun 5003 df-br 5154 df-opab 5216 df-mpt 5237 df-id 5580 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-iota 6506 df-fun 6556 df-fn 6557 df-f 6558 df-f1 6559 df-fo 6560 df-f1o 6561 df-fv 6562 df-ofr 7691 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |