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

Theorem oacomf1o 8604
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 9692). (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 2736 . . . . . . 7 (𝑥𝐴 ↦ (𝐵 +o 𝑥)) = (𝑥𝐴 ↦ (𝐵 +o 𝑥))
21oacomf1olem 8603 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑥𝐴 ↦ (𝐵 +o 𝑥)):𝐴1-1-onto→ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∧ (ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∩ 𝐵) = ∅))
32simpld 494 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑥𝐴 ↦ (𝐵 +o 𝑥)):𝐴1-1-onto→ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)))
4 eqid 2736 . . . . . . . . 9 (𝑥𝐵 ↦ (𝐴 +o 𝑥)) = (𝑥𝐵 ↦ (𝐴 +o 𝑥))
54oacomf1olem 8603 . . . . . . . 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 6859 . . . . . 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 4208 . . . . . 6 (𝐴 ∩ ran (𝑥𝐵 ↦ (𝐴 +o 𝑥))) = (ran (𝑥𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴)
116simprd 495 . . . . . 6 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (ran (𝑥𝐵 ↦ (𝐴 +o 𝑥)) ∩ 𝐴) = ∅)
1210, 11eqtrid 2788 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ∩ ran (𝑥𝐵 ↦ (𝐴 +o 𝑥))) = ∅)
132simprd 495 . . . . 5 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∩ 𝐵) = ∅)
14 f1oun 6866 . . . . 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 838 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → ((𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ (𝑥𝐵 ↦ (𝐴 +o 𝑥))):(𝐴 ∪ ran (𝑥𝐵 ↦ (𝐴 +o 𝑥)))–1-1-onto→(ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵))
16 oacomf1o.1 . . . . 5 𝐹 = ((𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ (𝑥𝐵 ↦ (𝐴 +o 𝑥)))
17 f1oeq1 6835 . . . . 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 8601 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 +o 𝐵) = (𝐴 ∪ ran (𝑥𝐵 ↦ (𝐴 +o 𝑥))))
2120f1oeq2d 6843 . . 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 8601 . . . . 5 ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝐵 +o 𝐴) = (𝐵 ∪ ran (𝑥𝐴 ↦ (𝐵 +o 𝑥))))
2423ancoms 458 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 +o 𝐴) = (𝐵 ∪ ran (𝑥𝐴 ↦ (𝐵 +o 𝑥))))
25 uncom 4157 . . . 4 (𝐵 ∪ ran (𝑥𝐴 ↦ (𝐵 +o 𝑥))) = (ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵)
2624, 25eqtrdi 2792 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 +o 𝐴) = (ran (𝑥𝐴 ↦ (𝐵 +o 𝑥)) ∪ 𝐵))
2726f1oeq3d 6844 . 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 1539  wcel 2107  cun 3948  cin 3949  c0 4332  cmpt 5224  ccnv 5683  ran crn 5685  Oncon0 6383  1-1-ontowf1o 6559  (class class class)co 7432   +o coa 8504
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2707  ax-rep 5278  ax-sep 5295  ax-nul 5305  ax-pr 5431  ax-un 7756
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2728  df-clel 2815  df-nfc 2891  df-ne 2940  df-ral 3061  df-rex 3070  df-rmo 3379  df-reu 3380  df-rab 3436  df-v 3481  df-sbc 3788  df-csb 3899  df-dif 3953  df-un 3955  df-in 3957  df-ss 3967  df-pss 3970  df-nul 4333  df-if 4525  df-pw 4601  df-sn 4626  df-pr 4628  df-op 4632  df-uni 4907  df-int 4946  df-iun 4992  df-br 5143  df-opab 5205  df-mpt 5225  df-tr 5259  df-id 5577  df-eprel 5583  df-po 5591  df-so 5592  df-fr 5636  df-we 5638  df-xp 5690  df-rel 5691  df-cnv 5692  df-co 5693  df-dm 5694  df-rn 5695  df-res 5696  df-ima 5697  df-pred 6320  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6513  df-fun 6562  df-fn 6563  df-f 6564  df-f1 6565  df-fo 6566  df-f1o 6567  df-fv 6568  df-ov 7435  df-oprab 7436  df-mpo 7437  df-om 7889  df-2nd 8016  df-frecs 8307  df-wrecs 8338  df-recs 8412  df-rdg 8451  df-oadd 8511
This theorem is referenced by:  cnfcomlem  9740
  Copyright terms: Public domain W3C validator