Theorem elhf2 9910

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.

Step	Hyp	Ref	Expression
1		elhf 9907	. 2 ⊢ (𝐴 ∈ HF ↔ ∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥))
2		omon 7889	. . 3 ⊢ (ω ∈ On ∨ ω = On)
3		nnon 7883	. . . . . . . . 9 ⊢ (𝑥 ∈ ω → 𝑥 ∈ On)
4		elhf2.1	. . . . . . . . . 10 ⊢ 𝐴 ∈ V
5	4	rankr1a 9848	. . . . . . . . 9 ⊢ (𝑥 ∈ On → (𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ 𝑥))
6	3, 5	syl 18	. . . . . . . 8 ⊢ (𝑥 ∈ ω → (𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ 𝑥))
7	6	adantl 487	. . . . . . 7 ⊢ ((ω ∈ On ∧ 𝑥 ∈ ω) → (𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ 𝑥))
8		elnn 7888	. . . . . . . . 9 ⊢ (((rank‘𝐴) ∈ 𝑥 ∧ 𝑥 ∈ ω) → (rank‘𝐴) ∈ ω)
9	8	expcom 419	. . . . . . . 8 ⊢ (𝑥 ∈ ω → ((rank‘𝐴) ∈ 𝑥 → (rank‘𝐴) ∈ ω))
10	9	adantl 487	. . . . . . 7 ⊢ ((ω ∈ On ∧ 𝑥 ∈ ω) → ((rank‘𝐴) ∈ 𝑥 → (rank‘𝐴) ∈ ω))
11	7, 10	sylbid 243	. . . . . 6 ⊢ ((ω ∈ On ∧ 𝑥 ∈ ω) → (𝐴 ∈ (𝑅1‘𝑥) → (rank‘𝐴) ∈ ω))
12	11	rexlimdva 3164	. . . . 5 ⊢ (ω ∈ On → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) → (rank‘𝐴) ∈ ω))
13		peano2 7901	. . . . . . . 8 ⊢ ((rank‘𝐴) ∈ ω → suc (rank‘𝐴) ∈ ω)
14	13	adantr 486	. . . . . . 7 ⊢ (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → suc (rank‘𝐴) ∈ ω)
15		r1rankid 9875	. . . . . . . . . 10 ⊢ (𝐴 ∈ V → 𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
16	4, 15	mp1i 14	. . . . . . . . 9 ⊢ (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → 𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
17	4	elpw 4561	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝒫 (𝑅1‘(rank‘𝐴)) ↔ 𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
18	16, 17	sylibr 237	. . . . . . . 8 ⊢ (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → 𝐴 ∈ 𝒫 (𝑅1‘(rank‘𝐴)))
19		nnon 7883	. . . . . . . . . 10 ⊢ ((rank‘𝐴) ∈ ω → (rank‘𝐴) ∈ On)
20		r1suc 9777	. . . . . . . . . 10 ⊢ ((rank‘𝐴) ∈ On → (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴)))
21	19, 20	syl 18	. . . . . . . . 9 ⊢ ((rank‘𝐴) ∈ ω → (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴)))
22	21	adantr 486	. . . . . . . 8 ⊢ (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴)))
23	18, 22	eleqtrrd 2864	. . . . . . 7 ⊢ (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))
24		fveq2 6885	. . . . . . . . 9 ⊢ (𝑥 = suc (rank‘𝐴) → (𝑅1‘𝑥) = (𝑅1‘suc (rank‘𝐴)))
25	24	eleq2d 2847	. . . . . . . 8 ⊢ (𝑥 = suc (rank‘𝐴) → (𝐴 ∈ (𝑅1‘𝑥) ↔ 𝐴 ∈ (𝑅1‘suc (rank‘𝐴))))
26	25	rspcev 3577	. . . . . . 7 ⊢ ((suc (rank‘𝐴) ∈ ω ∧ 𝐴 ∈ (𝑅1‘suc (rank‘𝐴))) → ∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥))
27	14, 23, 26	syl2anc 596	. . . . . 6 ⊢ (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → ∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥))
28	27	expcom 419	. . . . 5 ⊢ (ω ∈ On → ((rank‘𝐴) ∈ ω → ∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥)))
29	12, 28	impbid 215	. . . 4 ⊢ (ω ∈ On → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ ω))
30	4	tz9.13 9798	. . . . . 6 ⊢ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘𝑥)
31		rankon 9803	. . . . . 6 ⊢ (rank‘𝐴) ∈ On
32	30, 31	2th 267	. . . . 5 ⊢ (∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ On)
33		rexeq 3316	. . . . . 6 ⊢ (ω = On → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘𝑥)))
34		eleq2 2850	. . . . . 6 ⊢ (ω = On → ((rank‘𝐴) ∈ ω ↔ (rank‘𝐴) ∈ On))
35	33, 34	bibi12d 348	. . . . 5 ⊢ (ω = On → ((∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ ω) ↔ (∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ On)))
36	32, 35	mpbiri 261	. . . 4 ⊢ (ω = On → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ ω))
37	29, 36	jaoi 871	. . 3 ⊢ ((ω ∈ On ∨ ω = On) → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ ω))
38	2, 37	ax-mp 5	. 2 ⊢ (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ ω)
39	1, 38	bitri 278	1 ⊢ (𝐴 ∈ HF ↔ (rank‘𝐴) ∈ ω)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   = wceq 1570   ∈ wcel 2145  ∃wrex 3087  Vcvv 3451   ⊆ wss 3899  𝒫 cpw 4557  Oncon0 6362  suc csuc 6364  ‘cfv 6538  ωcom 7877  𝑅₁cr1 9766  rankcrnk 9767   HF chf 9904

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 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751  ax-reg 9586  ax-inf2 9642

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 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-om 7878  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-r1 9768  df-rank 9769  df-hf 9905

This theorem is used by:  elhf2g  9911  hfsnOLD  9921