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 2738 | . . . . . 6 ⊢ (𝑦 ∈ 𝐴, 𝑥 ∈ 𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) = (𝑦 ∈ 𝐴, 𝑥 ∈ 𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) | |
2 | 1 | omxpenlem 8667 | . . . . 5 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝑦 ∈ 𝐴, 𝑥 ∈ 𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)):(𝐴 × 𝐵)–1-1-onto→(𝐵 ·o 𝐴)) |
3 | 2 | ancoms 462 | . . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑦 ∈ 𝐴, 𝑥 ∈ 𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)):(𝐴 × 𝐵)–1-1-onto→(𝐵 ·o 𝐴)) |
4 | eqid 2738 | . . . . 5 ⊢ (𝑧 ∈ (𝐵 × 𝐴) ↦ ∪ ◡{𝑧}) = (𝑧 ∈ (𝐵 × 𝐴) ↦ ∪ ◡{𝑧}) | |
5 | 4 | xpcomf1o 8655 | . . . 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 589 | . . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑦 ∈ 𝐴, 𝑥 ∈ 𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ ∪ ◡{𝑧})):(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴)) |
8 | omf1o.2 | . . . . 5 ⊢ 𝐺 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐴 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) | |
9 | 4, 1 | xpcomco 8656 | . . . . 5 ⊢ ((𝑦 ∈ 𝐴, 𝑥 ∈ 𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ ∪ ◡{𝑧})) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐴 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) |
10 | 8, 9 | eqtr4i 2764 | . . . 4 ⊢ 𝐺 = ((𝑦 ∈ 𝐴, 𝑥 ∈ 𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ ∪ ◡{𝑧})) |
11 | f1oeq1 6606 | . . . 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 237 | . 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐺:(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴)) |
14 | omf1o.1 | . . . 4 ⊢ 𝐹 = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐴 ↦ ((𝐴 ·o 𝑥) +o 𝑦)) | |
15 | 14 | omxpenlem 8667 | . . 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 587 | 1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐺 ∘ ◡𝐹):(𝐴 ·o 𝐵)–1-1-onto→(𝐵 ·o 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 = wceq 1542 ∈ wcel 2114 {csn 4516 ∪ cuni 4796 ↦ cmpt 5110 × cxp 5523 ◡ccnv 5524 ∘ ccom 5529 Oncon0 6172 –1-1-onto→wf1o 6338 (class class class)co 7170 ∈ cmpo 7172 +o coa 8128 ·o comu 8129 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2020 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2162 ax-12 2179 ax-ext 2710 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5232 ax-pr 5296 ax-un 7479 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2075 df-mo 2540 df-eu 2570 df-clab 2717 df-cleq 2730 df-clel 2811 df-nfc 2881 df-ne 2935 df-ral 3058 df-rex 3059 df-reu 3060 df-rmo 3061 df-rab 3062 df-v 3400 df-sbc 3681 df-csb 3791 df-dif 3846 df-un 3848 df-in 3850 df-ss 3860 df-pss 3862 df-nul 4212 df-if 4415 df-pw 4490 df-sn 4517 df-pr 4519 df-tp 4521 df-op 4523 df-uni 4797 df-int 4837 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-tr 5137 df-id 5429 df-eprel 5434 df-po 5442 df-so 5443 df-fr 5483 df-we 5485 df-xp 5531 df-rel 5532 df-cnv 5533 df-co 5534 df-dm 5535 df-rn 5536 df-res 5537 df-ima 5538 df-pred 6129 df-ord 6175 df-on 6176 df-lim 6177 df-suc 6178 df-iota 6297 df-fun 6341 df-fn 6342 df-f 6343 df-f1 6344 df-fo 6345 df-f1o 6346 df-fv 6347 df-ov 7173 df-oprab 7174 df-mpo 7175 df-om 7600 df-1st 7714 df-2nd 7715 df-wrecs 7976 df-recs 8037 df-rdg 8075 df-1o 8131 df-oadd 8135 df-omul 8136 |
This theorem is referenced by: cnfcom3 9240 infxpenc 9518 |
Copyright terms: Public domain | W3C validator |