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

Theorem omf1o 9075
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 2765 . . . . . 6 (𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) = (𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥))
21omxpenlem 9073 . . . . 5 ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)):(𝐴 × 𝐵)–1-1-onto→(𝐵 ·o 𝐴))
32ancoms 464 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)):(𝐴 × 𝐵)–1-1-onto→(𝐵 ·o 𝐴))
4 eqid 2765 . . . . 5 (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧}) = (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧})
54xpcomf1o 9061 . . . 4 (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧}):(𝐵 × 𝐴)–1-1-onto→(𝐴 × 𝐵)
6 f1oco 6848 . . . 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 9062 . . . . 5 ((𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧})) = (𝑥𝐵, 𝑦𝐴 ↦ ((𝐵 ·o 𝑦) +o 𝑥))
108, 9eqtr4i 2791 . . . 4 𝐺 = ((𝑦𝐴, 𝑥𝐵 ↦ ((𝐵 ·o 𝑦) +o 𝑥)) ∘ (𝑧 ∈ (𝐵 × 𝐴) ↦ {𝑧}))
11 f1oeq1 6812 . . . 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 9073 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐹:(𝐵 × 𝐴)–1-1-onto→(𝐴 ·o 𝐵))
16 f1ocnv 6837 . . 3 (𝐹:(𝐵 × 𝐴)–1-1-onto→(𝐴 ·o 𝐵) → 𝐹:(𝐴 ·o 𝐵)–1-1-onto→(𝐵 × 𝐴))
1715, 16syl 18 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐹:(𝐴 ·o 𝐵)–1-1-onto→(𝐵 × 𝐴))
18 f1oco 6848 . 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 2146  {csn 4591   cuni 4874  cmpt 5194   × cxp 5661  ccnv 5662  ccom 5667  Oncon0 6364  1-1-ontowf1o 6539  (class class class)co 7419  cmpo 7421   +o coa 8456   ·o comu 8457
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742
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 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-1st 7992  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-oadd 8463  df-omul 8464
This theorem is used by:  cnfcom3  9680  infxpenc  10018
  Copyright terms: Public domain W3C validator