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

Theorem oacomf1o 8494
Description: Define a bijection from 𝐴 +o 𝐵 to 𝐵 +o 𝐴. Thus, the two are equinumerous even if they are not equal (which sometimes occurs, e.g., oancom 9566). (Contributed by Mario Carneiro, 30-May-2015.)
Hypothesis
Ref Expression
oacomf1o.1 𝐹 = ((𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ (𝑥𝐵 ↦ (𝐴 +o 𝑥)))
Assertion
Ref Expression
oacomf1o ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐹:(𝐴 +o 𝐵)–1-1-onto→(𝐵 +o 𝐴))
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hint:   𝐹(𝑥)

Proof of Theorem oacomf1o
StepHypRef Expression
1 eqid 2737 . . . . . . 7 (𝑥𝐴 ↦ (𝐵 +o 𝑥)) = (𝑥𝐴 ↦ (𝐵 +o 𝑥))
21oacomf1olem 8493 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑥𝐴 ↦ (𝐵 +o 𝑥)):𝐴1-1-onto→ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∧ (ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∩ 𝐵) = ∅))
32simpld 494 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑥𝐴 ↦ (𝐵 +o 𝑥)):𝐴1-1-onto→ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)))
4 eqid 2737 . . . . . . . . 9 (𝑥𝐵 ↦ (𝐴 +o 𝑥)) = (𝑥𝐵 ↦ (𝐴 +o 𝑥))
54oacomf1olem 8493 . . . . . . . 8 ((𝐵 ∈ On ∧ 𝐴 ∈ On) → ((𝑥𝐵 ↦ (𝐴 +o 𝑥)):𝐵1-1-onto→ran (𝑥𝐵 ↦ (𝐴 +o 𝑥)) ∧ (ran (𝑥𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴) = ∅))
65ancoms 458 . . . . . . 7 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑥𝐵 ↦ (𝐴 +o 𝑥)):𝐵1-1-onto→ran (𝑥𝐵 ↦ (𝐴 +o 𝑥)) ∧ (ran (𝑥𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴) = ∅))
76simpld 494 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑥𝐵 ↦ (𝐴 +o 𝑥)):𝐵1-1-onto→ran (𝑥𝐵 ↦ (𝐴 +o 𝑥)))
8 f1ocnv 6787 . . . . . 6 ((𝑥𝐵 ↦ (𝐴 +o 𝑥)):𝐵1-1-onto→ran (𝑥𝐵 ↦ (𝐴 +o 𝑥)) → (𝑥𝐵 ↦ (𝐴 +o 𝑥)):ran (𝑥𝐵 ↦ (𝐴 +o 𝑥))–1-1-onto𝐵)
97, 8syl 17 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑥𝐵 ↦ (𝐴 +o 𝑥)):ran (𝑥𝐵 ↦ (𝐴 +o 𝑥))–1-1-onto𝐵)
10 incom 4150 . . . . . 6 (𝐴 ∩ ran (𝑥𝐵 ↦ (𝐴 +o 𝑥))) = (ran (𝑥𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴)
116simprd 495 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (ran (𝑥𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴) = ∅)
1210, 11eqtrid 2784 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∩ ran (𝑥𝐵 ↦ (𝐴 +o 𝑥))) = ∅)
132simprd 495 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∩ 𝐵) = ∅)
14 f1oun 6794 . . . . 5 ((((𝑥𝐴 ↦ (𝐵 +o 𝑥)):𝐴1-1-onto→ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∧ (𝑥𝐵 ↦ (𝐴 +o 𝑥)):ran (𝑥𝐵 ↦ (𝐴 +o 𝑥))–1-1-onto𝐵) ∧ ((𝐴 ∩ ran (𝑥𝐵 ↦ (𝐴 +o 𝑥))) = ∅ ∧ (ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∩ 𝐵) = ∅)) → ((𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ (𝑥𝐵 ↦ (𝐴 +o 𝑥))):(𝐴 ∪ ran (𝑥𝐵 ↦ (𝐴 +o 𝑥)))–1-1-onto→(ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵))
153, 9, 12, 13, 14syl22anc 839 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ (𝑥𝐵 ↦ (𝐴 +o 𝑥))):(𝐴 ∪ ran (𝑥𝐵 ↦ (𝐴 +o 𝑥)))–1-1-onto→(ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵))
16 oacomf1o.1 . . . . 5 𝐹 = ((𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ (𝑥𝐵 ↦ (𝐴 +o 𝑥)))
17 f1oeq1 6763 . . . . 5 (𝐹 = ((𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ (𝑥𝐵 ↦ (𝐴 +o 𝑥))) → (𝐹:(𝐴 ∪ ran (𝑥𝐵 ↦ (𝐴 +o 𝑥)))–1-1-onto→(ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵) ↔ ((𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ (𝑥𝐵 ↦ (𝐴 +o 𝑥))):(𝐴 ∪ ran (𝑥𝐵 ↦ (𝐴 +o 𝑥)))–1-1-onto→(ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵)))
1816, 17ax-mp 5 . . . 4 (𝐹:(𝐴 ∪ ran (𝑥𝐵 ↦ (𝐴 +o 𝑥)))–1-1-onto→(ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵) ↔ ((𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ (𝑥𝐵 ↦ (𝐴 +o 𝑥))):(𝐴 ∪ ran (𝑥𝐵 ↦ (𝐴 +o 𝑥)))–1-1-onto→(ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵))
1915, 18sylibr 234 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐹:(𝐴 ∪ ran (𝑥𝐵 ↦ (𝐴 +o 𝑥)))–1-1-onto→(ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵))
20 oarec 8491 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) = (𝐴 ∪ ran (𝑥𝐵 ↦ (𝐴 +o 𝑥))))
2120f1oeq2d 6771 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐹:(𝐴 +o 𝐵)–1-1-onto→(ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵) ↔ 𝐹:(𝐴 ∪ ran (𝑥𝐵 ↦ (𝐴 +o 𝑥)))–1-1-onto→(ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵)))
2219, 21mpbird 257 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐹:(𝐴 +o 𝐵)–1-1-onto→(ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵))
23 oarec 8491 . . . . 5 ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝐵 +o 𝐴) = (𝐵 ∪ ran (𝑥𝐴 ↦ (𝐵 +o 𝑥))))
2423ancoms 458 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 +o 𝐴) = (𝐵 ∪ ran (𝑥𝐴 ↦ (𝐵 +o 𝑥))))
25 uncom 4099 . . . 4 (𝐵 ∪ ran (𝑥𝐴 ↦ (𝐵 +o 𝑥))) = (ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵)
2624, 25eqtrdi 2788 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 +o 𝐴) = (ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵))
2726f1oeq3d 6772 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐹:(𝐴 +o 𝐵)–1-1-onto→(𝐵 +o 𝐴) ↔ 𝐹:(𝐴 +o 𝐵)–1-1-onto→(ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵)))
2822, 27mpbird 257 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → 𝐹:(𝐴 +o 𝐵)–1-1-onto→(𝐵 +o 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395   = wceq 1542  wcel 2114  cun 3888  cin 3889  c0 4274  cmpt 5167  ccnv 5624  ran crn 5626  Oncon0 6318  1-1-ontowf1o 6492  (class class class)co 7361   +o coa 8396
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pr 5371  ax-un 7683
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5520  df-eprel 5525  df-po 5533  df-so 5534  df-fr 5578  df-we 5580  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-pred 6260  df-ord 6321  df-on 6322  df-lim 6323  df-suc 6324  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-ov 7364  df-oprab 7365  df-mpo 7366  df-om 7812  df-2nd 7937  df-frecs 8225  df-wrecs 8256  df-recs 8305  df-rdg 8343  df-oadd 8403
This theorem is referenced by:  cnfcomlem  9614
  Copyright terms: Public domain W3C validator