Theorem rankonidlem 9853

Description: Lemma for rankonid 9854. (Contributed by NM, 14-Oct-2003.) (Revised by Mario Carneiro, 22-Mar-2013.)

Assertion

Ref	Expression
rankonidlem	⊢ (𝐴 ∈ dom 𝑅1 → (𝐴 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝐴) = 𝐴))

Proof of Theorem rankonidlem

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		r1funlim 9791	. . . . 5 ⊢ (Fun 𝑅1 ∧ Lim dom 𝑅1)
2	1	simpri 484	. . . 4 ⊢ Lim dom 𝑅1
3		limord 6431	. . . 4 ⊢ (Lim dom 𝑅1 → Ord dom 𝑅1)
4	2, 3	ax-mp 5	. . 3 ⊢ Ord dom 𝑅1
5		ordelon 6395	. . 3 ⊢ ((Ord dom 𝑅1 ∧ 𝐴 ∈ dom 𝑅1) → 𝐴 ∈ On)
6	4, 5	mpan 688	. 2 ⊢ (𝐴 ∈ dom 𝑅1 → 𝐴 ∈ On)
7		eleq1 2813	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ dom 𝑅1 ↔ 𝑦 ∈ dom 𝑅1))
8		eleq1 2813	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ ∪ (𝑅1 “ On) ↔ 𝑦 ∈ ∪ (𝑅1 “ On)))
9		fveq2 6896	. . . . . 6 ⊢ (𝑥 = 𝑦 → (rank‘𝑥) = (rank‘𝑦))
10		id 22	. . . . . 6 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦)
11	9, 10	eqeq12d 2741	. . . . 5 ⊢ (𝑥 = 𝑦 → ((rank‘𝑥) = 𝑥 ↔ (rank‘𝑦) = 𝑦))
12	8, 11	anbi12d 630	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑥) = 𝑥) ↔ (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)))
13	7, 12	imbi12d 343	. . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ dom 𝑅1 → (𝑥 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑥) = 𝑥)) ↔ (𝑦 ∈ dom 𝑅1 → (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦))))
14		eleq1 2813	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ dom 𝑅1 ↔ 𝐴 ∈ dom 𝑅1))
15		eleq1 2813	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ ∪ (𝑅1 “ On) ↔ 𝐴 ∈ ∪ (𝑅1 “ On)))
16		fveq2 6896	. . . . . 6 ⊢ (𝑥 = 𝐴 → (rank‘𝑥) = (rank‘𝐴))
17		id 22	. . . . . 6 ⊢ (𝑥 = 𝐴 → 𝑥 = 𝐴)
18	16, 17	eqeq12d 2741	. . . . 5 ⊢ (𝑥 = 𝐴 → ((rank‘𝑥) = 𝑥 ↔ (rank‘𝐴) = 𝐴))
19	15, 18	anbi12d 630	. . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑥) = 𝑥) ↔ (𝐴 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝐴) = 𝐴)))
20	14, 19	imbi12d 343	. . 3 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ dom 𝑅1 → (𝑥 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑥) = 𝑥)) ↔ (𝐴 ∈ dom 𝑅1 → (𝐴 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝐴) = 𝐴))))
21		ordtr1 6414	. . . . . . . . . 10 ⊢ (Ord dom 𝑅1 → ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ dom 𝑅1) → 𝑦 ∈ dom 𝑅1))
22	4, 21	ax-mp 5	. . . . . . . . 9 ⊢ ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ dom 𝑅1) → 𝑦 ∈ dom 𝑅1)
23	22	ancoms 457	. . . . . . . 8 ⊢ ((𝑥 ∈ dom 𝑅1 ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ dom 𝑅1)
24		pm5.5 360	. . . . . . . 8 ⊢ (𝑦 ∈ dom 𝑅1 → ((𝑦 ∈ dom 𝑅1 → (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) ↔ (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)))
25	23, 24	syl 17	. . . . . . 7 ⊢ ((𝑥 ∈ dom 𝑅1 ∧ 𝑦 ∈ 𝑥) → ((𝑦 ∈ dom 𝑅1 → (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) ↔ (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)))
26	25	ralbidva 3165	. . . . . 6 ⊢ (𝑥 ∈ dom 𝑅1 → (∀𝑦 ∈ 𝑥 (𝑦 ∈ dom 𝑅1 → (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) ↔ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)))
27		simplr 767	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑥 ∈ dom 𝑅1 ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑦 ∈ 𝑥)
28		ordelon 6395	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((Ord dom 𝑅1 ∧ 𝑥 ∈ dom 𝑅1) → 𝑥 ∈ On)
29	4, 28	mpan 688	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 ∈ dom 𝑅1 → 𝑥 ∈ On)
30	29	ad2antrr 724	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑥 ∈ dom 𝑅1 ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑥 ∈ On)
31		eloni 6381	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 ∈ On → Ord 𝑥)
32	30, 31	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑥 ∈ dom 𝑅1 ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → Ord 𝑥)
33		ordelsuc 7824	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑦 ∈ 𝑥 ∧ Ord 𝑥) → (𝑦 ∈ 𝑥 ↔ suc 𝑦 ⊆ 𝑥))
34	27, 32, 33	syl2anc 582	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑥 ∈ dom 𝑅1 ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → (𝑦 ∈ 𝑥 ↔ suc 𝑦 ⊆ 𝑥))
35	27, 34	mpbid 231	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑥 ∈ dom 𝑅1 ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → suc 𝑦 ⊆ 𝑥)
36	23	adantr 479	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑥 ∈ dom 𝑅1 ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑦 ∈ dom 𝑅1)
37		limsuc 7854	. . . . . . . . . . . . . . . . . . . 20 ⊢ (Lim dom 𝑅1 → (𝑦 ∈ dom 𝑅1 ↔ suc 𝑦 ∈ dom 𝑅1))
38	2, 37	ax-mp 5	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 ∈ dom 𝑅1 ↔ suc 𝑦 ∈ dom 𝑅1)
39	36, 38	sylib 217	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑥 ∈ dom 𝑅1 ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → suc 𝑦 ∈ dom 𝑅1)
40		simpll 765	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑥 ∈ dom 𝑅1 ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑥 ∈ dom 𝑅1)
41		r1ord3g 9804	. . . . . . . . . . . . . . . . . 18 ⊢ ((suc 𝑦 ∈ dom 𝑅1 ∧ 𝑥 ∈ dom 𝑅1) → (suc 𝑦 ⊆ 𝑥 → (𝑅1‘suc 𝑦) ⊆ (𝑅1‘𝑥)))
42	39, 40, 41	syl2anc 582	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑥 ∈ dom 𝑅1 ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → (suc 𝑦 ⊆ 𝑥 → (𝑅1‘suc 𝑦) ⊆ (𝑅1‘𝑥)))
43	35, 42	mpd 15	. . . . . . . . . . . . . . . 16 ⊢ (((𝑥 ∈ dom 𝑅1 ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → (𝑅1‘suc 𝑦) ⊆ (𝑅1‘𝑥))
44		rankidb 9825	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ∈ ∪ (𝑅1 “ On) → 𝑦 ∈ (𝑅1‘suc (rank‘𝑦)))
45	44	ad2antrl 726	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑥 ∈ dom 𝑅1 ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑦 ∈ (𝑅1‘suc (rank‘𝑦)))
46		suceq 6437	. . . . . . . . . . . . . . . . . . 19 ⊢ ((rank‘𝑦) = 𝑦 → suc (rank‘𝑦) = suc 𝑦)
47	46	ad2antll 727	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑥 ∈ dom 𝑅1 ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → suc (rank‘𝑦) = suc 𝑦)
48	47	fveq2d 6900	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑥 ∈ dom 𝑅1 ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → (𝑅1‘suc (rank‘𝑦)) = (𝑅1‘suc 𝑦))
49	45, 48	eleqtrd 2827	. . . . . . . . . . . . . . . 16 ⊢ (((𝑥 ∈ dom 𝑅1 ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑦 ∈ (𝑅1‘suc 𝑦))
50	43, 49	sseldd 3977	. . . . . . . . . . . . . . 15 ⊢ (((𝑥 ∈ dom 𝑅1 ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑦 ∈ (𝑅1‘𝑥))
51	50	ex 411	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ dom 𝑅1 ∧ 𝑦 ∈ 𝑥) → ((𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦) → 𝑦 ∈ (𝑅1‘𝑥)))
52	51	ralimdva 3156	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ dom 𝑅1 → (∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦) → ∀𝑦 ∈ 𝑥 𝑦 ∈ (𝑅1‘𝑥)))
53	52	imp 405	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ dom 𝑅1 ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → ∀𝑦 ∈ 𝑥 𝑦 ∈ (𝑅1‘𝑥))
54		dfss3 3965	. . . . . . . . . . . 12 ⊢ (𝑥 ⊆ (𝑅1‘𝑥) ↔ ∀𝑦 ∈ 𝑥 𝑦 ∈ (𝑅1‘𝑥))
55	53, 54	sylibr 233	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ dom 𝑅1 ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑥 ⊆ (𝑅1‘𝑥))
56		vex 3465	. . . . . . . . . . . 12 ⊢ 𝑥 ∈ V
57	56	elpw 4608	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝒫 (𝑅1‘𝑥) ↔ 𝑥 ⊆ (𝑅1‘𝑥))
58	55, 57	sylibr 233	. . . . . . . . . 10 ⊢ ((𝑥 ∈ dom 𝑅1 ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑥 ∈ 𝒫 (𝑅1‘𝑥))
59		r1sucg 9794	. . . . . . . . . . 11 ⊢ (𝑥 ∈ dom 𝑅1 → (𝑅1‘suc 𝑥) = 𝒫 (𝑅1‘𝑥))
60	59	adantr 479	. . . . . . . . . 10 ⊢ ((𝑥 ∈ dom 𝑅1 ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → (𝑅1‘suc 𝑥) = 𝒫 (𝑅1‘𝑥))
61	58, 60	eleqtrrd 2828	. . . . . . . . 9 ⊢ ((𝑥 ∈ dom 𝑅1 ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑥 ∈ (𝑅1‘suc 𝑥))
62		r1elwf 9821	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝑅1‘suc 𝑥) → 𝑥 ∈ ∪ (𝑅1 “ On))
63	61, 62	syl 17	. . . . . . . 8 ⊢ ((𝑥 ∈ dom 𝑅1 ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑥 ∈ ∪ (𝑅1 “ On))
64		rankval3b 9851	. . . . . . . . . 10 ⊢ (𝑥 ∈ ∪ (𝑅1 “ On) → (rank‘𝑥) = ∩ {𝑧 ∈ On ∣ ∀𝑦 ∈ 𝑥 (rank‘𝑦) ∈ 𝑧})
65	63, 64	syl 17	. . . . . . . . 9 ⊢ ((𝑥 ∈ dom 𝑅1 ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → (rank‘𝑥) = ∩ {𝑧 ∈ On ∣ ∀𝑦 ∈ 𝑥 (rank‘𝑦) ∈ 𝑧})
66		eleq1 2813	. . . . . . . . . . . . . . . 16 ⊢ ((rank‘𝑦) = 𝑦 → ((rank‘𝑦) ∈ 𝑧 ↔ 𝑦 ∈ 𝑧))
67	66	adantl 480	. . . . . . . . . . . . . . 15 ⊢ ((𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦) → ((rank‘𝑦) ∈ 𝑧 ↔ 𝑦 ∈ 𝑧))
68	67	ralimi 3072	. . . . . . . . . . . . . 14 ⊢ (∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦) → ∀𝑦 ∈ 𝑥 ((rank‘𝑦) ∈ 𝑧 ↔ 𝑦 ∈ 𝑧))
69		ralbi 3092	. . . . . . . . . . . . . 14 ⊢ (∀𝑦 ∈ 𝑥 ((rank‘𝑦) ∈ 𝑧 ↔ 𝑦 ∈ 𝑧) → (∀𝑦 ∈ 𝑥 (rank‘𝑦) ∈ 𝑧 ↔ ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑧))
70	68, 69	syl 17	. . . . . . . . . . . . 13 ⊢ (∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦) → (∀𝑦 ∈ 𝑥 (rank‘𝑦) ∈ 𝑧 ↔ ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑧))
71		dfss3 3965	. . . . . . . . . . . . 13 ⊢ (𝑥 ⊆ 𝑧 ↔ ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑧)
72	70, 71	bitr4di 288	. . . . . . . . . . . 12 ⊢ (∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦) → (∀𝑦 ∈ 𝑥 (rank‘𝑦) ∈ 𝑧 ↔ 𝑥 ⊆ 𝑧))
73	72	rabbidv 3426	. . . . . . . . . . 11 ⊢ (∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦) → {𝑧 ∈ On ∣ ∀𝑦 ∈ 𝑥 (rank‘𝑦) ∈ 𝑧} = {𝑧 ∈ On ∣ 𝑥 ⊆ 𝑧})
74	73	inteqd 4955	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦) → ∩ {𝑧 ∈ On ∣ ∀𝑦 ∈ 𝑥 (rank‘𝑦) ∈ 𝑧} = ∩ {𝑧 ∈ On ∣ 𝑥 ⊆ 𝑧})
75	74	adantl 480	. . . . . . . . 9 ⊢ ((𝑥 ∈ dom 𝑅1 ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → ∩ {𝑧 ∈ On ∣ ∀𝑦 ∈ 𝑥 (rank‘𝑦) ∈ 𝑧} = ∩ {𝑧 ∈ On ∣ 𝑥 ⊆ 𝑧})
76	29	adantr 479	. . . . . . . . . 10 ⊢ ((𝑥 ∈ dom 𝑅1 ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑥 ∈ On)
77		intmin 4972	. . . . . . . . . 10 ⊢ (𝑥 ∈ On → ∩ {𝑧 ∈ On ∣ 𝑥 ⊆ 𝑧} = 𝑥)
78	76, 77	syl 17	. . . . . . . . 9 ⊢ ((𝑥 ∈ dom 𝑅1 ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → ∩ {𝑧 ∈ On ∣ 𝑥 ⊆ 𝑧} = 𝑥)
79	65, 75, 78	3eqtrd 2769	. . . . . . . 8 ⊢ ((𝑥 ∈ dom 𝑅1 ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → (rank‘𝑥) = 𝑥)
80	63, 79	jca 510	. . . . . . 7 ⊢ ((𝑥 ∈ dom 𝑅1 ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → (𝑥 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑥) = 𝑥))
81	80	ex 411	. . . . . 6 ⊢ (𝑥 ∈ dom 𝑅1 → (∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦) → (𝑥 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑥) = 𝑥)))
82	26, 81	sylbid 239	. . . . 5 ⊢ (𝑥 ∈ dom 𝑅1 → (∀𝑦 ∈ 𝑥 (𝑦 ∈ dom 𝑅1 → (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → (𝑥 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑥) = 𝑥)))
83	82	com12 32	. . . 4 ⊢ (∀𝑦 ∈ 𝑥 (𝑦 ∈ dom 𝑅1 → (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → (𝑥 ∈ dom 𝑅1 → (𝑥 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑥) = 𝑥)))
84	83	a1i 11	. . 3 ⊢ (𝑥 ∈ On → (∀𝑦 ∈ 𝑥 (𝑦 ∈ dom 𝑅1 → (𝑦 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑦) = 𝑦)) → (𝑥 ∈ dom 𝑅1 → (𝑥 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝑥) = 𝑥))))
85	13, 20, 84	tfis3 7863	. 2 ⊢ (𝐴 ∈ On → (𝐴 ∈ dom 𝑅1 → (𝐴 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝐴) = 𝐴)))
86	6, 85	mpcom 38	1 ⊢ (𝐴 ∈ dom 𝑅1 → (𝐴 ∈ ∪ (𝑅1 “ On) ∧ (rank‘𝐴) = 𝐴))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 394   = wceq 1533   ∈ wcel 2098  ∀wral 3050  {crab 3418   ⊆ wss 3944  𝒫 cpw 4604  ∪ cuni 4909  ∩ cint 4950  dom cdm 5678   “ cima 5681  Ord word 6370  Oncon0 6371  Lim wlim 6372  suc csuc 6373  Fun wfun 6543  ‘cfv 6549  𝑅₁cr1 9787  rankcrnk 9788

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2166  ax-ext 2696  ax-sep 5300  ax-nul 5307  ax-pow 5365  ax-pr 5429  ax-un 7741

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3or 1085  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2703  df-cleq 2717  df-clel 2802  df-nfc 2877  df-ne 2930  df-ral 3051  df-rex 3060  df-reu 3364  df-rab 3419  df-v 3463  df-sbc 3774  df-csb 3890  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-pss 3964  df-nul 4323  df-if 4531  df-pw 4606  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4910  df-int 4951  df-iun 4999  df-br 5150  df-opab 5212  df-mpt 5233  df-tr 5267  df-id 5576  df-eprel 5582  df-po 5590  df-so 5591  df-fr 5633  df-we 5635  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-pred 6307  df-ord 6374  df-on 6375  df-lim 6376  df-suc 6377  df-iota 6501  df-fun 6551  df-fn 6552  df-f 6553  df-f1 6554  df-fo 6555  df-f1o 6556  df-fv 6557  df-ov 7422  df-om 7872  df-2nd 7995  df-frecs 8287  df-wrecs 8318  df-recs 8392  df-rdg 8431  df-r1 9789  df-rank 9790

This theorem is referenced by:  rankonid  9854  onwf  9855  onssr1  9856