Theorem grur1 10743

Description: A characterization of Grothendieck universes, part 2. (Contributed by Mario Carneiro, 24-Jun-2013.)

Hypothesis

Ref	Expression
gruina.1	⊢ 𝐴 = (𝑈 ∩ On)

Assertion

Ref	Expression
grur1	⊢ ((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) → 𝑈 = (𝑅1‘𝐴))

Proof of Theorem grur1

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

Step	Hyp	Ref	Expression
1		nss 4000	. . . . 5 ⊢ (¬ 𝑈 ⊆ (𝑅1‘𝐴) ↔ ∃𝑥(𝑥 ∈ 𝑈 ∧ ¬ 𝑥 ∈ (𝑅1‘𝐴)))
2		fveqeq2 6851	. . . . . . . . . . 11 ⊢ (𝑦 = 𝑥 → ((rank‘𝑦) = 𝐴 ↔ (rank‘𝑥) = 𝐴))
3	2	rspcev 3578	. . . . . . . . . 10 ⊢ ((𝑥 ∈ 𝑈 ∧ (rank‘𝑥) = 𝐴) → ∃𝑦 ∈ 𝑈 (rank‘𝑦) = 𝐴)
4	3	ex 412	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝑈 → ((rank‘𝑥) = 𝐴 → ∃𝑦 ∈ 𝑈 (rank‘𝑦) = 𝐴))
5	4	ad2antrl 729	. . . . . . . 8 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑥 ∈ 𝑈 ∧ ¬ 𝑥 ∈ (𝑅1‘𝐴))) → ((rank‘𝑥) = 𝐴 → ∃𝑦 ∈ 𝑈 (rank‘𝑦) = 𝐴))
6		simplr 769	. . . . . . . . . . . 12 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑥 ∈ 𝑈 ∧ ¬ 𝑥 ∈ (𝑅1‘𝐴))) → 𝑈 ∈ ∪ (𝑅1 “ On))
7		simprl 771	. . . . . . . . . . . 12 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑥 ∈ 𝑈 ∧ ¬ 𝑥 ∈ (𝑅1‘𝐴))) → 𝑥 ∈ 𝑈)
8		r1elssi 9729	. . . . . . . . . . . . 13 ⊢ (𝑈 ∈ ∪ (𝑅1 “ On) → 𝑈 ⊆ ∪ (𝑅1 “ On))
9	8	sseld 3934	. . . . . . . . . . . 12 ⊢ (𝑈 ∈ ∪ (𝑅1 “ On) → (𝑥 ∈ 𝑈 → 𝑥 ∈ ∪ (𝑅1 “ On)))
10	6, 7, 9	sylc 65	. . . . . . . . . . 11 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑥 ∈ 𝑈 ∧ ¬ 𝑥 ∈ (𝑅1‘𝐴))) → 𝑥 ∈ ∪ (𝑅1 “ On))
11		tcrank 9808	. . . . . . . . . . 11 ⊢ (𝑥 ∈ ∪ (𝑅1 “ On) → (rank‘𝑥) = (rank “ (TC‘𝑥)))
12	10, 11	syl 17	. . . . . . . . . 10 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑥 ∈ 𝑈 ∧ ¬ 𝑥 ∈ (𝑅1‘𝐴))) → (rank‘𝑥) = (rank “ (TC‘𝑥)))
13	12	eleq2d 2823	. . . . . . . . 9 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑥 ∈ 𝑈 ∧ ¬ 𝑥 ∈ (𝑅1‘𝐴))) → (𝐴 ∈ (rank‘𝑥) ↔ 𝐴 ∈ (rank “ (TC‘𝑥))))
14		gruelss 10717	. . . . . . . . . . . 12 ⊢ ((𝑈 ∈ Univ ∧ 𝑥 ∈ 𝑈) → 𝑥 ⊆ 𝑈)
15		grutr 10716	. . . . . . . . . . . . 13 ⊢ (𝑈 ∈ Univ → Tr 𝑈)
16	15	adantr 480	. . . . . . . . . . . 12 ⊢ ((𝑈 ∈ Univ ∧ 𝑥 ∈ 𝑈) → Tr 𝑈)
17		vex 3446	. . . . . . . . . . . . 13 ⊢ 𝑥 ∈ V
18		tcmin 9660	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ V → ((𝑥 ⊆ 𝑈 ∧ Tr 𝑈) → (TC‘𝑥) ⊆ 𝑈))
19	17, 18	ax-mp 5	. . . . . . . . . . . 12 ⊢ ((𝑥 ⊆ 𝑈 ∧ Tr 𝑈) → (TC‘𝑥) ⊆ 𝑈)
20	14, 16, 19	syl2anc 585	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ Univ ∧ 𝑥 ∈ 𝑈) → (TC‘𝑥) ⊆ 𝑈)
21		rankf 9718	. . . . . . . . . . . . 13 ⊢ rank:∪ (𝑅1 “ On)⟶On
22		ffun 6673	. . . . . . . . . . . . 13 ⊢ (rank:∪ (𝑅1 “ On)⟶On → Fun rank)
23	21, 22	ax-mp 5	. . . . . . . . . . . 12 ⊢ Fun rank
24		fvelima 6907	. . . . . . . . . . . 12 ⊢ ((Fun rank ∧ 𝐴 ∈ (rank “ (TC‘𝑥))) → ∃𝑦 ∈ (TC‘𝑥)(rank‘𝑦) = 𝐴)
25	23, 24	mpan 691	. . . . . . . . . . 11 ⊢ (𝐴 ∈ (rank “ (TC‘𝑥)) → ∃𝑦 ∈ (TC‘𝑥)(rank‘𝑦) = 𝐴)
26		ssrexv 4005	. . . . . . . . . . 11 ⊢ ((TC‘𝑥) ⊆ 𝑈 → (∃𝑦 ∈ (TC‘𝑥)(rank‘𝑦) = 𝐴 → ∃𝑦 ∈ 𝑈 (rank‘𝑦) = 𝐴))
27	20, 25, 26	syl2im 40	. . . . . . . . . 10 ⊢ ((𝑈 ∈ Univ ∧ 𝑥 ∈ 𝑈) → (𝐴 ∈ (rank “ (TC‘𝑥)) → ∃𝑦 ∈ 𝑈 (rank‘𝑦) = 𝐴))
28	27	ad2ant2r 748	. . . . . . . . 9 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑥 ∈ 𝑈 ∧ ¬ 𝑥 ∈ (𝑅1‘𝐴))) → (𝐴 ∈ (rank “ (TC‘𝑥)) → ∃𝑦 ∈ 𝑈 (rank‘𝑦) = 𝐴))
29	13, 28	sylbid 240	. . . . . . . 8 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑥 ∈ 𝑈 ∧ ¬ 𝑥 ∈ (𝑅1‘𝐴))) → (𝐴 ∈ (rank‘𝑥) → ∃𝑦 ∈ 𝑈 (rank‘𝑦) = 𝐴))
30		simprr 773	. . . . . . . . . 10 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑥 ∈ 𝑈 ∧ ¬ 𝑥 ∈ (𝑅1‘𝐴))) → ¬ 𝑥 ∈ (𝑅1‘𝐴))
31		ne0i 4295	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ 𝑈 → 𝑈 ≠ ∅)
32		gruina.1	. . . . . . . . . . . . . . . 16 ⊢ 𝐴 = (𝑈 ∩ On)
33	32	gruina 10741	. . . . . . . . . . . . . . 15 ⊢ ((𝑈 ∈ Univ ∧ 𝑈 ≠ ∅) → 𝐴 ∈ Inacc)
34	31, 33	sylan2 594	. . . . . . . . . . . . . 14 ⊢ ((𝑈 ∈ Univ ∧ 𝑥 ∈ 𝑈) → 𝐴 ∈ Inacc)
35		inawina 10613	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ Inacc → 𝐴 ∈ Inaccw)
36		winaon 10611	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ Inaccw → 𝐴 ∈ On)
37	34, 35, 36	3syl 18	. . . . . . . . . . . . 13 ⊢ ((𝑈 ∈ Univ ∧ 𝑥 ∈ 𝑈) → 𝐴 ∈ On)
38		r1fnon 9691	. . . . . . . . . . . . . 14 ⊢ 𝑅1 Fn On
39		fndm 6603	. . . . . . . . . . . . . 14 ⊢ (𝑅1 Fn On → dom 𝑅1 = On)
40	38, 39	ax-mp 5	. . . . . . . . . . . . 13 ⊢ dom 𝑅1 = On
41	37, 40	eleqtrrdi 2848	. . . . . . . . . . . 12 ⊢ ((𝑈 ∈ Univ ∧ 𝑥 ∈ 𝑈) → 𝐴 ∈ dom 𝑅1)
42	41	ad2ant2r 748	. . . . . . . . . . 11 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑥 ∈ 𝑈 ∧ ¬ 𝑥 ∈ (𝑅1‘𝐴))) → 𝐴 ∈ dom 𝑅1)
43		rankr1ag 9726	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ∪ (𝑅1 “ On) ∧ 𝐴 ∈ dom 𝑅1) → (𝑥 ∈ (𝑅1‘𝐴) ↔ (rank‘𝑥) ∈ 𝐴))
44	10, 42, 43	syl2anc 585	. . . . . . . . . 10 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑥 ∈ 𝑈 ∧ ¬ 𝑥 ∈ (𝑅1‘𝐴))) → (𝑥 ∈ (𝑅1‘𝐴) ↔ (rank‘𝑥) ∈ 𝐴))
45	30, 44	mtbid 324	. . . . . . . . 9 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑥 ∈ 𝑈 ∧ ¬ 𝑥 ∈ (𝑅1‘𝐴))) → ¬ (rank‘𝑥) ∈ 𝐴)
46		rankon 9719	. . . . . . . . . . . . 13 ⊢ (rank‘𝑥) ∈ On
47		eloni 6335	. . . . . . . . . . . . . 14 ⊢ ((rank‘𝑥) ∈ On → Ord (rank‘𝑥))
48		eloni 6335	. . . . . . . . . . . . . 14 ⊢ (𝐴 ∈ On → Ord 𝐴)
49		ordtri3or 6357	. . . . . . . . . . . . . 14 ⊢ ((Ord (rank‘𝑥) ∧ Ord 𝐴) → ((rank‘𝑥) ∈ 𝐴 ∨ (rank‘𝑥) = 𝐴 ∨ 𝐴 ∈ (rank‘𝑥)))
50	47, 48, 49	syl2an 597	. . . . . . . . . . . . 13 ⊢ (((rank‘𝑥) ∈ On ∧ 𝐴 ∈ On) → ((rank‘𝑥) ∈ 𝐴 ∨ (rank‘𝑥) = 𝐴 ∨ 𝐴 ∈ (rank‘𝑥)))
51	46, 37, 50	sylancr 588	. . . . . . . . . . . 12 ⊢ ((𝑈 ∈ Univ ∧ 𝑥 ∈ 𝑈) → ((rank‘𝑥) ∈ 𝐴 ∨ (rank‘𝑥) = 𝐴 ∨ 𝐴 ∈ (rank‘𝑥)))
52		3orass 1090	. . . . . . . . . . . 12 ⊢ (((rank‘𝑥) ∈ 𝐴 ∨ (rank‘𝑥) = 𝐴 ∨ 𝐴 ∈ (rank‘𝑥)) ↔ ((rank‘𝑥) ∈ 𝐴 ∨ ((rank‘𝑥) = 𝐴 ∨ 𝐴 ∈ (rank‘𝑥))))
53	51, 52	sylib 218	. . . . . . . . . . 11 ⊢ ((𝑈 ∈ Univ ∧ 𝑥 ∈ 𝑈) → ((rank‘𝑥) ∈ 𝐴 ∨ ((rank‘𝑥) = 𝐴 ∨ 𝐴 ∈ (rank‘𝑥))))
54	53	ord 865	. . . . . . . . . 10 ⊢ ((𝑈 ∈ Univ ∧ 𝑥 ∈ 𝑈) → (¬ (rank‘𝑥) ∈ 𝐴 → ((rank‘𝑥) = 𝐴 ∨ 𝐴 ∈ (rank‘𝑥))))
55	54	ad2ant2r 748	. . . . . . . . 9 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑥 ∈ 𝑈 ∧ ¬ 𝑥 ∈ (𝑅1‘𝐴))) → (¬ (rank‘𝑥) ∈ 𝐴 → ((rank‘𝑥) = 𝐴 ∨ 𝐴 ∈ (rank‘𝑥))))
56	45, 55	mpd 15	. . . . . . . 8 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑥 ∈ 𝑈 ∧ ¬ 𝑥 ∈ (𝑅1‘𝐴))) → ((rank‘𝑥) = 𝐴 ∨ 𝐴 ∈ (rank‘𝑥)))
57	5, 29, 56	mpjaod 861	. . . . . . 7 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑥 ∈ 𝑈 ∧ ¬ 𝑥 ∈ (𝑅1‘𝐴))) → ∃𝑦 ∈ 𝑈 (rank‘𝑦) = 𝐴)
58	57	ex 412	. . . . . 6 ⊢ ((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) → ((𝑥 ∈ 𝑈 ∧ ¬ 𝑥 ∈ (𝑅1‘𝐴)) → ∃𝑦 ∈ 𝑈 (rank‘𝑦) = 𝐴))
59	58	exlimdv 1935	. . . . 5 ⊢ ((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) → (∃𝑥(𝑥 ∈ 𝑈 ∧ ¬ 𝑥 ∈ (𝑅1‘𝐴)) → ∃𝑦 ∈ 𝑈 (rank‘𝑦) = 𝐴))
60	1, 59	biimtrid 242	. . . 4 ⊢ ((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) → (¬ 𝑈 ⊆ (𝑅1‘𝐴) → ∃𝑦 ∈ 𝑈 (rank‘𝑦) = 𝐴))
61		simpll 767	. . . . . . 7 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑦 ∈ 𝑈 ∧ (rank‘𝑦) = 𝐴)) → 𝑈 ∈ Univ)
62		ne0i 4295	. . . . . . . . . 10 ⊢ (𝑦 ∈ 𝑈 → 𝑈 ≠ ∅)
63	62, 33	sylan2 594	. . . . . . . . 9 ⊢ ((𝑈 ∈ Univ ∧ 𝑦 ∈ 𝑈) → 𝐴 ∈ Inacc)
64	63	ad2ant2r 748	. . . . . . . 8 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑦 ∈ 𝑈 ∧ (rank‘𝑦) = 𝐴)) → 𝐴 ∈ Inacc)
65	64, 35, 36	3syl 18	. . . . . . 7 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑦 ∈ 𝑈 ∧ (rank‘𝑦) = 𝐴)) → 𝐴 ∈ On)
66		simprl 771	. . . . . . 7 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑦 ∈ 𝑈 ∧ (rank‘𝑦) = 𝐴)) → 𝑦 ∈ 𝑈)
67		fveq2 6842	. . . . . . . . . 10 ⊢ ((rank‘𝑦) = 𝐴 → (cf‘(rank‘𝑦)) = (cf‘𝐴))
68	67	ad2antll 730	. . . . . . . . 9 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑦 ∈ 𝑈 ∧ (rank‘𝑦) = 𝐴)) → (cf‘(rank‘𝑦)) = (cf‘𝐴))
69		elina 10610	. . . . . . . . . . 11 ⊢ (𝐴 ∈ Inacc ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝒫 𝑥 ≺ 𝐴))
70	69	simp2bi 1147	. . . . . . . . . 10 ⊢ (𝐴 ∈ Inacc → (cf‘𝐴) = 𝐴)
71	64, 70	syl 17	. . . . . . . . 9 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑦 ∈ 𝑈 ∧ (rank‘𝑦) = 𝐴)) → (cf‘𝐴) = 𝐴)
72	68, 71	eqtrd 2772	. . . . . . . 8 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑦 ∈ 𝑈 ∧ (rank‘𝑦) = 𝐴)) → (cf‘(rank‘𝑦)) = 𝐴)
73		rankcf 10700	. . . . . . . . 9 ⊢ ¬ 𝑦 ≺ (cf‘(rank‘𝑦))
74		fvex 6855	. . . . . . . . . 10 ⊢ (cf‘(rank‘𝑦)) ∈ V
75		vex 3446	. . . . . . . . . 10 ⊢ 𝑦 ∈ V
76		domtri 10478	. . . . . . . . . 10 ⊢ (((cf‘(rank‘𝑦)) ∈ V ∧ 𝑦 ∈ V) → ((cf‘(rank‘𝑦)) ≼ 𝑦 ↔ ¬ 𝑦 ≺ (cf‘(rank‘𝑦))))
77	74, 75, 76	mp2an 693	. . . . . . . . 9 ⊢ ((cf‘(rank‘𝑦)) ≼ 𝑦 ↔ ¬ 𝑦 ≺ (cf‘(rank‘𝑦)))
78	73, 77	mpbir 231	. . . . . . . 8 ⊢ (cf‘(rank‘𝑦)) ≼ 𝑦
79	72, 78	eqbrtrrdi 5140	. . . . . . 7 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑦 ∈ 𝑈 ∧ (rank‘𝑦) = 𝐴)) → 𝐴 ≼ 𝑦)
80		grudomon 10740	. . . . . . 7 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ On ∧ (𝑦 ∈ 𝑈 ∧ 𝐴 ≼ 𝑦)) → 𝐴 ∈ 𝑈)
81	61, 65, 66, 79, 80	syl112anc 1377	. . . . . 6 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑦 ∈ 𝑈 ∧ (rank‘𝑦) = 𝐴)) → 𝐴 ∈ 𝑈)
82		elin 3919	. . . . . . . . 9 ⊢ (𝐴 ∈ (𝑈 ∩ On) ↔ (𝐴 ∈ 𝑈 ∧ 𝐴 ∈ On))
83	82	biimpri 228	. . . . . . . 8 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐴 ∈ On) → 𝐴 ∈ (𝑈 ∩ On))
84	83, 32	eleqtrrdi 2848	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐴 ∈ On) → 𝐴 ∈ 𝐴)
85		ordirr 6343	. . . . . . . . 9 ⊢ (Ord 𝐴 → ¬ 𝐴 ∈ 𝐴)
86	48, 85	syl 17	. . . . . . . 8 ⊢ (𝐴 ∈ On → ¬ 𝐴 ∈ 𝐴)
87	86	adantl 481	. . . . . . 7 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐴 ∈ On) → ¬ 𝐴 ∈ 𝐴)
88	84, 87	pm2.21dd 195	. . . . . 6 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐴 ∈ On) → 𝑈 ⊆ (𝑅1‘𝐴))
89	81, 65, 88	syl2anc 585	. . . . 5 ⊢ (((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) ∧ (𝑦 ∈ 𝑈 ∧ (rank‘𝑦) = 𝐴)) → 𝑈 ⊆ (𝑅1‘𝐴))
90	89	rexlimdvaa 3140	. . . 4 ⊢ ((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) → (∃𝑦 ∈ 𝑈 (rank‘𝑦) = 𝐴 → 𝑈 ⊆ (𝑅1‘𝐴)))
91	60, 90	syld 47	. . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) → (¬ 𝑈 ⊆ (𝑅1‘𝐴) → 𝑈 ⊆ (𝑅1‘𝐴)))
92	91	pm2.18d 127	. 2 ⊢ ((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) → 𝑈 ⊆ (𝑅1‘𝐴))
93	32	grur1a 10742	. . 3 ⊢ (𝑈 ∈ Univ → (𝑅1‘𝐴) ⊆ 𝑈)
94	93	adantr 480	. 2 ⊢ ((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) → (𝑅1‘𝐴) ⊆ 𝑈)
95	92, 94	eqssd 3953	1 ⊢ ((𝑈 ∈ Univ ∧ 𝑈 ∈ ∪ (𝑅1 “ On)) → 𝑈 = (𝑅1‘𝐴))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∨ wo 848   ∨ w3o 1086   = wceq 1542  ∃wex 1781   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  ∃wrex 3062  Vcvv 3442   ∩ cin 3902   ⊆ wss 3903  ∅c0 4287  𝒫 cpw 4556  ∪ cuni 4865   class class class wbr 5100  Tr wtr 5207  dom cdm 5632   “ cima 5635  Ord word 6324  Oncon0 6325  Fun wfun 6494   Fn wfn 6495  ⟶wf 6496  ‘cfv 6500   ≼ cdom 8893   ≺ csdm 8894  TCctc 9655  𝑅₁cr1 9686  rankcrnk 9687  cfccf 9861  Inacc_wcwina 10605  Inacccina 10606  Univcgru 10713

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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-inf2 9562  ax-ac2 10385

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-iin 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-se 5586  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-isom 6509  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-1o 8407  df-er 8645  df-map 8777  df-en 8896  df-dom 8897  df-sdom 8898  df-fin 8899  df-tc 9656  df-r1 9688  df-rank 9689  df-card 9863  df-cf 9865  df-acn 9866  df-ac 10038  df-wina 10607  df-ina 10608  df-gru 10714

This theorem is referenced by:  grutsk  10745  bj-grur1  37308  grurankcld  44586