MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  omf1o Structured version   Visualization version   GIF version

Theorem omf1o 9002
Description: Construct an explicit bijection from 𝐴 ·o 𝐵 to 𝐵 ·o 𝐴. (Contributed by Mario Carneiro, 30-May-2015.)
Hypotheses
Ref Expression
omf1o.1 𝐹 = (𝑥𝐵, 𝑦𝐴 ↦ ((𝐴 ·o 𝑥) +o 𝑦))
omf1o.2 𝐺 = (𝑥𝐵, 𝑦𝐴 ↦ ((𝐵 ·o 𝑦) +o 𝑥))
Assertion
Ref Expression
omf1o ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐺𝐹):(𝐴 ·o 𝐵)–1-1-onto→(𝐵 ·o 𝐴))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑥,𝐵,𝑦
Allowed substitution hints:   𝐹(𝑥,𝑦)   𝐺(𝑥,𝑦)

Proof of Theorem omf1o
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 eqid 2733 . . . . . 6 (𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) = (𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥))
21omxpenlem 9000 . . . . 5 ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)):(𝐴 × 𝐵)–1-1-onto→(𝐵 ·o 𝐴))
32ancoms 458 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)):(𝐴 × 𝐵)–1-1-onto→(𝐵 ·o 𝐴))
4 eqid 2733 . . . . 5 (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧}) = (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧})
54xpcomf1o 8988 . . . 4 (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧}):(𝐵 × 𝐴)–1-1-onto→(𝐴 × 𝐵)
6 f1oco 6793 . . . 4 (((𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)):(𝐴 × 𝐵)–1-1-onto→(𝐵 ·o 𝐴) ∧ (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧}):(𝐵 × 𝐴)–1-1-onto→(𝐴 × 𝐵)) → ((𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧})):(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴))
73, 5, 6sylancl 586 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧})):(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴))
8 omf1o.2 . . . . 5 𝐺 = (𝑥𝐵, 𝑦𝐴 ↦ ((𝐵 ·o 𝑦) +o 𝑥))
94, 1xpcomco 8989 . . . . 5 ((𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧})) = (𝑥𝐵, 𝑦𝐴 ↦ ((𝐵 ·o 𝑦) +o 𝑥))
108, 9eqtr4i 2759 . . . 4 𝐺 = ((𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧}))
11 f1oeq1 6758 . . . 4 (𝐺 = ((𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧})) → (𝐺:(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴) ↔ ((𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧})):(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴)))
1210, 11ax-mp 5 . . 3 (𝐺:(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴) ↔ ((𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧})):(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴))
137, 12sylibr 234 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐺:(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴))
14 omf1o.1 . . . 4 𝐹 = (𝑥𝐵, 𝑦𝐴 ↦ ((𝐴 ·o 𝑥) +o 𝑦))
1514omxpenlem 9000 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐹:(𝐵 × 𝐴)–1-1-onto→(𝐴 ·o 𝐵))
16 f1ocnv 6782 . . 3 (𝐹:(𝐵 × 𝐴)–1-1-onto→(𝐴 ·o 𝐵) → 𝐹:(𝐴 ·o 𝐵)–1-1-onto→(𝐵 × 𝐴))
1715, 16syl 17 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐹:(𝐴 ·o 𝐵)–1-1-onto→(𝐵 × 𝐴))
18 f1oco 6793 . 2 ((𝐺:(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴) ∧ 𝐹:(𝐴 ·o 𝐵)–1-1-onto→(𝐵 × 𝐴)) → (𝐺𝐹):(𝐴 ·o 𝐵)–1-1-onto→(𝐵 ·o 𝐴))
1913, 17, 18syl2anc 584 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐺𝐹):(𝐴 ·o 𝐵)–1-1-onto→(𝐵 ·o 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1541  wcel 2113  {csn 4577   cuni 4860  cmpt 5176   × cxp 5619  ccnv 5620  ccom 5625  Oncon0 6313  1-1-ontowf1o 6487  (class class class)co 7354  cmpo 7356   +o coa 8390   ·o comu 8391
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-rep 5221  ax-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7676
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4861  df-int 4900  df-iun 4945  df-br 5096  df-opab 5158  df-mpt 5177  df-tr 5203  df-id 5516  df-eprel 5521  df-po 5529  df-so 5530  df-fr 5574  df-we 5576  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-res 5633  df-ima 5634  df-pred 6255  df-ord 6316  df-on 6317  df-lim 6318  df-suc 6319  df-iota 6444  df-fun 6490  df-fn 6491  df-f 6492  df-f1 6493  df-fo 6494  df-f1o 6495  df-fv 6496  df-ov 7357  df-oprab 7358  df-mpo 7359  df-om 7805  df-1st 7929  df-2nd 7930  df-frecs 8219  df-wrecs 8250  df-recs 8299  df-rdg 8337  df-1o 8393  df-oadd 8397  df-omul 8398
This theorem is referenced by:  cnfcom3  9603  infxpenc  9918
  Copyright terms: Public domain W3C validator