Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  elhf2 Structured version   Visualization version   GIF version

Theorem elhf2 34404
Description: Alternate form of membership in the hereditarily finite sets. (Contributed by Scott Fenton, 13-Jul-2015.)
Hypothesis
Ref Expression
elhf2.1 𝐴 ∈ V
Assertion
Ref Expression
elhf2 (𝐴 ∈ Hf ↔ (rank‘𝐴) ∈ ω)

Proof of Theorem elhf2
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 elhf 34403 . 2 (𝐴 ∈ Hf ↔ ∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥))
2 omon 7699 . . 3 (ω ∈ On ∨ ω = On)
3 nnon 7693 . . . . . . . . 9 (𝑥 ∈ ω → 𝑥 ∈ On)
4 elhf2.1 . . . . . . . . . 10 𝐴 ∈ V
54rankr1a 9525 . . . . . . . . 9 (𝑥 ∈ On → (𝐴 ∈ (𝑅1𝑥) ↔ (rank‘𝐴) ∈ 𝑥))
63, 5syl 17 . . . . . . . 8 (𝑥 ∈ ω → (𝐴 ∈ (𝑅1𝑥) ↔ (rank‘𝐴) ∈ 𝑥))
76adantl 481 . . . . . . 7 ((ω ∈ On ∧ 𝑥 ∈ ω) → (𝐴 ∈ (𝑅1𝑥) ↔ (rank‘𝐴) ∈ 𝑥))
8 elnn 7698 . . . . . . . . 9 (((rank‘𝐴) ∈ 𝑥𝑥 ∈ ω) → (rank‘𝐴) ∈ ω)
98expcom 413 . . . . . . . 8 (𝑥 ∈ ω → ((rank‘𝐴) ∈ 𝑥 → (rank‘𝐴) ∈ ω))
109adantl 481 . . . . . . 7 ((ω ∈ On ∧ 𝑥 ∈ ω) → ((rank‘𝐴) ∈ 𝑥 → (rank‘𝐴) ∈ ω))
117, 10sylbid 239 . . . . . 6 ((ω ∈ On ∧ 𝑥 ∈ ω) → (𝐴 ∈ (𝑅1𝑥) → (rank‘𝐴) ∈ ω))
1211rexlimdva 3212 . . . . 5 (ω ∈ On → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥) → (rank‘𝐴) ∈ ω))
13 peano2 7711 . . . . . . . 8 ((rank‘𝐴) ∈ ω → suc (rank‘𝐴) ∈ ω)
1413adantr 480 . . . . . . 7 (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → suc (rank‘𝐴) ∈ ω)
15 r1rankid 9548 . . . . . . . . . 10 (𝐴 ∈ V → 𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
164, 15mp1i 13 . . . . . . . . 9 (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → 𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
174elpw 4534 . . . . . . . . 9 (𝐴 ∈ 𝒫 (𝑅1‘(rank‘𝐴)) ↔ 𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
1816, 17sylibr 233 . . . . . . . 8 (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → 𝐴 ∈ 𝒫 (𝑅1‘(rank‘𝐴)))
19 nnon 7693 . . . . . . . . . 10 ((rank‘𝐴) ∈ ω → (rank‘𝐴) ∈ On)
20 r1suc 9459 . . . . . . . . . 10 ((rank‘𝐴) ∈ On → (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴)))
2119, 20syl 17 . . . . . . . . 9 ((rank‘𝐴) ∈ ω → (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴)))
2221adantr 480 . . . . . . . 8 (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴)))
2318, 22eleqtrrd 2842 . . . . . . 7 (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))
24 fveq2 6756 . . . . . . . . 9 (𝑥 = suc (rank‘𝐴) → (𝑅1𝑥) = (𝑅1‘suc (rank‘𝐴)))
2524eleq2d 2824 . . . . . . . 8 (𝑥 = suc (rank‘𝐴) → (𝐴 ∈ (𝑅1𝑥) ↔ 𝐴 ∈ (𝑅1‘suc (rank‘𝐴))))
2625rspcev 3552 . . . . . . 7 ((suc (rank‘𝐴) ∈ ω ∧ 𝐴 ∈ (𝑅1‘suc (rank‘𝐴))) → ∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥))
2714, 23, 26syl2anc 583 . . . . . 6 (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → ∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥))
2827expcom 413 . . . . 5 (ω ∈ On → ((rank‘𝐴) ∈ ω → ∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥)))
2912, 28impbid 211 . . . 4 (ω ∈ On → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥) ↔ (rank‘𝐴) ∈ ω))
304tz9.13 9480 . . . . . 6 𝑥 ∈ On 𝐴 ∈ (𝑅1𝑥)
31 rankon 9484 . . . . . 6 (rank‘𝐴) ∈ On
3230, 312th 263 . . . . 5 (∃𝑥 ∈ On 𝐴 ∈ (𝑅1𝑥) ↔ (rank‘𝐴) ∈ On)
33 rexeq 3334 . . . . . 6 (ω = On → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1𝑥)))
34 eleq2 2827 . . . . . 6 (ω = On → ((rank‘𝐴) ∈ ω ↔ (rank‘𝐴) ∈ On))
3533, 34bibi12d 345 . . . . 5 (ω = On → ((∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥) ↔ (rank‘𝐴) ∈ ω) ↔ (∃𝑥 ∈ On 𝐴 ∈ (𝑅1𝑥) ↔ (rank‘𝐴) ∈ On)))
3632, 35mpbiri 257 . . . 4 (ω = On → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥) ↔ (rank‘𝐴) ∈ ω))
3729, 36jaoi 853 . . 3 ((ω ∈ On ∨ ω = On) → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥) ↔ (rank‘𝐴) ∈ ω))
382, 37ax-mp 5 . 2 (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥) ↔ (rank‘𝐴) ∈ ω)
391, 38bitri 274 1 (𝐴 ∈ Hf ↔ (rank‘𝐴) ∈ ω)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 205  wa 395  wo 843   = wceq 1539  wcel 2108  wrex 3064  Vcvv 3422  wss 3883  𝒫 cpw 4530  Oncon0 6251  suc csuc 6253  cfv 6418  ωcom 7687  𝑅1cr1 9451  rankcrnk 9452   Hf chf 34401
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-reg 9281  ax-inf2 9329
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-ov 7258  df-om 7688  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-er 8456  df-en 8692  df-dom 8693  df-sdom 8694  df-r1 9453  df-rank 9454  df-hf 34402
This theorem is referenced by:  elhf2g  34405  hfsn  34408
  Copyright terms: Public domain W3C validator