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 36667
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 36666 . 2 (𝐴 ∈ Hf ↔ ∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥))
2 omon 7870 . . 3 (ω ∈ On ∨ ω = On)
3 nnon 7864 . . . . . . . . 9 (𝑥 ∈ ω → 𝑥 ∈ On)
4 elhf2.1 . . . . . . . . . 10 𝐴 ∈ V
54rankr1a 9804 . . . . . . . . 9 (𝑥 ∈ On → (𝐴 ∈ (𝑅1𝑥) ↔ (rank‘𝐴) ∈ 𝑥))
63, 5syl 18 . . . . . . . 8 (𝑥 ∈ ω → (𝐴 ∈ (𝑅1𝑥) ↔ (rank‘𝐴) ∈ 𝑥))
76adantl 486 . . . . . . 7 ((ω ∈ On ∧ 𝑥 ∈ ω) → (𝐴 ∈ (𝑅1𝑥) ↔ (rank‘𝐴) ∈ 𝑥))
8 elnn 7869 . . . . . . . . 9 (((rank‘𝐴) ∈ 𝑥𝑥 ∈ ω) → (rank‘𝐴) ∈ ω)
98expcom 418 . . . . . . . 8 (𝑥 ∈ ω → ((rank‘𝐴) ∈ 𝑥 → (rank‘𝐴) ∈ ω))
109adantl 486 . . . . . . 7 ((ω ∈ On ∧ 𝑥 ∈ ω) → ((rank‘𝐴) ∈ 𝑥 → (rank‘𝐴) ∈ ω))
117, 10sylbid 243 . . . . . 6 ((ω ∈ On ∧ 𝑥 ∈ ω) → (𝐴 ∈ (𝑅1𝑥) → (rank‘𝐴) ∈ ω))
1211rexlimdva 3166 . . . . 5 (ω ∈ On → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥) → (rank‘𝐴) ∈ ω))
13 peano2 7882 . . . . . . . 8 ((rank‘𝐴) ∈ ω → suc (rank‘𝐴) ∈ ω)
1413adantr 485 . . . . . . 7 (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → suc (rank‘𝐴) ∈ ω)
15 r1rankid 9827 . . . . . . . . . 10 (𝐴 ∈ V → 𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
164, 15mp1i 14 . . . . . . . . 9 (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → 𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
174elpw 4566 . . . . . . . . 9 (𝐴 ∈ 𝒫 (𝑅1‘(rank‘𝐴)) ↔ 𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
1816, 17sylibr 237 . . . . . . . 8 (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → 𝐴 ∈ 𝒫 (𝑅1‘(rank‘𝐴)))
19 nnon 7864 . . . . . . . . . 10 ((rank‘𝐴) ∈ ω → (rank‘𝐴) ∈ On)
20 r1suc 9738 . . . . . . . . . 10 ((rank‘𝐴) ∈ On → (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴)))
2119, 20syl 18 . . . . . . . . 9 ((rank‘𝐴) ∈ ω → (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴)))
2221adantr 485 . . . . . . . 8 (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴)))
2318, 22eleqtrrd 2866 . . . . . . 7 (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))
24 fveq2 6881 . . . . . . . . 9 (𝑥 = suc (rank‘𝐴) → (𝑅1𝑥) = (𝑅1‘suc (rank‘𝐴)))
2524eleq2d 2849 . . . . . . . 8 (𝑥 = suc (rank‘𝐴) → (𝐴 ∈ (𝑅1𝑥) ↔ 𝐴 ∈ (𝑅1‘suc (rank‘𝐴))))
2625rspcev 3581 . . . . . . 7 ((suc (rank‘𝐴) ∈ ω ∧ 𝐴 ∈ (𝑅1‘suc (rank‘𝐴))) → ∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥))
2714, 23, 26syl2anc 595 . . . . . 6 (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → ∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥))
2827expcom 418 . . . . 5 (ω ∈ On → ((rank‘𝐴) ∈ ω → ∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥)))
2912, 28impbid 215 . . . 4 (ω ∈ On → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥) ↔ (rank‘𝐴) ∈ ω))
304tz9.13 9759 . . . . . 6 𝑥 ∈ On 𝐴 ∈ (𝑅1𝑥)
31 rankon 9763 . . . . . 6 (rank‘𝐴) ∈ On
3230, 312th 267 . . . . 5 (∃𝑥 ∈ On 𝐴 ∈ (𝑅1𝑥) ↔ (rank‘𝐴) ∈ On)
33 rexeq 3319 . . . . . 6 (ω = On → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1𝑥)))
34 eleq2 2852 . . . . . 6 (ω = On → ((rank‘𝐴) ∈ ω ↔ (rank‘𝐴) ∈ On))
3533, 34bibi12d 348 . . . . 5 (ω = On → ((∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥) ↔ (rank‘𝐴) ∈ ω) ↔ (∃𝑥 ∈ On 𝐴 ∈ (𝑅1𝑥) ↔ (rank‘𝐴) ∈ On)))
3632, 35mpbiri 261 . . . 4 (ω = On → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥) ↔ (rank‘𝐴) ∈ ω))
3729, 36jaoi 870 . . 3 ((ω ∈ On ∨ ω = On) → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥) ↔ (rank‘𝐴) ∈ ω))
382, 37ax-mp 5 . 2 (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1𝑥) ↔ (rank‘𝐴) ∈ ω)
391, 38bitri 278 1 (𝐴 ∈ Hf ↔ (rank‘𝐴) ∈ ω)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  wa 400  wo 860   = wceq 1570  wcel 2143  wrex 3089  Vcvv 3455  wss 3905  𝒫 cpw 4562  Oncon0 6360  suc csuc 6362  cfv 6536  ωcom 7858  𝑅1cr1 9730  rankcrnk 9731   Hf chf 36664
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-reg 9550  ax-inf2 9606
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-om 7859  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-er 8690  df-en 8940  df-dom 8941  df-sdom 8942  df-r1 9732  df-rank 9733  df-hf 36665
This theorem is referenced by:  elhf2g  36668  hfsn  36671
  Copyright terms: Public domain W3C validator