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

Theorem ackbij1b 9012
 Description: The Ackermann bijection, part 1b: the bijection from ackbij1 9011 restricts naturally to the powers of particular naturals. (Contributed by Stefan O'Rear, 18-Nov-2014.)
Hypothesis
Ref Expression
ackbij.f 𝐹 = (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘ 𝑦𝑥 ({𝑦} × 𝒫 𝑦)))
Assertion
Ref Expression
ackbij1b (𝐴 ∈ ω → (𝐹 “ 𝒫 𝐴) = (card‘𝒫 𝐴))
Distinct variable groups:   𝑥,𝐹,𝑦   𝑥,𝐴,𝑦

Proof of Theorem ackbij1b
Dummy variable 𝑎 is distinct from all other variables.
StepHypRef Expression
1 ackbij2lem1 8992 . . . . 5 (𝐴 ∈ ω → 𝒫 𝐴 ⊆ (𝒫 ω ∩ Fin))
2 pwexg 4815 . . . . 5 (𝐴 ∈ ω → 𝒫 𝐴 ∈ V)
3 ackbij.f . . . . . . 7 𝐹 = (𝑥 ∈ (𝒫 ω ∩ Fin) ↦ (card‘ 𝑦𝑥 ({𝑦} × 𝒫 𝑦)))
43ackbij1lem17 9009 . . . . . 6 𝐹:(𝒫 ω ∩ Fin)–1-1→ω
5 f1imaeng 7967 . . . . . 6 ((𝐹:(𝒫 ω ∩ Fin)–1-1→ω ∧ 𝒫 𝐴 ⊆ (𝒫 ω ∩ Fin) ∧ 𝒫 𝐴 ∈ V) → (𝐹 “ 𝒫 𝐴) ≈ 𝒫 𝐴)
64, 5mp3an1 1408 . . . . 5 ((𝒫 𝐴 ⊆ (𝒫 ω ∩ Fin) ∧ 𝒫 𝐴 ∈ V) → (𝐹 “ 𝒫 𝐴) ≈ 𝒫 𝐴)
71, 2, 6syl2anc 692 . . . 4 (𝐴 ∈ ω → (𝐹 “ 𝒫 𝐴) ≈ 𝒫 𝐴)
8 nnfi 8104 . . . . . 6 (𝐴 ∈ ω → 𝐴 ∈ Fin)
9 pwfi 8212 . . . . . 6 (𝐴 ∈ Fin ↔ 𝒫 𝐴 ∈ Fin)
108, 9sylib 208 . . . . 5 (𝐴 ∈ ω → 𝒫 𝐴 ∈ Fin)
11 ficardid 8739 . . . . 5 (𝒫 𝐴 ∈ Fin → (card‘𝒫 𝐴) ≈ 𝒫 𝐴)
12 ensym 7956 . . . . 5 ((card‘𝒫 𝐴) ≈ 𝒫 𝐴 → 𝒫 𝐴 ≈ (card‘𝒫 𝐴))
1310, 11, 123syl 18 . . . 4 (𝐴 ∈ ω → 𝒫 𝐴 ≈ (card‘𝒫 𝐴))
14 entr 7959 . . . 4 (((𝐹 “ 𝒫 𝐴) ≈ 𝒫 𝐴 ∧ 𝒫 𝐴 ≈ (card‘𝒫 𝐴)) → (𝐹 “ 𝒫 𝐴) ≈ (card‘𝒫 𝐴))
157, 13, 14syl2anc 692 . . 3 (𝐴 ∈ ω → (𝐹 “ 𝒫 𝐴) ≈ (card‘𝒫 𝐴))
16 onfin2 8103 . . . . . . 7 ω = (On ∩ Fin)
17 inss2 3817 . . . . . . 7 (On ∩ Fin) ⊆ Fin
1816, 17eqsstri 3619 . . . . . 6 ω ⊆ Fin
19 ficardom 8738 . . . . . . 7 (𝒫 𝐴 ∈ Fin → (card‘𝒫 𝐴) ∈ ω)
2010, 19syl 17 . . . . . 6 (𝐴 ∈ ω → (card‘𝒫 𝐴) ∈ ω)
2118, 20sseldi 3585 . . . . 5 (𝐴 ∈ ω → (card‘𝒫 𝐴) ∈ Fin)
22 php3 8097 . . . . . 6 (((card‘𝒫 𝐴) ∈ Fin ∧ (𝐹 “ 𝒫 𝐴) ⊊ (card‘𝒫 𝐴)) → (𝐹 “ 𝒫 𝐴) ≺ (card‘𝒫 𝐴))
2322ex 450 . . . . 5 ((card‘𝒫 𝐴) ∈ Fin → ((𝐹 “ 𝒫 𝐴) ⊊ (card‘𝒫 𝐴) → (𝐹 “ 𝒫 𝐴) ≺ (card‘𝒫 𝐴)))
2421, 23syl 17 . . . 4 (𝐴 ∈ ω → ((𝐹 “ 𝒫 𝐴) ⊊ (card‘𝒫 𝐴) → (𝐹 “ 𝒫 𝐴) ≺ (card‘𝒫 𝐴)))
25 sdomnen 7935 . . . 4 ((𝐹 “ 𝒫 𝐴) ≺ (card‘𝒫 𝐴) → ¬ (𝐹 “ 𝒫 𝐴) ≈ (card‘𝒫 𝐴))
2624, 25syl6 35 . . 3 (𝐴 ∈ ω → ((𝐹 “ 𝒫 𝐴) ⊊ (card‘𝒫 𝐴) → ¬ (𝐹 “ 𝒫 𝐴) ≈ (card‘𝒫 𝐴)))
2715, 26mt2d 131 . 2 (𝐴 ∈ ω → ¬ (𝐹 “ 𝒫 𝐴) ⊊ (card‘𝒫 𝐴))
28 fvex 6163 . . . . . 6 (𝐹𝑎) ∈ V
29 ackbij1lem3 8995 . . . . . . . . 9 (𝐴 ∈ ω → 𝐴 ∈ (𝒫 ω ∩ Fin))
30 elpwi 4145 . . . . . . . . 9 (𝑎 ∈ 𝒫 𝐴𝑎𝐴)
313ackbij1lem12 9004 . . . . . . . . 9 ((𝐴 ∈ (𝒫 ω ∩ Fin) ∧ 𝑎𝐴) → (𝐹𝑎) ⊆ (𝐹𝐴))
3229, 30, 31syl2an 494 . . . . . . . 8 ((𝐴 ∈ ω ∧ 𝑎 ∈ 𝒫 𝐴) → (𝐹𝑎) ⊆ (𝐹𝐴))
333ackbij1lem10 9002 . . . . . . . . . . 11 𝐹:(𝒫 ω ∩ Fin)⟶ω
34 peano1 7039 . . . . . . . . . . 11 ∅ ∈ ω
3533, 34f0cli 6331 . . . . . . . . . 10 (𝐹𝑎) ∈ ω
36 nnord 7027 . . . . . . . . . 10 ((𝐹𝑎) ∈ ω → Ord (𝐹𝑎))
3735, 36ax-mp 5 . . . . . . . . 9 Ord (𝐹𝑎)
3833, 34f0cli 6331 . . . . . . . . . 10 (𝐹𝐴) ∈ ω
39 nnord 7027 . . . . . . . . . 10 ((𝐹𝐴) ∈ ω → Ord (𝐹𝐴))
4038, 39ax-mp 5 . . . . . . . . 9 Ord (𝐹𝐴)
41 ordsucsssuc 6977 . . . . . . . . 9 ((Ord (𝐹𝑎) ∧ Ord (𝐹𝐴)) → ((𝐹𝑎) ⊆ (𝐹𝐴) ↔ suc (𝐹𝑎) ⊆ suc (𝐹𝐴)))
4237, 40, 41mp2an 707 . . . . . . . 8 ((𝐹𝑎) ⊆ (𝐹𝐴) ↔ suc (𝐹𝑎) ⊆ suc (𝐹𝐴))
4332, 42sylib 208 . . . . . . 7 ((𝐴 ∈ ω ∧ 𝑎 ∈ 𝒫 𝐴) → suc (𝐹𝑎) ⊆ suc (𝐹𝐴))
443ackbij1lem14 9006 . . . . . . . . 9 (𝐴 ∈ ω → (𝐹‘{𝐴}) = suc (𝐹𝐴))
453ackbij1lem8 9000 . . . . . . . . 9 (𝐴 ∈ ω → (𝐹‘{𝐴}) = (card‘𝒫 𝐴))
4644, 45eqtr3d 2657 . . . . . . . 8 (𝐴 ∈ ω → suc (𝐹𝐴) = (card‘𝒫 𝐴))
4746adantr 481 . . . . . . 7 ((𝐴 ∈ ω ∧ 𝑎 ∈ 𝒫 𝐴) → suc (𝐹𝐴) = (card‘𝒫 𝐴))
4843, 47sseqtrd 3625 . . . . . 6 ((𝐴 ∈ ω ∧ 𝑎 ∈ 𝒫 𝐴) → suc (𝐹𝑎) ⊆ (card‘𝒫 𝐴))
49 sucssel 5783 . . . . . 6 ((𝐹𝑎) ∈ V → (suc (𝐹𝑎) ⊆ (card‘𝒫 𝐴) → (𝐹𝑎) ∈ (card‘𝒫 𝐴)))
5028, 48, 49mpsyl 68 . . . . 5 ((𝐴 ∈ ω ∧ 𝑎 ∈ 𝒫 𝐴) → (𝐹𝑎) ∈ (card‘𝒫 𝐴))
5150ralrimiva 2961 . . . 4 (𝐴 ∈ ω → ∀𝑎 ∈ 𝒫 𝐴(𝐹𝑎) ∈ (card‘𝒫 𝐴))
52 f1fun 6065 . . . . . 6 (𝐹:(𝒫 ω ∩ Fin)–1-1→ω → Fun 𝐹)
534, 52ax-mp 5 . . . . 5 Fun 𝐹
54 f1dm 6067 . . . . . . 7 (𝐹:(𝒫 ω ∩ Fin)–1-1→ω → dom 𝐹 = (𝒫 ω ∩ Fin))
554, 54ax-mp 5 . . . . . 6 dom 𝐹 = (𝒫 ω ∩ Fin)
561, 55syl6sseqr 3636 . . . . 5 (𝐴 ∈ ω → 𝒫 𝐴 ⊆ dom 𝐹)
57 funimass4 6209 . . . . 5 ((Fun 𝐹 ∧ 𝒫 𝐴 ⊆ dom 𝐹) → ((𝐹 “ 𝒫 𝐴) ⊆ (card‘𝒫 𝐴) ↔ ∀𝑎 ∈ 𝒫 𝐴(𝐹𝑎) ∈ (card‘𝒫 𝐴)))
5853, 56, 57sylancr 694 . . . 4 (𝐴 ∈ ω → ((𝐹 “ 𝒫 𝐴) ⊆ (card‘𝒫 𝐴) ↔ ∀𝑎 ∈ 𝒫 𝐴(𝐹𝑎) ∈ (card‘𝒫 𝐴)))
5951, 58mpbird 247 . . 3 (𝐴 ∈ ω → (𝐹 “ 𝒫 𝐴) ⊆ (card‘𝒫 𝐴))
60 sspss 3689 . . 3 ((𝐹 “ 𝒫 𝐴) ⊆ (card‘𝒫 𝐴) ↔ ((𝐹 “ 𝒫 𝐴) ⊊ (card‘𝒫 𝐴) ∨ (𝐹 “ 𝒫 𝐴) = (card‘𝒫 𝐴)))
6159, 60sylib 208 . 2 (𝐴 ∈ ω → ((𝐹 “ 𝒫 𝐴) ⊊ (card‘𝒫 𝐴) ∨ (𝐹 “ 𝒫 𝐴) = (card‘𝒫 𝐴)))
62 orel1 397 . 2 (¬ (𝐹 “ 𝒫 𝐴) ⊊ (card‘𝒫 𝐴) → (((𝐹 “ 𝒫 𝐴) ⊊ (card‘𝒫 𝐴) ∨ (𝐹 “ 𝒫 𝐴) = (card‘𝒫 𝐴)) → (𝐹 “ 𝒫 𝐴) = (card‘𝒫 𝐴)))
6327, 61, 62sylc 65 1 (𝐴 ∈ ω → (𝐹 “ 𝒫 𝐴) = (card‘𝒫 𝐴))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 196   ∨ wo 383   ∧ wa 384   = wceq 1480   ∈ wcel 1987  ∀wral 2907  Vcvv 3189   ∩ cin 3558   ⊆ wss 3559   ⊊ wpss 3560  𝒫 cpw 4135  {csn 4153  ∪ ciun 4490   class class class wbr 4618   ↦ cmpt 4678   × cxp 5077  dom cdm 5079   “ cima 5082  Ord word 5686  Oncon0 5687  suc csuc 5689  Fun wfun 5846  –1-1→wf1 5849  ‘cfv 5852  ωcom 7019   ≈ cen 7903   ≺ csdm 7905  Fincfn 7906  cardccrd 8712 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4736  ax-sep 4746  ax-nul 4754  ax-pow 4808  ax-pr 4872  ax-un 6909 This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-ral 2912  df-rex 2913  df-reu 2914  df-rmo 2915  df-rab 2916  df-v 3191  df-sbc 3422  df-csb 3519  df-dif 3562  df-un 3564  df-in 3566  df-ss 3573  df-pss 3575  df-nul 3897  df-if 4064  df-pw 4137  df-sn 4154  df-pr 4156  df-tp 4158  df-op 4160  df-uni 4408  df-int 4446  df-iun 4492  df-br 4619  df-opab 4679  df-mpt 4680  df-tr 4718  df-eprel 4990  df-id 4994  df-po 5000  df-so 5001  df-fr 5038  df-we 5040  df-xp 5085  df-rel 5086  df-cnv 5087  df-co 5088  df-dm 5089  df-rn 5090  df-res 5091  df-ima 5092  df-pred 5644  df-ord 5690  df-on 5691  df-lim 5692  df-suc 5693  df-iota 5815  df-fun 5854  df-fn 5855  df-f 5856  df-f1 5857  df-fo 5858  df-f1o 5859  df-fv 5860  df-ov 6613  df-oprab 6614  df-mpt2 6615  df-om 7020  df-1st 7120  df-2nd 7121  df-wrecs 7359  df-recs 7420  df-rdg 7458  df-1o 7512  df-2o 7513  df-oadd 7516  df-er 7694  df-map 7811  df-en 7907  df-dom 7908  df-sdom 7909  df-fin 7910  df-card 8716  df-cda 8941 This theorem is referenced by:  ackbij2lem2  9013
 Copyright terms: Public domain W3C validator