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

Theorem ackbij1lem5 10179
Description: Lemma for ackbij2 10198. (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 7870 . . . . . . 7 (𝐴 ∈ ω → suc 𝐴 ∈ ω)
2 pw2eng 9055 . . . . . . 7 (suc 𝐴 ∈ ω → 𝒫 suc 𝐴 ≈ (2om suc 𝐴))
31, 2syl 17 . . . . . 6 (𝐴 ∈ ω → 𝒫 suc 𝐴 ≈ (2om suc 𝐴))
4 df-suc 6352 . . . . . . . . . 10 suc 𝐴 = (𝐴 ∪ {𝐴})
54oveq2i 7407 . . . . . . . . 9 (2om suc 𝐴) = (2om (𝐴 ∪ {𝐴}))
6 elex 3475 . . . . . . . . . . 11 (𝐴 ∈ ω → 𝐴 ∈ V)
7 snex 5396 . . . . . . . . . . . 12 {𝐴} ∈ V
87a1i 11 . . . . . . . . . . 11 (𝐴 ∈ ω → {𝐴} ∈ V)
9 2onn 8612 . . . . . . . . . . . . 13 2o ∈ ω
109elexi 3476 . . . . . . . . . . . 12 2o ∈ V
1110a1i 11 . . . . . . . . . . 11 (𝐴 ∈ ω → 2o ∈ V)
12 nnord 7854 . . . . . . . . . . . 12 (𝐴 ∈ ω → Ord 𝐴)
13 orddisj 6384 . . . . . . . . . . . 12 (Ord 𝐴 → (𝐴 ∩ {𝐴}) = ∅)
1412, 13syl 17 . . . . . . . . . . 11 (𝐴 ∈ ω → (𝐴 ∩ {𝐴}) = ∅)
15 mapunen 9118 . . . . . . . . . . 11 (((𝐴 ∈ V ∧ {𝐴} ∈ V ∧ 2o ∈ V) ∧ (𝐴 ∩ {𝐴}) = ∅) → (2om (𝐴 ∪ {𝐴})) ≈ ((2om 𝐴) × (2om {𝐴})))
166, 8, 11, 14, 15syl31anc 1392 . . . . . . . . . 10 (𝐴 ∈ ω → (2om (𝐴 ∪ {𝐴})) ≈ ((2om 𝐴) × (2om {𝐴})))
17 ovex 7429 . . . . . . . . . . . 12 (2om 𝐴) ∈ V
1817enref 8966 . . . . . . . . . . 11 (2om 𝐴) ≈ (2om 𝐴)
19 2on 8451 . . . . . . . . . . . . 13 2o ∈ On
2019a1i 11 . . . . . . . . . . . 12 (𝐴 ∈ ω → 2o ∈ On)
21 id 22 . . . . . . . . . . . 12 (𝐴 ∈ ω → 𝐴 ∈ ω)
2220, 21mapsnend 9017 . . . . . . . . . . 11 (𝐴 ∈ ω → (2om {𝐴}) ≈ 2o)
23 xpen 9112 . . . . . . . . . . 11 (((2om 𝐴) ≈ (2om 𝐴) ∧ (2om {𝐴}) ≈ 2o) → ((2om 𝐴) × (2om {𝐴})) ≈ ((2om 𝐴) × 2o))
2418, 22, 23sylancr 596 . . . . . . . . . 10 (𝐴 ∈ ω → ((2om 𝐴) × (2om {𝐴})) ≈ ((2om 𝐴) × 2o))
25 entr 8987 . . . . . . . . . 10 (((2om (𝐴 ∪ {𝐴})) ≈ ((2om 𝐴) × (2om {𝐴})) ∧ ((2om 𝐴) × (2om {𝐴})) ≈ ((2om 𝐴) × 2o)) → (2om (𝐴 ∪ {𝐴})) ≈ ((2om 𝐴) × 2o))
2616, 24, 25syl2anc 593 . . . . . . . . 9 (𝐴 ∈ ω → (2om (𝐴 ∪ {𝐴})) ≈ ((2om 𝐴) × 2o))
275, 26eqbrtrid 5135 . . . . . . . 8 (𝐴 ∈ ω → (2om suc 𝐴) ≈ ((2om 𝐴) × 2o))
2817, 10xpcomen 9040 . . . . . . . 8 ((2om 𝐴) × 2o) ≈ (2o × (2om 𝐴))
29 entr 8987 . . . . . . . 8 (((2om suc 𝐴) ≈ ((2om 𝐴) × 2o) ∧ ((2om 𝐴) × 2o) ≈ (2o × (2om 𝐴))) → (2om suc 𝐴) ≈ (2o × (2om 𝐴)))
3027, 28, 29sylancl 595 . . . . . . 7 (𝐴 ∈ ω → (2om suc 𝐴) ≈ (2o × (2om 𝐴)))
3110enref 8966 . . . . . . . . 9 2o ≈ 2o
32 pw2eng 9055 . . . . . . . . 9 (𝐴 ∈ ω → 𝒫 𝐴 ≈ (2om 𝐴))
33 xpen 9112 . . . . . . . . 9 ((2o ≈ 2o ∧ 𝒫 𝐴 ≈ (2om 𝐴)) → (2o × 𝒫 𝐴) ≈ (2o × (2om 𝐴)))
3431, 32, 33sylancr 596 . . . . . . . 8 (𝐴 ∈ ω → (2o × 𝒫 𝐴) ≈ (2o × (2om 𝐴)))
3534ensymd 8986 . . . . . . 7 (𝐴 ∈ ω → (2o × (2om 𝐴)) ≈ (2o × 𝒫 𝐴))
36 entr 8987 . . . . . . 7 (((2om suc 𝐴) ≈ (2o × (2om 𝐴)) ∧ (2o × (2om 𝐴)) ≈ (2o × 𝒫 𝐴)) → (2om suc 𝐴) ≈ (2o × 𝒫 𝐴))
3730, 35, 36syl2anc 593 . . . . . 6 (𝐴 ∈ ω → (2om suc 𝐴) ≈ (2o × 𝒫 𝐴))
38 entr 8987 . . . . . 6 ((𝒫 suc 𝐴 ≈ (2om suc 𝐴) ∧ (2om suc 𝐴) ≈ (2o × 𝒫 𝐴)) → 𝒫 suc 𝐴 ≈ (2o × 𝒫 𝐴))
393, 37, 38syl2anc 593 . . . . 5 (𝐴 ∈ ω → 𝒫 suc 𝐴 ≈ (2o × 𝒫 𝐴))
40 xp2dju 10133 . . . . 5 (2o × 𝒫 𝐴) = (𝒫 𝐴 ⊔ 𝒫 𝐴)
4139, 40breqtrdi 5141 . . . 4 (𝐴 ∈ ω → 𝒫 suc 𝐴 ≈ (𝒫 𝐴 ⊔ 𝒫 𝐴))
42 nnfi 9136 . . . . . . . 8 (𝐴 ∈ ω → 𝐴 ∈ Fin)
43 pwfi 9263 . . . . . . . 8 (𝐴 ∈ Fin ↔ 𝒫 𝐴 ∈ Fin)
4442, 43sylib 220 . . . . . . 7 (𝐴 ∈ ω → 𝒫 𝐴 ∈ Fin)
45 ficardid 9920 . . . . . . 7 (𝒫 𝐴 ∈ Fin → (card‘𝒫 𝐴) ≈ 𝒫 𝐴)
4644, 45syl 17 . . . . . 6 (𝐴 ∈ ω → (card‘𝒫 𝐴) ≈ 𝒫 𝐴)
47 djuen 10126 . . . . . 6 (((card‘𝒫 𝐴) ≈ 𝒫 𝐴 ∧ (card‘𝒫 𝐴) ≈ 𝒫 𝐴) → ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)) ≈ (𝒫 𝐴 ⊔ 𝒫 𝐴))
4846, 46, 47syl2anc 593 . . . . 5 (𝐴 ∈ ω → ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)) ≈ (𝒫 𝐴 ⊔ 𝒫 𝐴))
4948ensymd 8986 . . . 4 (𝐴 ∈ ω → (𝒫 𝐴 ⊔ 𝒫 𝐴) ≈ ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)))
50 entr 8987 . . . 4 ((𝒫 suc 𝐴 ≈ (𝒫 𝐴 ⊔ 𝒫 𝐴) ∧ (𝒫 𝐴 ⊔ 𝒫 𝐴) ≈ ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴))) → 𝒫 suc 𝐴 ≈ ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)))
5141, 49, 50syl2anc 593 . . 3 (𝐴 ∈ ω → 𝒫 suc 𝐴 ≈ ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)))
52 carden2b 9925 . . 3 (𝒫 suc 𝐴 ≈ ((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴)) → (card‘𝒫 suc 𝐴) = (card‘((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴))))
5351, 52syl 17 . 2 (𝐴 ∈ ω → (card‘𝒫 suc 𝐴) = (card‘((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴))))
54 ficardom 9919 . . . 4 (𝒫 𝐴 ∈ Fin → (card‘𝒫 𝐴) ∈ ω)
5544, 54syl 17 . . 3 (𝐴 ∈ ω → (card‘𝒫 𝐴) ∈ ω)
56 nnadju 10154 . . 3 (((card‘𝒫 𝐴) ∈ ω ∧ (card‘𝒫 𝐴) ∈ ω) → (card‘((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴))) = ((card‘𝒫 𝐴) +o (card‘𝒫 𝐴)))
5755, 55, 56syl2anc 593 . 2 (𝐴 ∈ ω → (card‘((card‘𝒫 𝐴) ⊔ (card‘𝒫 𝐴))) = ((card‘𝒫 𝐴) +o (card‘𝒫 𝐴)))
5853, 57eqtrd 2797 1 (𝐴 ∈ ω → (card‘𝒫 suc 𝐴) = ((card‘𝒫 𝐴) +o (card‘𝒫 𝐴)))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1560  wcel 2142  Vcvv 3454  cun 3902  cin 3903  c0 4285  𝒫 cpw 4555  {csn 4582   class class class wbr 5100   × cxp 5645  Ord word 6345  Oncon0 6346  suc csuc 6348  cfv 6521  (class class class)co 7396  ωcom 7846  2oc2o 8431   +o coa 8434  m cmap 8808  cen 8924  Fincfn 8927  cdju 9856  cardccrd 9893
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4906  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6288  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-ov 7399  df-oprab 7400  df-mpo 7401  df-om 7847  df-1st 7970  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8381  df-1o 8437  df-2o 8438  df-oadd 8441  df-er 8678  df-map 8810  df-en 8928  df-dom 8929  df-sdom 8930  df-fin 8931  df-dju 9859  df-card 9897
This theorem is referenced by:  ackbij1lem14  10188
  Copyright terms: Public domain W3C validator