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

Theorem ackbij1lem5 10124
Description: Lemma for ackbij2 10143. (Contributed by Stefan O'Rear, 19-Nov-2014.) (Proof shortened by AV, 18-Jul-2022.)
Assertion
Ref Expression
ackbij1lem5 (𝐴 ∈ ω → (card‘𝒫 suc 𝐴) = ((card‘𝒫 𝐴) +o (card‘𝒫 𝐴)))

Proof of Theorem ackbij1lem5
StepHypRef Expression
1 peano2 7829 . . . . . . 7 (𝐴 ∈ ω → suc 𝐴 ∈ ω)
2 pw2eng 9006 . . . . . . 7 (suc 𝐴 ∈ ω → 𝒫 suc 𝐴 ≈ (2om suc 𝐴))
31, 2syl 17 . . . . . 6 (𝐴 ∈ ω → 𝒫 suc 𝐴 ≈ (2om suc 𝐴))
4 df-suc 6320 . . . . . . . . . 10 suc 𝐴 = (𝐴 ∪ {𝐴})
54oveq2i 7366 . . . . . . . . 9 (2om suc 𝐴) = (2om (𝐴 ∪ {𝐴}))
6 elex 3459 . . . . . . . . . . 11 (𝐴 ∈ ω → 𝐴 ∈ V)
7 snex 5378 . . . . . . . . . . . 12 {𝐴} ∈ V
87a1i 11 . . . . . . . . . . 11 (𝐴 ∈ ω → {𝐴} ∈ V)
9 2onn 8566 . . . . . . . . . . . . 13 2o ∈ ω
109elexi 3461 . . . . . . . . . . . 12 2o ∈ V
1110a1i 11 . . . . . . . . . . 11 (𝐴 ∈ ω → 2o ∈ V)
12 nnord 7813 . . . . . . . . . . . 12 (𝐴 ∈ ω → Ord 𝐴)
13 orddisj 6352 . . . . . . . . . . . 12 (Ord 𝐴 → (𝐴 ∩ {𝐴}) = ∅)
1412, 13syl 17 . . . . . . . . . . 11 (𝐴 ∈ ω → (𝐴 ∩ {𝐴}) = ∅)
15 mapunen 9069 . . . . . . . . . . 11 (((𝐴 ∈ V ∧ {𝐴} ∈ V ∧ 2o ∈ V) ∧ (𝐴 ∩ {𝐴}) = ∅) → (2om (𝐴 ∪ {𝐴})) ≈ ((2om 𝐴) × (2om {𝐴})))
166, 8, 11, 14, 15syl31anc 1375 . . . . . . . . . 10 (𝐴 ∈ ω → (2om (𝐴 ∪ {𝐴})) ≈ ((2om 𝐴) × (2om {𝐴})))
17 ovex 7388 . . . . . . . . . . . 12 (2om 𝐴) ∈ V
1817enref 8917 . . . . . . . . . . 11 (2om 𝐴) ≈ (2om 𝐴)
19 2on 8407 . . . . . . . . . . . . 13 2o ∈ On
2019a1i 11 . . . . . . . . . . . 12 (𝐴 ∈ ω → 2o ∈ On)
21 id 22 . . . . . . . . . . . 12 (𝐴 ∈ ω → 𝐴 ∈ ω)
2220, 21mapsnend 8968 . . . . . . . . . . 11 (𝐴 ∈ ω → (2om {𝐴}) ≈ 2o)
23 xpen 9063 . . . . . . . . . . 11 (((2om 𝐴) ≈ (2om 𝐴) ∧ (2om {𝐴}) ≈ 2o) → ((2om 𝐴) × (2om {𝐴})) ≈ ((2om 𝐴) × 2o))
2418, 22, 23sylancr 587 . . . . . . . . . 10 (𝐴 ∈ ω → ((2om 𝐴) × (2om {𝐴})) ≈ ((2om 𝐴) × 2o))
25 entr 8938 . . . . . . . . . 10 (((2om (𝐴 ∪ {𝐴})) ≈ ((2om 𝐴) × (2om {𝐴})) ∧ ((2om 𝐴) × (2om {𝐴})) ≈ ((2om 𝐴) × 2o)) → (2om (𝐴 ∪ {𝐴})) ≈ ((2om 𝐴) × 2o))
2616, 24, 25syl2anc 584 . . . . . . . . 9 (𝐴 ∈ ω → (2om (𝐴 ∪ {𝐴})) ≈ ((2om 𝐴) × 2o))
275, 26eqbrtrid 5130 . . . . . . . 8 (𝐴 ∈ ω → (2om suc 𝐴) ≈ ((2om 𝐴) × 2o))
2817, 10xpcomen 8991 . . . . . . . 8 ((2om 𝐴) × 2o) ≈ (2o × (2om 𝐴))
29 entr 8938 . . . . . . . 8 (((2om suc 𝐴) ≈ ((2om 𝐴) × 2o) ∧ ((2om 𝐴) × 2o) ≈ (2o × (2om 𝐴))) → (2om suc 𝐴) ≈ (2o × (2om 𝐴)))
3027, 28, 29sylancl 586 . . . . . . 7 (𝐴 ∈ ω → (2om suc 𝐴) ≈ (2o × (2om 𝐴)))
3110enref 8917 . . . . . . . . 9 2o ≈ 2o
32 pw2eng 9006 . . . . . . . . 9 (𝐴 ∈ ω → 𝒫 𝐴 ≈ (2om 𝐴))
33 xpen 9063 . . . . . . . . 9 ((2o ≈ 2o ∧ 𝒫 𝐴 ≈ (2om 𝐴)) → (2o × 𝒫 𝐴) ≈ (2o × (2om 𝐴)))
3431, 32, 33sylancr 587 . . . . . . . 8 (𝐴 ∈ ω → (2o × 𝒫 𝐴) ≈ (2o × (2om 𝐴)))
3534ensymd 8937 . . . . . . 7 (𝐴 ∈ ω → (2o × (2om 𝐴)) ≈ (2o × 𝒫 𝐴))
36 entr 8938 . . . . . . 7 (((2om suc 𝐴) ≈ (2o × (2om 𝐴)) ∧ (2o × (2om 𝐴)) ≈ (2o × 𝒫 𝐴)) → (2om suc 𝐴) ≈ (2o × 𝒫 𝐴))
3730, 35, 36syl2anc 584 . . . . . 6 (𝐴 ∈ ω → (2om suc 𝐴) ≈ (2o × 𝒫 𝐴))
38 entr 8938 . . . . . 6 ((𝒫 suc 𝐴 ≈ (2om suc 𝐴) ∧ (2om suc 𝐴) ≈ (2o × 𝒫 𝐴)) → 𝒫 suc 𝐴 ≈ (2o × 𝒫 𝐴))
393, 37, 38syl2anc 584 . . . . 5 (𝐴 ∈ ω → 𝒫 suc 𝐴 ≈ (2o × 𝒫 𝐴))
40 xp2dju 10078 . . . . 5 (2o × 𝒫 𝐴) = (𝒫 𝐴 ⊔ 𝒫 𝐴)
4139, 40breqtrdi 5136 . . . 4 (𝐴 ∈ ω → 𝒫 suc 𝐴 ≈ (𝒫 𝐴 ⊔ 𝒫 𝐴))
42 nnfi 9087 . . . . . . . 8 (𝐴 ∈ ω → 𝐴 ∈ Fin)
43 pwfi 9213 . . . . . . . 8 (𝐴 ∈ Fin ↔ 𝒫 𝐴 ∈ Fin)
4442, 43sylib 218 . . . . . . 7 (𝐴 ∈ ω → 𝒫 𝐴 ∈ Fin)
45 ficardid 9865 . . . . . . 7 (𝒫 𝐴 ∈ Fin → (card‘𝒫 𝐴) ≈ 𝒫 𝐴)
4644, 45syl 17 . . . . . 6 (𝐴 ∈ ω → (card‘𝒫 𝐴) ≈ 𝒫 𝐴)
47 djuen 10071 . . . . . 6 (((card‘𝒫 𝐴) ≈ 𝒫 𝐴 ∧ (card‘𝒫 𝐴) ≈ 𝒫 𝐴) → ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)) ≈ (𝒫 𝐴 ⊔ 𝒫 𝐴))
4846, 46, 47syl2anc 584 . . . . 5 (𝐴 ∈ ω → ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)) ≈ (𝒫 𝐴 ⊔ 𝒫 𝐴))
4948ensymd 8937 . . . 4 (𝐴 ∈ ω → (𝒫 𝐴 ⊔ 𝒫 𝐴) ≈ ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)))
50 entr 8938 . . . 4 ((𝒫 suc 𝐴 ≈ (𝒫 𝐴 ⊔ 𝒫 𝐴) ∧ (𝒫 𝐴 ⊔ 𝒫 𝐴) ≈ ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴))) → 𝒫 suc 𝐴 ≈ ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)))
5141, 49, 50syl2anc 584 . . 3 (𝐴 ∈ ω → 𝒫 suc 𝐴 ≈ ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)))
52 carden2b 9870 . . 3 (𝒫 suc 𝐴 ≈ ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)) → (card‘𝒫 suc 𝐴) = (card‘((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴))))
5351, 52syl 17 . 2 (𝐴 ∈ ω → (card‘𝒫 suc 𝐴) = (card‘((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴))))
54 ficardom 9864 . . . 4 (𝒫 𝐴 ∈ Fin → (card‘𝒫 𝐴) ∈ ω)
5544, 54syl 17 . . 3 (𝐴 ∈ ω → (card‘𝒫 𝐴) ∈ ω)
56 nnadju 10099 . . 3 (((card‘𝒫 𝐴) ∈ ω ∧ (card‘𝒫 𝐴) ∈ ω) → (card‘((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴))) = ((card‘𝒫 𝐴) +o (card‘𝒫 𝐴)))
5755, 55, 56syl2anc 584 . 2 (𝐴 ∈ ω → (card‘((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴))) = ((card‘𝒫 𝐴) +o (card‘𝒫 𝐴)))
5853, 57eqtrd 2768 1 (𝐴 ∈ ω → (card‘𝒫 suc 𝐴) = ((card‘𝒫 𝐴) +o (card‘𝒫 𝐴)))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wcel 2113  Vcvv 3438  cun 3897  cin 3898  c0 4284  𝒫 cpw 4551  {csn 4577   class class class wbr 5095   × cxp 5619  Ord word 6313  Oncon0 6314  suc csuc 6316  cfv 6489  (class class class)co 7355  ωcom 7805  2oc2o 8388   +o coa 8391  m cmap 8759  cen 8875  Fincfn 8878  cdju 9801  cardccrd 9838
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-sep 5238  ax-nul 5248  ax-pow 5307  ax-pr 5374  ax-un 7677
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 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-reu 3349  df-rab 3398  df-v 3440  df-sbc 3739  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4285  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 6256  df-ord 6317  df-on 6318  df-lim 6319  df-suc 6320  df-iota 6445  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496  df-fv 6497  df-ov 7358  df-oprab 7359  df-mpo 7360  df-om 7806  df-1st 7930  df-2nd 7931  df-frecs 8220  df-wrecs 8251  df-recs 8300  df-rdg 8338  df-1o 8394  df-2o 8395  df-oadd 8398  df-er 8631  df-map 8761  df-en 8879  df-dom 8880  df-sdom 8881  df-fin 8882  df-dju 9804  df-card 9842
This theorem is referenced by:  ackbij1lem14  10133
  Copyright terms: Public domain W3C validator