rankonidlem - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > rankonidlem		Structured version Visualization version GIF version

Theorem rankonidlem 9826

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

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

Proof of Theorem rankonidlem Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		r1funlim 9764	. . . . 5 ⊢ (Fun 𝑅₁ ∧ Lim dom 𝑅₁)
2	1	simpri 485	. . . 4 ⊢ Lim dom 𝑅₁
3		limord 6425	. . . 4 ⊢ (Lim dom 𝑅₁ → Ord dom 𝑅₁)
4	2, 3	ax-mp 5	. . 3 ⊢ Ord dom 𝑅₁
5		ordelon 6389	. . 3 ⊢ ((Ord dom 𝑅₁ ∧ 𝐴 ∈ dom 𝑅₁) → 𝐴 ∈ On)
6	4, 5	mpan 687	. 2 ⊢ (𝐴 ∈ dom 𝑅₁ → 𝐴 ∈ On)
7		eleq1 2820	. . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ dom 𝑅₁ ↔ 𝑦 ∈ dom 𝑅₁))
8		eleq1 2820	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ ∪ (𝑅₁ “ On) ↔ 𝑦 ∈ ∪ (𝑅₁ “ On)))
9		fveq2 6892	. . . . . 6 ⊢ (𝑥 = 𝑦 → (rank‘𝑥) = (rank‘𝑦))
10		id 22	. . . . . 6 ⊢ (𝑥 = 𝑦 → 𝑥 = 𝑦)
11	9, 10	eqeq12d 2747	. . . . 5 ⊢ (𝑥 = 𝑦 → ((rank‘𝑥) = 𝑥 ↔ (rank‘𝑦) = 𝑦))
12	8, 11	anbi12d 630	. . . 4 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑥) = 𝑥) ↔ (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)))
13	7, 12	imbi12d 343	. . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ dom 𝑅₁ → (𝑥 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑥) = 𝑥)) ↔ (𝑦 ∈ dom 𝑅₁ → (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦))))
14		eleq1 2820	. . . 4 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ dom 𝑅₁ ↔ 𝐴 ∈ dom 𝑅₁))
15		eleq1 2820	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ ∪ (𝑅₁ “ On) ↔ 𝐴 ∈ ∪ (𝑅₁ “ On)))
16		fveq2 6892	. . . . . 6 ⊢ (𝑥 = 𝐴 → (rank‘𝑥) = (rank‘𝐴))
17		id 22	. . . . . 6 ⊢ (𝑥 = 𝐴 → 𝑥 = 𝐴)
18	16, 17	eqeq12d 2747	. . . . 5 ⊢ (𝑥 = 𝐴 → ((rank‘𝑥) = 𝑥 ↔ (rank‘𝐴) = 𝐴))
19	15, 18	anbi12d 630	. . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑥) = 𝑥) ↔ (𝐴 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝐴) = 𝐴)))
20	14, 19	imbi12d 343	. . 3 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ dom 𝑅₁ → (𝑥 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑥) = 𝑥)) ↔ (𝐴 ∈ dom 𝑅₁ → (𝐴 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝐴) = 𝐴))))
21		ordtr1 6408	. . . . . . . . . 10 ⊢ (Ord dom 𝑅₁ → ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ dom 𝑅₁) → 𝑦 ∈ dom 𝑅₁))
22	4, 21	ax-mp 5	. . . . . . . . 9 ⊢ ((𝑦 ∈ 𝑥 ∧ 𝑥 ∈ dom 𝑅₁) → 𝑦 ∈ dom 𝑅₁)
23	22	ancoms 458	. . . . . . . 8 ⊢ ((𝑥 ∈ dom 𝑅₁ ∧ 𝑦 ∈ 𝑥) → 𝑦 ∈ dom 𝑅₁)
24		pm5.5 360	. . . . . . . 8 ⊢ (𝑦 ∈ dom 𝑅₁ → ((𝑦 ∈ dom 𝑅₁ → (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) ↔ (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)))
25	23, 24	syl 17	. . . . . . 7 ⊢ ((𝑥 ∈ dom 𝑅₁ ∧ 𝑦 ∈ 𝑥) → ((𝑦 ∈ dom 𝑅₁ → (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) ↔ (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)))
26	25	ralbidva 3174	. . . . . 6 ⊢ (𝑥 ∈ dom 𝑅₁ → (∀𝑦 ∈ 𝑥 (𝑦 ∈ dom 𝑅₁ → (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) ↔ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)))
27		simplr 766	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑥 ∈ dom 𝑅₁ ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑦 ∈ 𝑥)
28		ordelon 6389	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ((Ord dom 𝑅₁ ∧ 𝑥 ∈ dom 𝑅₁) → 𝑥 ∈ On)
29	4, 28	mpan 687	. . . . . . . . . . . . . . . . . . . . 21 ⊢ (𝑥 ∈ dom 𝑅₁ → 𝑥 ∈ On)
30	29	ad2antrr 723	. . . . . . . . . . . . . . . . . . . 20 ⊢ (((𝑥 ∈ dom 𝑅₁ ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑥 ∈ On)
31		eloni 6375	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑥 ∈ On → Ord 𝑥)
32	30, 31	syl 17	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑥 ∈ dom 𝑅₁ ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → Ord 𝑥)
33		ordelsuc 7811	. . . . . . . . . . . . . . . . . . 19 ⊢ ((𝑦 ∈ 𝑥 ∧ Ord 𝑥) → (𝑦 ∈ 𝑥 ↔ suc 𝑦 ⊆ 𝑥))
34	27, 32, 33	syl2anc 583	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑥 ∈ dom 𝑅₁ ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → (𝑦 ∈ 𝑥 ↔ suc 𝑦 ⊆ 𝑥))
35	27, 34	mpbid 231	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑥 ∈ dom 𝑅₁ ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → suc 𝑦 ⊆ 𝑥)
36	23	adantr 480	. . . . . . . . . . . . . . . . . . 19 ⊢ (((𝑥 ∈ dom 𝑅₁ ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑦 ∈ dom 𝑅₁)
37		limsuc 7841	. . . . . . . . . . . . . . . . . . . 20 ⊢ (Lim dom 𝑅₁ → (𝑦 ∈ dom 𝑅₁ ↔ suc 𝑦 ∈ dom 𝑅₁))
38	2, 37	ax-mp 5	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑦 ∈ dom 𝑅₁ ↔ suc 𝑦 ∈ dom 𝑅₁)
39	36, 38	sylib 217	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑥 ∈ dom 𝑅₁ ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → suc 𝑦 ∈ dom 𝑅₁)
40		simpll 764	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑥 ∈ dom 𝑅₁ ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑥 ∈ dom 𝑅₁)
41		r1ord3g 9777	. . . . . . . . . . . . . . . . . 18 ⊢ ((suc 𝑦 ∈ dom 𝑅₁ ∧ 𝑥 ∈ dom 𝑅₁) → (suc 𝑦 ⊆ 𝑥 → (𝑅₁‘suc 𝑦) ⊆ (𝑅₁‘𝑥)))
42	39, 40, 41	syl2anc 583	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑥 ∈ dom 𝑅₁ ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → (suc 𝑦 ⊆ 𝑥 → (𝑅₁‘suc 𝑦) ⊆ (𝑅₁‘𝑥)))
43	35, 42	mpd 15	. . . . . . . . . . . . . . . 16 ⊢ (((𝑥 ∈ dom 𝑅₁ ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → (𝑅₁‘suc 𝑦) ⊆ (𝑅₁‘𝑥))
44		rankidb 9798	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑦 ∈ ∪ (𝑅₁ “ On) → 𝑦 ∈ (𝑅₁‘suc (rank‘𝑦)))
45	44	ad2antrl 725	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑥 ∈ dom 𝑅₁ ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑦 ∈ (𝑅₁‘suc (rank‘𝑦)))
46		suceq 6431	. . . . . . . . . . . . . . . . . . 19 ⊢ ((rank‘𝑦) = 𝑦 → suc (rank‘𝑦) = suc 𝑦)
47	46	ad2antll 726	. . . . . . . . . . . . . . . . . 18 ⊢ (((𝑥 ∈ dom 𝑅₁ ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → suc (rank‘𝑦) = suc 𝑦)
48	47	fveq2d 6896	. . . . . . . . . . . . . . . . 17 ⊢ (((𝑥 ∈ dom 𝑅₁ ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → (𝑅₁‘suc (rank‘𝑦)) = (𝑅₁‘suc 𝑦))
49	45, 48	eleqtrd 2834	. . . . . . . . . . . . . . . 16 ⊢ (((𝑥 ∈ dom 𝑅₁ ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑦 ∈ (𝑅₁‘suc 𝑦))
50	43, 49	sseldd 3984	. . . . . . . . . . . . . . 15 ⊢ (((𝑥 ∈ dom 𝑅₁ ∧ 𝑦 ∈ 𝑥) ∧ (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑦 ∈ (𝑅₁‘𝑥))
51	50	ex 412	. . . . . . . . . . . . . 14 ⊢ ((𝑥 ∈ dom 𝑅₁ ∧ 𝑦 ∈ 𝑥) → ((𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦) → 𝑦 ∈ (𝑅₁‘𝑥)))
52	51	ralimdva 3166	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ dom 𝑅₁ → (∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦) → ∀𝑦 ∈ 𝑥 𝑦 ∈ (𝑅₁‘𝑥)))
53	52	imp 406	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ dom 𝑅₁ ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → ∀𝑦 ∈ 𝑥 𝑦 ∈ (𝑅₁‘𝑥))
54		dfss3 3971	. . . . . . . . . . . 12 ⊢ (𝑥 ⊆ (𝑅₁‘𝑥) ↔ ∀𝑦 ∈ 𝑥 𝑦 ∈ (𝑅₁‘𝑥))
55	53, 54	sylibr 233	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ dom 𝑅₁ ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑥 ⊆ (𝑅₁‘𝑥))
56		vex 3477	. . . . . . . . . . . 12 ⊢ 𝑥 ∈ V
57	56	elpw 4607	. . . . . . . . . . 11 ⊢ (𝑥 ∈ 𝒫 (𝑅₁‘𝑥) ↔ 𝑥 ⊆ (𝑅₁‘𝑥))
58	55, 57	sylibr 233	. . . . . . . . . 10 ⊢ ((𝑥 ∈ dom 𝑅₁ ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑥 ∈ 𝒫 (𝑅₁‘𝑥))
59		r1sucg 9767	. . . . . . . . . . 11 ⊢ (𝑥 ∈ dom 𝑅₁ → (𝑅₁‘suc 𝑥) = 𝒫 (𝑅₁‘𝑥))
60	59	adantr 480	. . . . . . . . . 10 ⊢ ((𝑥 ∈ dom 𝑅₁ ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → (𝑅₁‘suc 𝑥) = 𝒫 (𝑅₁‘𝑥))
61	58, 60	eleqtrrd 2835	. . . . . . . . 9 ⊢ ((𝑥 ∈ dom 𝑅₁ ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑥 ∈ (𝑅₁‘suc 𝑥))
62		r1elwf 9794	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝑅₁‘suc 𝑥) → 𝑥 ∈ ∪ (𝑅₁ “ On))
63	61, 62	syl 17	. . . . . . . 8 ⊢ ((𝑥 ∈ dom 𝑅₁ ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑥 ∈ ∪ (𝑅₁ “ On))
64		rankval3b 9824	. . . . . . . . . 10 ⊢ (𝑥 ∈ ∪ (𝑅₁ “ On) → (rank‘𝑥) = ∩ {𝑧 ∈ On ∣ ∀𝑦 ∈ 𝑥 (rank‘𝑦) ∈ 𝑧})
65	63, 64	syl 17	. . . . . . . . 9 ⊢ ((𝑥 ∈ dom 𝑅₁ ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → (rank‘𝑥) = ∩ {𝑧 ∈ On ∣ ∀𝑦 ∈ 𝑥 (rank‘𝑦) ∈ 𝑧})
66		eleq1 2820	. . . . . . . . . . . . . . . 16 ⊢ ((rank‘𝑦) = 𝑦 → ((rank‘𝑦) ∈ 𝑧 ↔ 𝑦 ∈ 𝑧))
67	66	adantl 481	. . . . . . . . . . . . . . 15 ⊢ ((𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦) → ((rank‘𝑦) ∈ 𝑧 ↔ 𝑦 ∈ 𝑧))
68	67	ralimi 3082	. . . . . . . . . . . . . 14 ⊢ (∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦) → ∀𝑦 ∈ 𝑥 ((rank‘𝑦) ∈ 𝑧 ↔ 𝑦 ∈ 𝑧))
69		ralbi 3102	. . . . . . . . . . . . . 14 ⊢ (∀𝑦 ∈ 𝑥 ((rank‘𝑦) ∈ 𝑧 ↔ 𝑦 ∈ 𝑧) → (∀𝑦 ∈ 𝑥 (rank‘𝑦) ∈ 𝑧 ↔ ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑧))
70	68, 69	syl 17	. . . . . . . . . . . . 13 ⊢ (∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦) → (∀𝑦 ∈ 𝑥 (rank‘𝑦) ∈ 𝑧 ↔ ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑧))
71		dfss3 3971	. . . . . . . . . . . . 13 ⊢ (𝑥 ⊆ 𝑧 ↔ ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑧)
72	70, 71	bitr4di 288	. . . . . . . . . . . 12 ⊢ (∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦) → (∀𝑦 ∈ 𝑥 (rank‘𝑦) ∈ 𝑧 ↔ 𝑥 ⊆ 𝑧))
73	72	rabbidv 3439	. . . . . . . . . . 11 ⊢ (∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦) → {𝑧 ∈ On ∣ ∀𝑦 ∈ 𝑥 (rank‘𝑦) ∈ 𝑧} = {𝑧 ∈ On ∣ 𝑥 ⊆ 𝑧})
74	73	inteqd 4956	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦) → ∩ {𝑧 ∈ On ∣ ∀𝑦 ∈ 𝑥 (rank‘𝑦) ∈ 𝑧} = ∩ {𝑧 ∈ On ∣ 𝑥 ⊆ 𝑧})
75	74	adantl 481	. . . . . . . . 9 ⊢ ((𝑥 ∈ dom 𝑅₁ ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → ∩ {𝑧 ∈ On ∣ ∀𝑦 ∈ 𝑥 (rank‘𝑦) ∈ 𝑧} = ∩ {𝑧 ∈ On ∣ 𝑥 ⊆ 𝑧})
76	29	adantr 480	. . . . . . . . . 10 ⊢ ((𝑥 ∈ dom 𝑅₁ ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → 𝑥 ∈ On)
77		intmin 4973	. . . . . . . . . 10 ⊢ (𝑥 ∈ On → ∩ {𝑧 ∈ On ∣ 𝑥 ⊆ 𝑧} = 𝑥)
78	76, 77	syl 17	. . . . . . . . 9 ⊢ ((𝑥 ∈ dom 𝑅₁ ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → ∩ {𝑧 ∈ On ∣ 𝑥 ⊆ 𝑧} = 𝑥)
79	65, 75, 78	3eqtrd 2775	. . . . . . . 8 ⊢ ((𝑥 ∈ dom 𝑅₁ ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → (rank‘𝑥) = 𝑥)
80	63, 79	jca 511	. . . . . . 7 ⊢ ((𝑥 ∈ dom 𝑅₁ ∧ ∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → (𝑥 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑥) = 𝑥))
81	80	ex 412	. . . . . 6 ⊢ (𝑥 ∈ dom 𝑅₁ → (∀𝑦 ∈ 𝑥 (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦) → (𝑥 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑥) = 𝑥)))
82	26, 81	sylbid 239	. . . . 5 ⊢ (𝑥 ∈ dom 𝑅₁ → (∀𝑦 ∈ 𝑥 (𝑦 ∈ dom 𝑅₁ → (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → (𝑥 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑥) = 𝑥)))
83	82	com12 32	. . . 4 ⊢ (∀𝑦 ∈ 𝑥 (𝑦 ∈ dom 𝑅₁ → (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → (𝑥 ∈ dom 𝑅₁ → (𝑥 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑥) = 𝑥)))
84	83	a1i 11	. . 3 ⊢ (𝑥 ∈ On → (∀𝑦 ∈ 𝑥 (𝑦 ∈ dom 𝑅₁ → (𝑦 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑦) = 𝑦)) → (𝑥 ∈ dom 𝑅₁ → (𝑥 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝑥) = 𝑥))))
85	13, 20, 84	tfis3 7850	. 2 ⊢ (𝐴 ∈ On → (𝐴 ∈ dom 𝑅₁ → (𝐴 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝐴) = 𝐴)))
86	6, 85	mpcom 38	1 ⊢ (𝐴 ∈ dom 𝑅₁ → (𝐴 ∈ ∪ (𝑅₁ “ On) ∧ (rank‘𝐴) = 𝐴))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 = wceq 1540 ∈ wcel 2105 ∀wral 3060 {crab 3431 ⊆ wss 3949 𝒫 cpw 4603 ∪ cuni 4909 ∩ cint 4951 dom cdm 5677 “ cima 5680 Ord word 6364 Oncon0 6365 Lim wlim 6366 suc csuc 6367 Fun wfun 6538 ‘cfv 6544 𝑅₁cr1 9760 rankcrnk 9761

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 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7728

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-ral 3061 df-rex 3070 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-int 4952 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-ov 7415 df-om 7859 df-2nd 7979 df-frecs 8269 df-wrecs 8300 df-recs 8374 df-rdg 8413 df-r1 9762 df-rank 9763

This theorem is referenced by: rankonid 9827 onwf 9828 onssr1 9829

W3C validator