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

Theorem omf1o 9081
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 2762 . . . . . 6 (𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) = (𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥))
21omxpenlem 9079 . . . . 5 ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)):(𝐴 × 𝐵)–1-1-onto→(𝐵 ·o 𝐴))
32ancoms 464 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)):(𝐴 × 𝐵)–1-1-onto→(𝐵 ·o 𝐴))
4 eqid 2762 . . . . 5 (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧}) = (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧})
54xpcomf1o 9067 . . . 4 (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧}):(𝐵 × 𝐴)–1-1-onto→(𝐴 × 𝐵)
6 f1oco 6845 . . . 4 (((𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)):(𝐴 × 𝐵)–1-1-onto→(𝐵 ·o 𝐴) ∧ (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧}):(𝐵 × 𝐴)–1-1-onto→(𝐴 × 𝐵)) → ((𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧})):(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴))
73, 5, 6sylancl 598 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧})):(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴))
8 omf1o.2 . . . . 5 𝐺 = (𝑥𝐵, 𝑦𝐴 ↦ ((𝐵 ·o 𝑦) +o 𝑥))
94, 1xpcomco 9068 . . . . 5 ((𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧})) = (𝑥𝐵, 𝑦𝐴 ↦ ((𝐵 ·o 𝑦) +o 𝑥))
108, 9eqtr4i 2788 . . . 4 𝐺 = ((𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧}))
11 f1oeq1 6809 . . . 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 237 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐺:(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴))
14 omf1o.1 . . . 4 𝐹 = (𝑥𝐵, 𝑦𝐴 ↦ ((𝐴 ·o 𝑥) +o 𝑦))
1514omxpenlem 9079 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐹:(𝐵 × 𝐴)–1-1-onto→(𝐴 ·o 𝐵))
16 f1ocnv 6834 . . 3 (𝐹:(𝐵 × 𝐴)–1-1-onto→(𝐴 ·o 𝐵) → 𝐹:(𝐴 ·o 𝐵)–1-1-onto→(𝐵 × 𝐴))
1715, 16syl 18 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐹:(𝐴 ·o 𝐵)–1-1-onto→(𝐵 × 𝐴))
18 f1oco 6845 . 2 ((𝐺:(𝐵 × 𝐴)–1-1-onto→(𝐵 ·o 𝐴) ∧ 𝐹:(𝐴 ·o 𝐵)–1-1-onto→(𝐵 × 𝐴)) → (𝐺𝐹):(𝐴 ·o 𝐵)–1-1-onto→(𝐵 ·o 𝐴))
1913, 17, 18syl2anc 596 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐺𝐹):(𝐴 ·o 𝐵)–1-1-onto→(𝐵 ·o 𝐴))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401   = wceq 1570  wcel 2145  {csn 4587   cuni 4870  cmpt 5190   × cxp 5657  ccnv 5658  ccom 5663  Oncon0 6361  1-1-ontowf1o 6536  (class class class)co 7416  cmpo 7418   +o coa 8455   ·o comu 8456
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7739
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7866  df-1st 7989  df-2nd 7990  df-frecs 8283  df-wrecs 8314  df-recs 8363  df-rdg 8402  df-1o 8458  df-oadd 8462  df-omul 8463
This theorem is used by:  cnfcom3  9686  infxpenc  10024
  Copyright terms: Public domain W3C validator