Theorem rankwflemb 9392

Description: Two ways of saying a set is well-founded. (Contributed by NM, 11-Oct-2003.) (Revised by Mario Carneiro, 16-Nov-2014.)

Assertion

Ref	Expression
rankwflemb	⊢ (𝐴 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))

Distinct variable group:   𝑥,𝐴

Proof of Theorem rankwflemb

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eluni 4812	. . 3 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑦(𝐴 ∈ 𝑦 ∧ 𝑦 ∈ (𝑅1 “ On)))
2		eleq2 2822	. . . . . . . 8 ⊢ ((𝑅1‘𝑥) = 𝑦 → (𝐴 ∈ (𝑅1‘𝑥) ↔ 𝐴 ∈ 𝑦))
3	2	biimprcd 253	. . . . . . 7 ⊢ (𝐴 ∈ 𝑦 → ((𝑅1‘𝑥) = 𝑦 → 𝐴 ∈ (𝑅1‘𝑥)))
4		r1tr 9375	. . . . . . . . . . 11 ⊢ Tr (𝑅1‘𝑥)
5		trss 5159	. . . . . . . . . . 11 ⊢ (Tr (𝑅1‘𝑥) → (𝐴 ∈ (𝑅1‘𝑥) → 𝐴 ⊆ (𝑅1‘𝑥)))
6	4, 5	ax-mp 5	. . . . . . . . . 10 ⊢ (𝐴 ∈ (𝑅1‘𝑥) → 𝐴 ⊆ (𝑅1‘𝑥))
7		elpwg 4506	. . . . . . . . . 10 ⊢ (𝐴 ∈ (𝑅1‘𝑥) → (𝐴 ∈ 𝒫 (𝑅1‘𝑥) ↔ 𝐴 ⊆ (𝑅1‘𝑥)))
8	6, 7	mpbird 260	. . . . . . . . 9 ⊢ (𝐴 ∈ (𝑅1‘𝑥) → 𝐴 ∈ 𝒫 (𝑅1‘𝑥))
9		elfvdm 6738	. . . . . . . . . 10 ⊢ (𝐴 ∈ (𝑅1‘𝑥) → 𝑥 ∈ dom 𝑅1)
10		r1sucg 9368	. . . . . . . . . 10 ⊢ (𝑥 ∈ dom 𝑅1 → (𝑅1‘suc 𝑥) = 𝒫 (𝑅1‘𝑥))
11	9, 10	syl 17	. . . . . . . . 9 ⊢ (𝐴 ∈ (𝑅1‘𝑥) → (𝑅1‘suc 𝑥) = 𝒫 (𝑅1‘𝑥))
12	8, 11	eleqtrrd 2837	. . . . . . . 8 ⊢ (𝐴 ∈ (𝑅1‘𝑥) → 𝐴 ∈ (𝑅1‘suc 𝑥))
13	12	a1i 11	. . . . . . 7 ⊢ (𝑥 ∈ On → (𝐴 ∈ (𝑅1‘𝑥) → 𝐴 ∈ (𝑅1‘suc 𝑥)))
14	3, 13	syl9 77	. . . . . 6 ⊢ (𝐴 ∈ 𝑦 → (𝑥 ∈ On → ((𝑅1‘𝑥) = 𝑦 → 𝐴 ∈ (𝑅1‘suc 𝑥))))
15	14	reximdvai 3184	. . . . 5 ⊢ (𝐴 ∈ 𝑦 → (∃𝑥 ∈ On (𝑅1‘𝑥) = 𝑦 → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥)))
16		r1funlim 9365	. . . . . . 7 ⊢ (Fun 𝑅1 ∧ Lim dom 𝑅1)
17	16	simpli 487	. . . . . 6 ⊢ Fun 𝑅1
18		fvelima 6767	. . . . . 6 ⊢ ((Fun 𝑅1 ∧ 𝑦 ∈ (𝑅1 “ On)) → ∃𝑥 ∈ On (𝑅1‘𝑥) = 𝑦)
19	17, 18	mpan 690	. . . . 5 ⊢ (𝑦 ∈ (𝑅1 “ On) → ∃𝑥 ∈ On (𝑅1‘𝑥) = 𝑦)
20	15, 19	impel 509	. . . 4 ⊢ ((𝐴 ∈ 𝑦 ∧ 𝑦 ∈ (𝑅1 “ On)) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
21	20	exlimiv 1938	. . 3 ⊢ (∃𝑦(𝐴 ∈ 𝑦 ∧ 𝑦 ∈ (𝑅1 “ On)) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
22	1, 21	sylbi 220	. 2 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) → ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))
23		elfvdm 6738	. . . . . 6 ⊢ (𝐴 ∈ (𝑅1‘suc 𝑥) → suc 𝑥 ∈ dom 𝑅1)
24		fvelrn 6886	. . . . . 6 ⊢ ((Fun 𝑅1 ∧ suc 𝑥 ∈ dom 𝑅1) → (𝑅1‘suc 𝑥) ∈ ran 𝑅1)
25	17, 23, 24	sylancr 590	. . . . 5 ⊢ (𝐴 ∈ (𝑅1‘suc 𝑥) → (𝑅1‘suc 𝑥) ∈ ran 𝑅1)
26		df-ima 5553	. . . . . 6 ⊢ (𝑅1 “ On) = ran (𝑅1 ↾ On)
27		funrel 6386	. . . . . . . . 9 ⊢ (Fun 𝑅1 → Rel 𝑅1)
28	17, 27	ax-mp 5	. . . . . . . 8 ⊢ Rel 𝑅1
29	16	simpri 489	. . . . . . . . 9 ⊢ Lim dom 𝑅1
30		limord 6261	. . . . . . . . 9 ⊢ (Lim dom 𝑅1 → Ord dom 𝑅1)
31		ordsson 7556	. . . . . . . . 9 ⊢ (Ord dom 𝑅1 → dom 𝑅1 ⊆ On)
32	29, 30, 31	mp2b 10	. . . . . . . 8 ⊢ dom 𝑅1 ⊆ On
33		relssres 5881	. . . . . . . 8 ⊢ ((Rel 𝑅1 ∧ dom 𝑅1 ⊆ On) → (𝑅1 ↾ On) = 𝑅1)
34	28, 32, 33	mp2an 692	. . . . . . 7 ⊢ (𝑅1 ↾ On) = 𝑅1
35	34	rneqi 5795	. . . . . 6 ⊢ ran (𝑅1 ↾ On) = ran 𝑅1
36	26, 35	eqtri 2762	. . . . 5 ⊢ (𝑅1 “ On) = ran 𝑅1
37	25, 36	eleqtrrdi 2845	. . . 4 ⊢ (𝐴 ∈ (𝑅1‘suc 𝑥) → (𝑅1‘suc 𝑥) ∈ (𝑅1 “ On))
38		elunii 4814	. . . 4 ⊢ ((𝐴 ∈ (𝑅1‘suc 𝑥) ∧ (𝑅1‘suc 𝑥) ∈ (𝑅1 “ On)) → 𝐴 ∈ ∪ (𝑅1 “ On))
39	37, 38	mpdan 687	. . 3 ⊢ (𝐴 ∈ (𝑅1‘suc 𝑥) → 𝐴 ∈ ∪ (𝑅1 “ On))
40	39	rexlimivw 3194	. 2 ⊢ (∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥) → 𝐴 ∈ ∪ (𝑅1 “ On))
41	22, 40	impbii 212	1 ⊢ (𝐴 ∈ ∪ (𝑅1 “ On) ↔ ∃𝑥 ∈ On 𝐴 ∈ (𝑅1‘suc 𝑥))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   = wceq 1543  ∃wex 1787   ∈ wcel 2110  ∃wrex 3055   ⊆ wss 3857  𝒫 cpw 4503  ∪ cuni 4809  Tr wtr 5150  dom cdm 5540  ran crn 5541   ↾ cres 5542   “ cima 5543  Rel wrel 5545  Ord word 6201  Oncon0 6202  Lim wlim 6203  suc csuc 6204  Fun wfun 6363  ‘cfv 6369  𝑅₁cr1 9361

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2706  ax-sep 5181  ax-nul 5188  ax-pow 5247  ax-pr 5311  ax-un 7512

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3or 1090  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-mo 2537  df-eu 2566  df-clab 2713  df-cleq 2726  df-clel 2812  df-nfc 2882  df-ne 2936  df-ral 3059  df-rex 3060  df-reu 3061  df-rab 3063  df-v 3403  df-sbc 3688  df-csb 3803  df-dif 3860  df-un 3862  df-in 3864  df-ss 3874  df-pss 3876  df-nul 4228  df-if 4430  df-pw 4505  df-sn 4532  df-pr 4534  df-tp 4536  df-op 4538  df-uni 4810  df-iun 4896  df-br 5044  df-opab 5106  df-mpt 5125  df-tr 5151  df-id 5444  df-eprel 5449  df-po 5457  df-so 5458  df-fr 5498  df-we 5500  df-xp 5546  df-rel 5547  df-cnv 5548  df-co 5549  df-dm 5550  df-rn 5551  df-res 5552  df-ima 5553  df-pred 6149  df-ord 6205  df-on 6206  df-lim 6207  df-suc 6208  df-iota 6327  df-fun 6371  df-fn 6372  df-f 6373  df-f1 6374  df-fo 6375  df-f1o 6376  df-fv 6377  df-om 7634  df-wrecs 8036  df-recs 8097  df-rdg 8135  df-r1 9363

This theorem is referenced by:  rankf  9393  r1elwf  9395  rankvalb  9396  rankidb  9399  rankwflem  9414  tcrank  9483  dfac12r  9743