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

Theorem ackbij1lem5 10229
Description: Lemma for ackbij2 10248. (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 7890 . . . . . . 7 (𝐴 ∈ ω → suc 𝐴 ∈ ω)
2 pw2eng 9085 . . . . . . 7 (suc 𝐴 ∈ ω → 𝒫 suc 𝐴 ≈ (2om suc 𝐴))
31, 2syl 18 . . . . . 6 (𝐴 ∈ ω → 𝒫 suc 𝐴 ≈ (2om suc 𝐴))
4 df-suc 6367 . . . . . . . . . 10 suc 𝐴 = (𝐴 ∪ {𝐴})
54oveq2i 7428 . . . . . . . . 9 (2om suc 𝐴) = (2om (𝐴 ∪ {𝐴}))
6 elex 3474 . . . . . . . . . . 11 (𝐴 ∈ ω → 𝐴 ∈ V)
7 snex 5408 . . . . . . . . . . . 12 {𝐴} ∈ V
87a1i 11 . . . . . . . . . . 11 (𝐴 ∈ ω → {𝐴} ∈ V)
9 2onn 8634 . . . . . . . . . . . . 13 2o ∈ ω
109elexi 3475 . . . . . . . . . . . 12 2o ∈ V
1110a1i 11 . . . . . . . . . . 11 (𝐴 ∈ ω → 2o ∈ V)
12 nnord 7874 . . . . . . . . . . . 12 (𝐴 ∈ ω → Ord 𝐴)
13 orddisj 6400 . . . . . . . . . . . 12 (Ord 𝐴 → (𝐴 ∩ {𝐴}) = ∅)
1412, 13syl 18 . . . . . . . . . . 11 (𝐴 ∈ ω → (𝐴 ∩ {𝐴}) = ∅)
15 mapunen 9148 . . . . . . . . . . 11 (((𝐴 ∈ V ∧ {𝐴} ∈ V ∧ 2o ∈ V) ∧ (𝐴 ∩ {𝐴}) = ∅) → (2om (𝐴 ∪ {𝐴})) ≈ ((2om 𝐴) × (2om {𝐴})))
166, 8, 11, 14, 15syl31anc 1400 . . . . . . . . . 10 (𝐴 ∈ ω → (2om (𝐴 ∪ {𝐴})) ≈ ((2om 𝐴) × (2om {𝐴})))
17 ovex 7450 . . . . . . . . . . . 12 (2om 𝐴) ∈ V
1817enref 8995 . . . . . . . . . . 11 (2om 𝐴) ≈ (2om 𝐴)
19 2on 8473 . . . . . . . . . . . . 13 2o ∈ On
2019a1i 11 . . . . . . . . . . . 12 (𝐴 ∈ ω → 2o ∈ On)
21 id 23 . . . . . . . . . . . 12 (𝐴 ∈ ω → 𝐴 ∈ ω)
2220, 21mapsnend 9047 . . . . . . . . . . 11 (𝐴 ∈ ω → (2om {𝐴}) ≈ 2o)
23 xpen 9142 . . . . . . . . . . 11 (((2om 𝐴) ≈ (2om 𝐴) ∧ (2om {𝐴}) ≈ 2o) → ((2om 𝐴) × (2om {𝐴})) ≈ ((2om 𝐴) × 2o))
2418, 22, 23sylancr 599 . . . . . . . . . 10 (𝐴 ∈ ω → ((2om 𝐴) × (2om {𝐴})) ≈ ((2om 𝐴) × 2o))
25 entr 9016 . . . . . . . . . 10 (((2om (𝐴 ∪ {𝐴})) ≈ ((2om 𝐴) × (2om {𝐴})) ∧ ((2om 𝐴) × (2om {𝐴})) ≈ ((2om 𝐴) × 2o)) → (2om (𝐴 ∪ {𝐴})) ≈ ((2om 𝐴) × 2o))
2616, 24, 25syl2anc 596 . . . . . . . . 9 (𝐴 ∈ ω → (2om (𝐴 ∪ {𝐴})) ≈ ((2om 𝐴) × 2o))
275, 26eqbrtrid 5144 . . . . . . . 8 (𝐴 ∈ ω → (2om suc 𝐴) ≈ ((2om 𝐴) × 2o))
2817, 10xpcomen 9070 . . . . . . . 8 ((2om 𝐴) × 2o) ≈ (2o × (2om 𝐴))
29 entr 9016 . . . . . . . 8 (((2om suc 𝐴) ≈ ((2om 𝐴) × 2o) ∧ ((2om 𝐴) × 2o) ≈ (2o × (2om 𝐴))) → (2om suc 𝐴) ≈ (2o × (2om 𝐴)))
3027, 28, 29sylancl 598 . . . . . . 7 (𝐴 ∈ ω → (2om suc 𝐴) ≈ (2o × (2om 𝐴)))
3110enref 8995 . . . . . . . . 9 2o ≈ 2o
32 pw2eng 9085 . . . . . . . . 9 (𝐴 ∈ ω → 𝒫 𝐴 ≈ (2om 𝐴))
33 xpen 9142 . . . . . . . . 9 ((2o ≈ 2o ∧ 𝒫 𝐴 ≈ (2om 𝐴)) → (2o × 𝒫 𝐴) ≈ (2o × (2om 𝐴)))
3431, 32, 33sylancr 599 . . . . . . . 8 (𝐴 ∈ ω → (2o × 𝒫 𝐴) ≈ (2o × (2om 𝐴)))
3534ensymd 9015 . . . . . . 7 (𝐴 ∈ ω → (2o × (2om 𝐴)) ≈ (2o × 𝒫 𝐴))
36 entr 9016 . . . . . . 7 (((2om suc 𝐴) ≈ (2o × (2om 𝐴)) ∧ (2o × (2om 𝐴)) ≈ (2o × 𝒫 𝐴)) → (2om suc 𝐴) ≈ (2o × 𝒫 𝐴))
3730, 35, 36syl2anc 596 . . . . . 6 (𝐴 ∈ ω → (2om suc 𝐴) ≈ (2o × 𝒫 𝐴))
38 entr 9016 . . . . . 6 ((𝒫 suc 𝐴 ≈ (2om suc 𝐴) ∧ (2om suc 𝐴) ≈ (2o × 𝒫 𝐴)) → 𝒫 suc 𝐴 ≈ (2o × 𝒫 𝐴))
393, 37, 38syl2anc 596 . . . . 5 (𝐴 ∈ ω → 𝒫 suc 𝐴 ≈ (2o × 𝒫 𝐴))
40 xp2dju 10183 . . . . 5 (2o × 𝒫 𝐴) = (𝒫 𝐴 ⊔ 𝒫 𝐴)
4139, 40breqtrdi 5150 . . . 4 (𝐴 ∈ ω → 𝒫 suc 𝐴 ≈ (𝒫 𝐴 ⊔ 𝒫 𝐴))
42 nnfi 9166 . . . . . . . 8 (𝐴 ∈ ω → 𝐴 ∈ Fin)
43 pwfi 9292 . . . . . . . 8 (𝐴 ∈ Fin ↔ 𝒫 𝐴 ∈ Fin)
4442, 43sylib 221 . . . . . . 7 (𝐴 ∈ ω → 𝒫 𝐴 ∈ Fin)
45 ficardid 9971 . . . . . . 7 (𝒫 𝐴 ∈ Fin → (card‘𝒫 𝐴) ≈ 𝒫 𝐴)
4644, 45syl 18 . . . . . 6 (𝐴 ∈ ω → (card‘𝒫 𝐴) ≈ 𝒫 𝐴)
47 djuen 10176 . . . . . 6 (((card‘𝒫 𝐴) ≈ 𝒫 𝐴 ∧ (card‘𝒫 𝐴) ≈ 𝒫 𝐴) → ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)) ≈ (𝒫 𝐴 ⊔ 𝒫 𝐴))
4846, 46, 47syl2anc 596 . . . . 5 (𝐴 ∈ ω → ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)) ≈ (𝒫 𝐴 ⊔ 𝒫 𝐴))
4948ensymd 9015 . . . 4 (𝐴 ∈ ω → (𝒫 𝐴 ⊔ 𝒫 𝐴) ≈ ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)))
50 entr 9016 . . . 4 ((𝒫 suc 𝐴 ≈ (𝒫 𝐴 ⊔ 𝒫 𝐴) ∧ (𝒫 𝐴 ⊔ 𝒫 𝐴) ≈ ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴))) → 𝒫 suc 𝐴 ≈ ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)))
5141, 49, 50syl2anc 596 . . 3 (𝐴 ∈ ω → 𝒫 suc 𝐴 ≈ ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)))
52 carden2b 9976 . . 3 (𝒫 suc 𝐴 ≈ ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)) → (card‘𝒫 suc 𝐴) = (card‘((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴))))
5351, 52syl 18 . 2 (𝐴 ∈ ω → (card‘𝒫 suc 𝐴) = (card‘((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴))))
54 ficardom 9970 . . . 4 (𝒫 𝐴 ∈ Fin → (card‘𝒫 𝐴) ∈ ω)
5544, 54syl 18 . . 3 (𝐴 ∈ ω → (card‘𝒫 𝐴) ∈ ω)
56 nnadju 10204 . . 3 (((card‘𝒫 𝐴) ∈ ω ∧ (card‘𝒫 𝐴) ∈ ω) → (card‘((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴))) = ((card‘𝒫 𝐴) +o (card‘𝒫 𝐴)))
5755, 55, 56syl2anc 596 . 2 (𝐴 ∈ ω → (card‘((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴))) = ((card‘𝒫 𝐴) +o (card‘𝒫 𝐴)))
5853, 57eqtrd 2797 1 (𝐴 ∈ ω → (card‘𝒫 suc 𝐴) = ((card‘𝒫 𝐴) +o (card‘𝒫 𝐴)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wcel 2145  Vcvv 3453  cun 3900  cin 3901  c0 4282  𝒫 cpw 4560  {csn 4587   class class class wbr 5107   × cxp 5657  Ord word 6360  Oncon0 6361  suc csuc 6363  cfv 6537  (class class class)co 7417  ωcom 7866  2oc2o 8453   +o coa 8456  m cmap 8830  cen 8953  Fincfn 8956  cdju 9907  cardccrd 9944
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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740
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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-2o 8460  df-oadd 8463  df-er 8700  df-map 8832  df-en 8957  df-dom 8958  df-sdom 8959  df-fin 8960  df-dju 9910  df-card 9948
This theorem is used by:  ackbij1lem14  10238
  Copyright terms: Public domain W3C validator