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

Theorem ackbij1lem5 10145
Description: Lemma for ackbij2 10164. (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 7842 . . . . . . 7 (𝐴 ∈ ω → suc 𝐴 ∈ ω)
2 pw2eng 9023 . . . . . . 7 (suc 𝐴 ∈ ω → 𝒫 suc 𝐴 ≈ (2om suc 𝐴))
31, 2syl 17 . . . . . 6 (𝐴 ∈ ω → 𝒫 suc 𝐴 ≈ (2om suc 𝐴))
4 df-suc 6331 . . . . . . . . . 10 suc 𝐴 = (𝐴 ∪ {𝐴})
54oveq2i 7379 . . . . . . . . 9 (2om suc 𝐴) = (2om (𝐴 ∪ {𝐴}))
6 elex 3463 . . . . . . . . . . 11 (𝐴 ∈ ω → 𝐴 ∈ V)
7 snex 5385 . . . . . . . . . . . 12 {𝐴} ∈ V
87a1i 11 . . . . . . . . . . 11 (𝐴 ∈ ω → {𝐴} ∈ V)
9 2onn 8580 . . . . . . . . . . . . 13 2o ∈ ω
109elexi 3465 . . . . . . . . . . . 12 2o ∈ V
1110a1i 11 . . . . . . . . . . 11 (𝐴 ∈ ω → 2o ∈ V)
12 nnord 7826 . . . . . . . . . . . 12 (𝐴 ∈ ω → Ord 𝐴)
13 orddisj 6363 . . . . . . . . . . . 12 (Ord 𝐴 → (𝐴 ∩ {𝐴}) = ∅)
1412, 13syl 17 . . . . . . . . . . 11 (𝐴 ∈ ω → (𝐴 ∩ {𝐴}) = ∅)
15 mapunen 9086 . . . . . . . . . . 11 (((𝐴 ∈ V ∧ {𝐴} ∈ V ∧ 2o ∈ V) ∧ (𝐴 ∩ {𝐴}) = ∅) → (2om (𝐴 ∪ {𝐴})) ≈ ((2om 𝐴) × (2om {𝐴})))
166, 8, 11, 14, 15syl31anc 1376 . . . . . . . . . 10 (𝐴 ∈ ω → (2om (𝐴 ∪ {𝐴})) ≈ ((2om 𝐴) × (2om {𝐴})))
17 ovex 7401 . . . . . . . . . . . 12 (2om 𝐴) ∈ V
1817enref 8934 . . . . . . . . . . 11 (2om 𝐴) ≈ (2om 𝐴)
19 2on 8420 . . . . . . . . . . . . 13 2o ∈ On
2019a1i 11 . . . . . . . . . . . 12 (𝐴 ∈ ω → 2o ∈ On)
21 id 22 . . . . . . . . . . . 12 (𝐴 ∈ ω → 𝐴 ∈ ω)
2220, 21mapsnend 8985 . . . . . . . . . . 11 (𝐴 ∈ ω → (2om {𝐴}) ≈ 2o)
23 xpen 9080 . . . . . . . . . . 11 (((2om 𝐴) ≈ (2om 𝐴) ∧ (2om {𝐴}) ≈ 2o) → ((2om 𝐴) × (2om {𝐴})) ≈ ((2om 𝐴) × 2o))
2418, 22, 23sylancr 588 . . . . . . . . . 10 (𝐴 ∈ ω → ((2om 𝐴) × (2om {𝐴})) ≈ ((2om 𝐴) × 2o))
25 entr 8955 . . . . . . . . . 10 (((2om (𝐴 ∪ {𝐴})) ≈ ((2om 𝐴) × (2om {𝐴})) ∧ ((2om 𝐴) × (2om {𝐴})) ≈ ((2om 𝐴) × 2o)) → (2om (𝐴 ∪ {𝐴})) ≈ ((2om 𝐴) × 2o))
2616, 24, 25syl2anc 585 . . . . . . . . 9 (𝐴 ∈ ω → (2om (𝐴 ∪ {𝐴})) ≈ ((2om 𝐴) × 2o))
275, 26eqbrtrid 5135 . . . . . . . 8 (𝐴 ∈ ω → (2om suc 𝐴) ≈ ((2om 𝐴) × 2o))
2817, 10xpcomen 9008 . . . . . . . 8 ((2om 𝐴) × 2o) ≈ (2o × (2om 𝐴))
29 entr 8955 . . . . . . . 8 (((2om suc 𝐴) ≈ ((2om 𝐴) × 2o) ∧ ((2om 𝐴) × 2o) ≈ (2o × (2om 𝐴))) → (2om suc 𝐴) ≈ (2o × (2om 𝐴)))
3027, 28, 29sylancl 587 . . . . . . 7 (𝐴 ∈ ω → (2om suc 𝐴) ≈ (2o × (2om 𝐴)))
3110enref 8934 . . . . . . . . 9 2o ≈ 2o
32 pw2eng 9023 . . . . . . . . 9 (𝐴 ∈ ω → 𝒫 𝐴 ≈ (2om 𝐴))
33 xpen 9080 . . . . . . . . 9 ((2o ≈ 2o ∧ 𝒫 𝐴 ≈ (2om 𝐴)) → (2o × 𝒫 𝐴) ≈ (2o × (2om 𝐴)))
3431, 32, 33sylancr 588 . . . . . . . 8 (𝐴 ∈ ω → (2o × 𝒫 𝐴) ≈ (2o × (2om 𝐴)))
3534ensymd 8954 . . . . . . 7 (𝐴 ∈ ω → (2o × (2om 𝐴)) ≈ (2o × 𝒫 𝐴))
36 entr 8955 . . . . . . 7 (((2om suc 𝐴) ≈ (2o × (2om 𝐴)) ∧ (2o × (2om 𝐴)) ≈ (2o × 𝒫 𝐴)) → (2om suc 𝐴) ≈ (2o × 𝒫 𝐴))
3730, 35, 36syl2anc 585 . . . . . 6 (𝐴 ∈ ω → (2om suc 𝐴) ≈ (2o × 𝒫 𝐴))
38 entr 8955 . . . . . 6 ((𝒫 suc 𝐴 ≈ (2om suc 𝐴) ∧ (2om suc 𝐴) ≈ (2o × 𝒫 𝐴)) → 𝒫 suc 𝐴 ≈ (2o × 𝒫 𝐴))
393, 37, 38syl2anc 585 . . . . 5 (𝐴 ∈ ω → 𝒫 suc 𝐴 ≈ (2o × 𝒫 𝐴))
40 xp2dju 10099 . . . . 5 (2o × 𝒫 𝐴) = (𝒫 𝐴 ⊔ 𝒫 𝐴)
4139, 40breqtrdi 5141 . . . 4 (𝐴 ∈ ω → 𝒫 suc 𝐴 ≈ (𝒫 𝐴 ⊔ 𝒫 𝐴))
42 nnfi 9104 . . . . . . . 8 (𝐴 ∈ ω → 𝐴 ∈ Fin)
43 pwfi 9231 . . . . . . . 8 (𝐴 ∈ Fin ↔ 𝒫 𝐴 ∈ Fin)
4442, 43sylib 218 . . . . . . 7 (𝐴 ∈ ω → 𝒫 𝐴 ∈ Fin)
45 ficardid 9886 . . . . . . 7 (𝒫 𝐴 ∈ Fin → (card‘𝒫 𝐴) ≈ 𝒫 𝐴)
4644, 45syl 17 . . . . . 6 (𝐴 ∈ ω → (card‘𝒫 𝐴) ≈ 𝒫 𝐴)
47 djuen 10092 . . . . . 6 (((card‘𝒫 𝐴) ≈ 𝒫 𝐴 ∧ (card‘𝒫 𝐴) ≈ 𝒫 𝐴) → ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)) ≈ (𝒫 𝐴 ⊔ 𝒫 𝐴))
4846, 46, 47syl2anc 585 . . . . 5 (𝐴 ∈ ω → ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)) ≈ (𝒫 𝐴 ⊔ 𝒫 𝐴))
4948ensymd 8954 . . . 4 (𝐴 ∈ ω → (𝒫 𝐴 ⊔ 𝒫 𝐴) ≈ ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)))
50 entr 8955 . . . 4 ((𝒫 suc 𝐴 ≈ (𝒫 𝐴 ⊔ 𝒫 𝐴) ∧ (𝒫 𝐴 ⊔ 𝒫 𝐴) ≈ ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴))) → 𝒫 suc 𝐴 ≈ ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)))
5141, 49, 50syl2anc 585 . . 3 (𝐴 ∈ ω → 𝒫 suc 𝐴 ≈ ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)))
52 carden2b 9891 . . 3 (𝒫 suc 𝐴 ≈ ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)) → (card‘𝒫 suc 𝐴) = (card‘((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴))))
5351, 52syl 17 . 2 (𝐴 ∈ ω → (card‘𝒫 suc 𝐴) = (card‘((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴))))
54 ficardom 9885 . . . 4 (𝒫 𝐴 ∈ Fin → (card‘𝒫 𝐴) ∈ ω)
5544, 54syl 17 . . 3 (𝐴 ∈ ω → (card‘𝒫 𝐴) ∈ ω)
56 nnadju 10120 . . 3 (((card‘𝒫 𝐴) ∈ ω ∧ (card‘𝒫 𝐴) ∈ ω) → (card‘((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴))) = ((card‘𝒫 𝐴) +o (card‘𝒫 𝐴)))
5755, 55, 56syl2anc 585 . 2 (𝐴 ∈ ω → (card‘((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴))) = ((card‘𝒫 𝐴) +o (card‘𝒫 𝐴)))
5853, 57eqtrd 2772 1 (𝐴 ∈ ω → (card‘𝒫 suc 𝐴) = ((card‘𝒫 𝐴) +o (card‘𝒫 𝐴)))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2114  Vcvv 3442  cun 3901  cin 3902  c0 4287  𝒫 cpw 4556  {csn 4582   class class class wbr 5100   × cxp 5630  Ord word 6324  Oncon0 6325  suc csuc 6327  cfv 6500  (class class class)co 7368  ωcom 7818  2oc2o 8401   +o coa 8404  m cmap 8775  cen 8892  Fincfn 8895  cdju 9822  cardccrd 9859
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-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
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-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-1o 8407  df-2o 8408  df-oadd 8411  df-er 8645  df-map 8777  df-en 8896  df-dom 8897  df-sdom 8898  df-fin 8899  df-dju 9825  df-card 9863
This theorem is referenced by:  ackbij1lem14  10154
  Copyright terms: Public domain W3C validator