Theorem elhf2 36369

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 36368	. 2 ⊢ (𝐴 ∈ Hf ↔ ∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥))
2		omon 7820	. . 3 ⊢ (ω ∈ On ∨ ω = On)
3		nnon 7814	. . . . . . . . 9 ⊢ (𝑥 ∈ ω → 𝑥 ∈ On)
4		elhf2.1	. . . . . . . . . 10 ⊢ 𝐴 ∈ V
5	4	rankr1a 9748	. . . . . . . . 9 ⊢ (𝑥 ∈ On → (𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ 𝑥))
6	3, 5	syl 17	. . . . . . . 8 ⊢ (𝑥 ∈ ω → (𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ 𝑥))
7	6	adantl 481	. . . . . . 7 ⊢ ((ω ∈ On ∧ 𝑥 ∈ ω) → (𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ 𝑥))
8		elnn 7819	. . . . . . . . 9 ⊢ (((rank‘𝐴) ∈ 𝑥 ∧ 𝑥 ∈ ω) → (rank‘𝐴) ∈ ω)
9	8	expcom 413	. . . . . . . 8 ⊢ (𝑥 ∈ ω → ((rank‘𝐴) ∈ 𝑥 → (rank‘𝐴) ∈ ω))
10	9	adantl 481	. . . . . . 7 ⊢ ((ω ∈ On ∧ 𝑥 ∈ ω) → ((rank‘𝐴) ∈ 𝑥 → (rank‘𝐴) ∈ ω))
11	7, 10	sylbid 240	. . . . . 6 ⊢ ((ω ∈ On ∧ 𝑥 ∈ ω) → (𝐴 ∈ (𝑅1‘𝑥) → (rank‘𝐴) ∈ ω))
12	11	rexlimdva 3137	. . . . 5 ⊢ (ω ∈ On → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) → (rank‘𝐴) ∈ ω))
13		peano2 7832	. . . . . . . 8 ⊢ ((rank‘𝐴) ∈ ω → suc (rank‘𝐴) ∈ ω)
14	13	adantr 480	. . . . . . 7 ⊢ (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → suc (rank‘𝐴) ∈ ω)
15		r1rankid 9771	. . . . . . . . . 10 ⊢ (𝐴 ∈ V → 𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
16	4, 15	mp1i 13	. . . . . . . . 9 ⊢ (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → 𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
17	4	elpw 4558	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝒫 (𝑅1‘(rank‘𝐴)) ↔ 𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
18	16, 17	sylibr 234	. . . . . . . 8 ⊢ (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → 𝐴 ∈ 𝒫 (𝑅1‘(rank‘𝐴)))
19		nnon 7814	. . . . . . . . . 10 ⊢ ((rank‘𝐴) ∈ ω → (rank‘𝐴) ∈ On)
20		r1suc 9682	. . . . . . . . . 10 ⊢ ((rank‘𝐴) ∈ On → (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴)))
21	19, 20	syl 17	. . . . . . . . 9 ⊢ ((rank‘𝐴) ∈ ω → (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴)))
22	21	adantr 480	. . . . . . . 8 ⊢ (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴)))
23	18, 22	eleqtrrd 2839	. . . . . . 7 ⊢ (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))
24		fveq2 6834	. . . . . . . . 9 ⊢ (𝑥 = suc (rank‘𝐴) → (𝑅1‘𝑥) = (𝑅1‘suc (rank‘𝐴)))
25	24	eleq2d 2822	. . . . . . . 8 ⊢ (𝑥 = suc (rank‘𝐴) → (𝐴 ∈ (𝑅1‘𝑥) ↔ 𝐴 ∈ (𝑅1‘suc (rank‘𝐴))))
26	25	rspcev 3576	. . . . . . 7 ⊢ ((suc (rank‘𝐴) ∈ ω ∧ 𝐴 ∈ (𝑅1‘suc (rank‘𝐴))) → ∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥))
27	14, 23, 26	syl2anc 584	. . . . . 6 ⊢ (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → ∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥))
28	27	expcom 413	. . . . 5 ⊢ (ω ∈ On → ((rank‘𝐴) ∈ ω → ∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥)))
29	12, 28	impbid 212	. . . 4 ⊢ (ω ∈ On → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ ω))
30	4	tz9.13 9703	. . . . . 6 ⊢ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘𝑥)
31		rankon 9707	. . . . . 6 ⊢ (rank‘𝐴) ∈ On
32	30, 31	2th 264	. . . . 5 ⊢ (∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ On)
33		rexeq 3292	. . . . . 6 ⊢ (ω = On → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘𝑥)))
34		eleq2 2825	. . . . . 6 ⊢ (ω = On → ((rank‘𝐴) ∈ ω ↔ (rank‘𝐴) ∈ On))
35	33, 34	bibi12d 345	. . . . 5 ⊢ (ω = On → ((∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ ω) ↔ (∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ On)))
36	32, 35	mpbiri 258	. . . 4 ⊢ (ω = On → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ ω))
37	29, 36	jaoi 857	. . 3 ⊢ ((ω ∈ On ∨ ω = On) → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ ω))
38	2, 37	ax-mp 5	. 2 ⊢ (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ ω)
39	1, 38	bitri 275	1 ⊢ (𝐴 ∈ Hf ↔ (rank‘𝐴) ∈ ω)

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 847   = wceq 1541   ∈ wcel 2113  ∃wrex 3060  Vcvv 3440   ⊆ wss 3901  𝒫 cpw 4554  Oncon0 6317  suc csuc 6319  ‘cfv 6492  ωcom 7808  𝑅₁cr1 9674  rankcrnk 9675   Hf chf 36366

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680  ax-reg 9497  ax-inf2 9550

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-int 4903  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-ov 7361  df-om 7809  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-er 8635  df-en 8884  df-dom 8885  df-sdom 8886  df-r1 9676  df-rank 9677  df-hf 36367

This theorem is referenced by:  elhf2g  36370  hfsn  36373