Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > omf1o | Structured version Visualization version GIF version |
Description: Construct an explicit bijection from 𝐴 ·o 𝐵 to 𝐵 ·o 𝐴. (Contributed by Mario Carneiro, 30-May-2015.) |
Ref | Expression |
---|---|
omf1o.1 | ⊢ 𝐹 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐴 ↦ ((𝐴 ·o 𝑥) +o 𝑦)) |
omf1o.2 | ⊢ 𝐺 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐴 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) |
Ref | Expression |
---|---|
omf1o | ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐺 ∘ ◡𝐹):(𝐴 ·o 𝐵)–1-1-onto→(𝐵 ·o 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2824 | . . . . . 6 ⊢ (𝑦 ∈ 𝐴, 𝑥 ∈ 𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) = (𝑦 ∈ 𝐴, 𝑥 ∈ 𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) | |
2 | 1 | omxpenlem 8621 | . . . . 5 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝑦 ∈ 𝐴, 𝑥 ∈ 𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)):(𝐴 × 𝐵)–1-1-onto→(𝐵 ·o 𝐴)) |
3 | 2 | ancoms 461 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑦 ∈ 𝐴, 𝑥 ∈ 𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)):(𝐴 × 𝐵)–1-1-onto→(𝐵 ·o 𝐴)) |
4 | eqid 2824 | . . . . 5 ⊢ (𝑧 ∈ (𝐵 × 𝐴) ↦ ∪ ◡{𝑧}) = (𝑧 ∈ (𝐵 × 𝐴) ↦ ∪ ◡{𝑧}) | |
5 | 4 | xpcomf1o 8609 | . . . 4 ⊢ (𝑧 ∈ (𝐵 × 𝐴) ↦ ∪ ◡{𝑧}):(𝐵 × 𝐴)–1-1-onto→(𝐴 × 𝐵) |
6 | f1oco 6640 | . . . 4 ⊢ (((𝑦 ∈ 𝐴, 𝑥 ∈ 𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)):(𝐴 × 𝐵)–1-1-onto→(𝐵 ·o 𝐴) ∧ (𝑧 ∈ (𝐵 × 𝐴) ↦ ∪ ◡{𝑧}):(𝐵 × 𝐴)–1-1-onto→(𝐴 × 𝐵)) → ((𝑦 ∈ 𝐴, 𝑥 ∈ 𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ ∪ ◡{𝑧})):(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴)) | |
7 | 3, 5, 6 | sylancl 588 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑦 ∈ 𝐴, 𝑥 ∈ 𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ ∪ ◡{𝑧})):(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴)) |
8 | omf1o.2 | . . . . 5 ⊢ 𝐺 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐴 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) | |
9 | 4, 1 | xpcomco 8610 | . . . . 5 ⊢ ((𝑦 ∈ 𝐴, 𝑥 ∈ 𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ ∪ ◡{𝑧})) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐴 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) |
10 | 8, 9 | eqtr4i 2850 | . . . 4 ⊢ 𝐺 = ((𝑦 ∈ 𝐴, 𝑥 ∈ 𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ ∪ ◡{𝑧})) |
11 | f1oeq1 6607 | . . . 4 ⊢ (𝐺 = ((𝑦 ∈ 𝐴, 𝑥 ∈ 𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ ∪ ◡{𝑧})) → (𝐺:(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴) ↔ ((𝑦 ∈ 𝐴, 𝑥 ∈ 𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ ∪ ◡{𝑧})):(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴))) | |
12 | 10, 11 | ax-mp 5 | . . 3 ⊢ (𝐺:(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴) ↔ ((𝑦 ∈ 𝐴, 𝑥 ∈ 𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ ∪ ◡{𝑧})):(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴)) |
13 | 7, 12 | sylibr 236 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐺:(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴)) |
14 | omf1o.1 | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐴 ↦ ((𝐴 ·o 𝑥) +o 𝑦)) | |
15 | 14 | omxpenlem 8621 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐹:(𝐵 × 𝐴)–1-1-onto→(𝐴 ·o 𝐵)) |
16 | f1ocnv 6630 | . . 3 ⊢ (𝐹:(𝐵 × 𝐴)–1-1-onto→(𝐴 ·o 𝐵) → ◡𝐹:(𝐴 ·o 𝐵)–1-1-onto→(𝐵 × 𝐴)) | |
17 | 15, 16 | syl 17 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ◡𝐹:(𝐴 ·o 𝐵)–1-1-onto→(𝐵 × 𝐴)) |
18 | f1oco 6640 | . 2 ⊢ ((𝐺:(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴) ∧ ◡𝐹:(𝐴 ·o 𝐵)–1-1-onto→(𝐵 × 𝐴)) → (𝐺 ∘ ◡𝐹):(𝐴 ·o 𝐵)–1-1-onto→(𝐵 ·o 𝐴)) | |
19 | 13, 17, 18 | syl2anc 586 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐺 ∘ ◡𝐹):(𝐴 ·o 𝐵)–1-1-onto→(𝐵 ·o 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1536 ∈ wcel 2113 {csn 4570 ∪ cuni 4841 ↦ cmpt 5149 × cxp 5556 ◡ccnv 5557 ∘ ccom 5562 Oncon0 6194 –1-1-onto→wf1o 6357 (class class class)co 7159 ∈ cmpo 7161 +o coa 8102 ·o comu 8103 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2796 ax-rep 5193 ax-sep 5206 ax-nul 5213 ax-pow 5269 ax-pr 5333 ax-un 7464 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2803 df-cleq 2817 df-clel 2896 df-nfc 2966 df-ne 3020 df-ral 3146 df-rex 3147 df-reu 3148 df-rmo 3149 df-rab 3150 df-v 3499 df-sbc 3776 df-csb 3887 df-dif 3942 df-un 3944 df-in 3946 df-ss 3955 df-pss 3957 df-nul 4295 df-if 4471 df-pw 4544 df-sn 4571 df-pr 4573 df-tp 4575 df-op 4577 df-uni 4842 df-int 4880 df-iun 4924 df-br 5070 df-opab 5132 df-mpt 5150 df-tr 5176 df-id 5463 df-eprel 5468 df-po 5477 df-so 5478 df-fr 5517 df-we 5519 df-xp 5564 df-rel 5565 df-cnv 5566 df-co 5567 df-dm 5568 df-rn 5569 df-res 5570 df-ima 5571 df-pred 6151 df-ord 6197 df-on 6198 df-lim 6199 df-suc 6200 df-iota 6317 df-fun 6360 df-fn 6361 df-f 6362 df-f1 6363 df-fo 6364 df-f1o 6365 df-fv 6366 df-ov 7162 df-oprab 7163 df-mpo 7164 df-om 7584 df-1st 7692 df-2nd 7693 df-wrecs 7950 df-recs 8011 df-rdg 8049 df-1o 8105 df-oadd 8109 df-omul 8110 |
This theorem is referenced by: cnfcom3 9170 infxpenc 9447 |
Copyright terms: Public domain | W3C validator |