| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > caofcom | Structured version Visualization version GIF version | ||
| Description: Transfer a commutative law to the function operation. (Contributed by Mario Carneiro, 26-Jul-2014.) |
| Ref | Expression |
|---|---|
| caofref.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| caofref.2 | ⊢ (𝜑 → 𝐹:𝐴⟶𝑆) |
| caofcom.3 | ⊢ (𝜑 → 𝐺:𝐴⟶𝑆) |
| caofcom.4 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝑅𝑦) = (𝑦𝑅𝑥)) |
| Ref | Expression |
|---|---|
| caofcom | ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝐺 ∘f 𝑅𝐹)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | caofref.2 | . . . . . 6 ⊢ (𝜑 → 𝐹:𝐴⟶𝑆) | |
| 2 | 1 | ffvelcdmda 7116 | . . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐹‘𝑤) ∈ 𝑆) |
| 3 | caofcom.3 | . . . . . 6 ⊢ (𝜑 → 𝐺:𝐴⟶𝑆) | |
| 4 | 3 | ffvelcdmda 7116 | . . . . 5 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → (𝐺‘𝑤) ∈ 𝑆) |
| 5 | 2, 4 | jca 521 | . . . 4 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤) ∈ 𝑆 ∧ (𝐺‘𝑤) ∈ 𝑆)) |
| 6 | caofcom.4 | . . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑆 ∧ 𝑦 ∈ 𝑆)) → (𝑥𝑅𝑦) = (𝑦𝑅𝑥)) | |
| 7 | 6 | caovcomg 7648 | . . . 4 ⊢ ((𝜑 ∧ ((𝐹‘𝑤) ∈ 𝑆 ∧ (𝐺‘𝑤) ∈ 𝑆)) → ((𝐹‘𝑤)𝑅(𝐺‘𝑤)) = ((𝐺‘𝑤)𝑅(𝐹‘𝑤))) |
| 8 | 5, 7 | syldan 603 | . . 3 ⊢ ((𝜑 ∧ 𝑤 ∈ 𝐴) → ((𝐹‘𝑤)𝑅(𝐺‘𝑤)) = ((𝐺‘𝑤)𝑅(𝐹‘𝑤))) |
| 9 | 8 | mpteq2dva 5204 | . 2 ⊢ (𝜑 → (𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑅(𝐺‘𝑤))) = (𝑤 ∈ 𝐴 ↦ ((𝐺‘𝑤)𝑅(𝐹‘𝑤)))) |
| 10 | caofref.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 11 | 1 | feqmptd 6984 | . . 3 ⊢ (𝜑 → 𝐹 = (𝑤 ∈ 𝐴 ↦ (𝐹‘𝑤))) |
| 12 | 3 | feqmptd 6984 | . . 3 ⊢ (𝜑 → 𝐺 = (𝑤 ∈ 𝐴 ↦ (𝐺‘𝑤))) |
| 13 | 10, 2, 4, 11, 12 | offval2 7745 | . 2 ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝑤 ∈ 𝐴 ↦ ((𝐹‘𝑤)𝑅(𝐺‘𝑤)))) |
| 14 | 10, 4, 2, 12, 11 | offval2 7745 | . 2 ⊢ (𝜑 → (𝐺 ∘f 𝑅𝐹) = (𝑤 ∈ 𝐴 ↦ ((𝐺‘𝑤)𝑅(𝐹‘𝑤)))) |
| 15 | 9, 13, 14 | 3eqtr4d 2808 | 1 ⊢ (𝜑 → (𝐹 ∘f 𝑅𝐺) = (𝐺 ∘f 𝑅𝐹)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ↦ cmpt 5192 ⟶wf 6562 ‘cfv 6566 (class class class)co 7451 ∘f cof 7723 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pr 5398 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-id 5553 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-ov 7454 df-oprab 7455 df-mpo 7456 df-of 7725 |
| This theorem is used by: plyn0mulidp 26657 plydivlem4 26672 quotcan 26687 dchrabl 27638 lfladdcom 40395 expgrowth 45580 amgmwlem 51415 |
| Copyright terms: Public domain | W3C validator |