Theorem elhf2 35142

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 35141	. 2 ⊢ (𝐴 ∈ Hf ↔ ∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥))
2		omon 7866	. . 3 ⊢ (ω ∈ On ∨ ω = On)
3		nnon 7860	. . . . . . . . 9 ⊢ (𝑥 ∈ ω → 𝑥 ∈ On)
4		elhf2.1	. . . . . . . . . 10 ⊢ 𝐴 ∈ V
5	4	rankr1a 9830	. . . . . . . . 9 ⊢ (𝑥 ∈ On → (𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ 𝑥))
6	3, 5	syl 17	. . . . . . . 8 ⊢ (𝑥 ∈ ω → (𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ 𝑥))
7	6	adantl 482	. . . . . . 7 ⊢ ((ω ∈ On ∧ 𝑥 ∈ ω) → (𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ 𝑥))
8		elnn 7865	. . . . . . . . 9 ⊢ (((rank‘𝐴) ∈ 𝑥 ∧ 𝑥 ∈ ω) → (rank‘𝐴) ∈ ω)
9	8	expcom 414	. . . . . . . 8 ⊢ (𝑥 ∈ ω → ((rank‘𝐴) ∈ 𝑥 → (rank‘𝐴) ∈ ω))
10	9	adantl 482	. . . . . . 7 ⊢ ((ω ∈ On ∧ 𝑥 ∈ ω) → ((rank‘𝐴) ∈ 𝑥 → (rank‘𝐴) ∈ ω))
11	7, 10	sylbid 239	. . . . . 6 ⊢ ((ω ∈ On ∧ 𝑥 ∈ ω) → (𝐴 ∈ (𝑅1‘𝑥) → (rank‘𝐴) ∈ ω))
12	11	rexlimdva 3155	. . . . 5 ⊢ (ω ∈ On → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) → (rank‘𝐴) ∈ ω))
13		peano2 7880	. . . . . . . 8 ⊢ ((rank‘𝐴) ∈ ω → suc (rank‘𝐴) ∈ ω)
14	13	adantr 481	. . . . . . 7 ⊢ (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → suc (rank‘𝐴) ∈ ω)
15		r1rankid 9853	. . . . . . . . . 10 ⊢ (𝐴 ∈ V → 𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
16	4, 15	mp1i 13	. . . . . . . . 9 ⊢ (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → 𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
17	4	elpw 4606	. . . . . . . . 9 ⊢ (𝐴 ∈ 𝒫 (𝑅1‘(rank‘𝐴)) ↔ 𝐴 ⊆ (𝑅1‘(rank‘𝐴)))
18	16, 17	sylibr 233	. . . . . . . 8 ⊢ (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → 𝐴 ∈ 𝒫 (𝑅1‘(rank‘𝐴)))
19		nnon 7860	. . . . . . . . . 10 ⊢ ((rank‘𝐴) ∈ ω → (rank‘𝐴) ∈ On)
20		r1suc 9764	. . . . . . . . . 10 ⊢ ((rank‘𝐴) ∈ On → (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴)))
21	19, 20	syl 17	. . . . . . . . 9 ⊢ ((rank‘𝐴) ∈ ω → (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴)))
22	21	adantr 481	. . . . . . . 8 ⊢ (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → (𝑅1‘suc (rank‘𝐴)) = 𝒫 (𝑅1‘(rank‘𝐴)))
23	18, 22	eleqtrrd 2836	. . . . . . 7 ⊢ (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → 𝐴 ∈ (𝑅1‘suc (rank‘𝐴)))
24		fveq2 6891	. . . . . . . . 9 ⊢ (𝑥 = suc (rank‘𝐴) → (𝑅1‘𝑥) = (𝑅1‘suc (rank‘𝐴)))
25	24	eleq2d 2819	. . . . . . . 8 ⊢ (𝑥 = suc (rank‘𝐴) → (𝐴 ∈ (𝑅1‘𝑥) ↔ 𝐴 ∈ (𝑅1‘suc (rank‘𝐴))))
26	25	rspcev 3612	. . . . . . 7 ⊢ ((suc (rank‘𝐴) ∈ ω ∧ 𝐴 ∈ (𝑅1‘suc (rank‘𝐴))) → ∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥))
27	14, 23, 26	syl2anc 584	. . . . . 6 ⊢ (((rank‘𝐴) ∈ ω ∧ ω ∈ On) → ∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥))
28	27	expcom 414	. . . . 5 ⊢ (ω ∈ On → ((rank‘𝐴) ∈ ω → ∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥)))
29	12, 28	impbid 211	. . . 4 ⊢ (ω ∈ On → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ ω))
30	4	tz9.13 9785	. . . . . 6 ⊢ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘𝑥)
31		rankon 9789	. . . . . 6 ⊢ (rank‘𝐴) ∈ On
32	30, 31	2th 263	. . . . 5 ⊢ (∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ On)
33		rexeq 3321	. . . . . 6 ⊢ (ω = On → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘𝑥)))
34		eleq2 2822	. . . . . 6 ⊢ (ω = On → ((rank‘𝐴) ∈ ω ↔ (rank‘𝐴) ∈ On))
35	33, 34	bibi12d 345	. . . . 5 ⊢ (ω = On → ((∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ ω) ↔ (∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ On)))
36	32, 35	mpbiri 257	. . . 4 ⊢ (ω = On → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ ω))
37	29, 36	jaoi 855	. . 3 ⊢ ((ω ∈ On ∨ ω = On) → (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ ω))
38	2, 37	ax-mp 5	. 2 ⊢ (∃𝑥 ∈ ω 𝐴 ∈ (𝑅1‘𝑥) ↔ (rank‘𝐴) ∈ ω)
39	1, 38	bitri 274	1 ⊢ (𝐴 ∈ Hf ↔ (rank‘𝐴) ∈ ω)

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 396   ∨ wo 845   = wceq 1541   ∈ wcel 2106  ∃wrex 3070  Vcvv 3474   ⊆ wss 3948  𝒫 cpw 4602  Oncon0 6364  suc csuc 6366  ‘cfv 6543  ωcom 7854  𝑅₁cr1 9756  rankcrnk 9757   Hf chf 35139

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-rep 5285  ax-sep 5299  ax-nul 5306  ax-pow 5363  ax-pr 5427  ax-un 7724  ax-reg 9586  ax-inf2 9635

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3778  df-csb 3894  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-pss 3967  df-nul 4323  df-if 4529  df-pw 4604  df-sn 4629  df-pr 4631  df-op 4635  df-uni 4909  df-int 4951  df-iun 4999  df-br 5149  df-opab 5211  df-mpt 5232  df-tr 5266  df-id 5574  df-eprel 5580  df-po 5588  df-so 5589  df-fr 5631  df-we 5633  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-pred 6300  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6495  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7411  df-om 7855  df-2nd 7975  df-frecs 8265  df-wrecs 8296  df-recs 8370  df-rdg 8409  df-er 8702  df-en 8939  df-dom 8940  df-sdom 8941  df-r1 9758  df-rank 9759  df-hf 35140

This theorem is referenced by:  elhf2g  35143  hfsn  35146