inatsk - Metamath Proof Explorer

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

Theorem inatsk 10773

Description: (𝑅₁‘𝐴) for 𝐴 a strongly inaccessible cardinal is a Tarski class. (Contributed by Mario Carneiro, 8-Jun-2013.)

**Assertion**
Ref	Expression
inatsk	⊢ (𝐴 ∈ Inacc → (𝑅₁‘𝐴) ∈ Tarski)

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

Step	Hyp	Ref	Expression
1		inawina 10685	. . . . . 6 ⊢ (𝐴 ∈ Inacc → 𝐴 ∈ Inacc_w)
2		winaon 10683	. . . . . . . . . 10 ⊢ (𝐴 ∈ Inacc_w → 𝐴 ∈ On)
3		winalim 10690	. . . . . . . . . 10 ⊢ (𝐴 ∈ Inacc_w → Lim 𝐴)
4		r1lim 9767	. . . . . . . . . 10 ⊢ ((𝐴 ∈ On ∧ Lim 𝐴) → (𝑅₁‘𝐴) = ∪ 𝑦 ∈ 𝐴 (𝑅₁‘𝑦))
5	2, 3, 4	syl2anc 585	. . . . . . . . 9 ⊢ (𝐴 ∈ Inacc_w → (𝑅₁‘𝐴) = ∪ 𝑦 ∈ 𝐴 (𝑅₁‘𝑦))
6	5	eleq2d 2820	. . . . . . . 8 ⊢ (𝐴 ∈ Inacc_w → (𝑥 ∈ (𝑅₁‘𝐴) ↔ 𝑥 ∈ ∪ 𝑦 ∈ 𝐴 (𝑅₁‘𝑦)))
7		eliun 5002	. . . . . . . 8 ⊢ (𝑥 ∈ ∪ 𝑦 ∈ 𝐴 (𝑅₁‘𝑦) ↔ ∃𝑦 ∈ 𝐴 𝑥 ∈ (𝑅₁‘𝑦))
8	6, 7	bitrdi 287	. . . . . . 7 ⊢ (𝐴 ∈ Inacc_w → (𝑥 ∈ (𝑅₁‘𝐴) ↔ ∃𝑦 ∈ 𝐴 𝑥 ∈ (𝑅₁‘𝑦)))
9		onelon 6390	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ On ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ On)
10	2, 9	sylan 581	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Inacc_w ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ On)
11		r1pw 9840	. . . . . . . . . 10 ⊢ (𝑦 ∈ On → (𝑥 ∈ (𝑅₁‘𝑦) ↔ 𝒫 𝑥 ∈ (𝑅₁‘suc 𝑦)))
12	10, 11	syl 17	. . . . . . . . 9 ⊢ ((𝐴 ∈ Inacc_w ∧ 𝑦 ∈ 𝐴) → (𝑥 ∈ (𝑅₁‘𝑦) ↔ 𝒫 𝑥 ∈ (𝑅₁‘suc 𝑦)))
13		limsuc 7838	. . . . . . . . . . . . 13 ⊢ (Lim 𝐴 → (𝑦 ∈ 𝐴 ↔ suc 𝑦 ∈ 𝐴))
14	3, 13	syl 17	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ Inacc_w → (𝑦 ∈ 𝐴 ↔ suc 𝑦 ∈ 𝐴))
15		r1ord2 9776	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ On → (suc 𝑦 ∈ 𝐴 → (𝑅₁‘suc 𝑦) ⊆ (𝑅₁‘𝐴)))
16	2, 15	syl 17	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ Inacc_w → (suc 𝑦 ∈ 𝐴 → (𝑅₁‘suc 𝑦) ⊆ (𝑅₁‘𝐴)))
17	14, 16	sylbid 239	. . . . . . . . . . 11 ⊢ (𝐴 ∈ Inacc_w → (𝑦 ∈ 𝐴 → (𝑅₁‘suc 𝑦) ⊆ (𝑅₁‘𝐴)))
18	17	imp 408	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Inacc_w ∧ 𝑦 ∈ 𝐴) → (𝑅₁‘suc 𝑦) ⊆ (𝑅₁‘𝐴))
19	18	sseld 3982	. . . . . . . . 9 ⊢ ((𝐴 ∈ Inacc_w ∧ 𝑦 ∈ 𝐴) → (𝒫 𝑥 ∈ (𝑅₁‘suc 𝑦) → 𝒫 𝑥 ∈ (𝑅₁‘𝐴)))
20	12, 19	sylbid 239	. . . . . . . 8 ⊢ ((𝐴 ∈ Inacc_w ∧ 𝑦 ∈ 𝐴) → (𝑥 ∈ (𝑅₁‘𝑦) → 𝒫 𝑥 ∈ (𝑅₁‘𝐴)))
21	20	rexlimdva 3156	. . . . . . 7 ⊢ (𝐴 ∈ Inacc_w → (∃𝑦 ∈ 𝐴 𝑥 ∈ (𝑅₁‘𝑦) → 𝒫 𝑥 ∈ (𝑅₁‘𝐴)))
22	8, 21	sylbid 239	. . . . . 6 ⊢ (𝐴 ∈ Inacc_w → (𝑥 ∈ (𝑅₁‘𝐴) → 𝒫 𝑥 ∈ (𝑅₁‘𝐴)))
23	1, 22	syl 17	. . . . 5 ⊢ (𝐴 ∈ Inacc → (𝑥 ∈ (𝑅₁‘𝐴) → 𝒫 𝑥 ∈ (𝑅₁‘𝐴)))
24	23	imp 408	. . . 4 ⊢ ((𝐴 ∈ Inacc ∧ 𝑥 ∈ (𝑅₁‘𝐴)) → 𝒫 𝑥 ∈ (𝑅₁‘𝐴))
25		elssuni 4942	. . . . 5 ⊢ (𝒫 𝑥 ∈ (𝑅₁‘𝐴) → 𝒫 𝑥 ⊆ ∪ (𝑅₁‘𝐴))
26		r1tr2 9772	. . . . 5 ⊢ ∪ (𝑅₁‘𝐴) ⊆ (𝑅₁‘𝐴)
27	25, 26	sstrdi 3995	. . . 4 ⊢ (𝒫 𝑥 ∈ (𝑅₁‘𝐴) → 𝒫 𝑥 ⊆ (𝑅₁‘𝐴))
28	24, 27	jccil 524	. . 3 ⊢ ((𝐴 ∈ Inacc ∧ 𝑥 ∈ (𝑅₁‘𝐴)) → (𝒫 𝑥 ⊆ (𝑅₁‘𝐴) ∧ 𝒫 𝑥 ∈ (𝑅₁‘𝐴)))
29	28	ralrimiva 3147	. 2 ⊢ (𝐴 ∈ Inacc → ∀𝑥 ∈ (𝑅₁‘𝐴)(𝒫 𝑥 ⊆ (𝑅₁‘𝐴) ∧ 𝒫 𝑥 ∈ (𝑅₁‘𝐴)))
30	1, 2	syl 17	. . . . . . . . 9 ⊢ (𝐴 ∈ Inacc → 𝐴 ∈ On)
31		r1suc 9765	. . . . . . . . . 10 ⊢ (𝐴 ∈ On → (𝑅₁‘suc 𝐴) = 𝒫 (𝑅₁‘𝐴))
32	31	eleq2d 2820	. . . . . . . . 9 ⊢ (𝐴 ∈ On → (𝑥 ∈ (𝑅₁‘suc 𝐴) ↔ 𝑥 ∈ 𝒫 (𝑅₁‘𝐴)))
33	30, 32	syl 17	. . . . . . . 8 ⊢ (𝐴 ∈ Inacc → (𝑥 ∈ (𝑅₁‘suc 𝐴) ↔ 𝑥 ∈ 𝒫 (𝑅₁‘𝐴)))
34		rankr1ai 9793	. . . . . . . 8 ⊢ (𝑥 ∈ (𝑅₁‘suc 𝐴) → (rank‘𝑥) ∈ suc 𝐴)
35	33, 34	syl6bir 254	. . . . . . 7 ⊢ (𝐴 ∈ Inacc → (𝑥 ∈ 𝒫 (𝑅₁‘𝐴) → (rank‘𝑥) ∈ suc 𝐴))
36	35	imp 408	. . . . . 6 ⊢ ((𝐴 ∈ Inacc ∧ 𝑥 ∈ 𝒫 (𝑅₁‘𝐴)) → (rank‘𝑥) ∈ suc 𝐴)
37		fvex 6905	. . . . . . 7 ⊢ (rank‘𝑥) ∈ V
38	37	elsuc 6435	. . . . . 6 ⊢ ((rank‘𝑥) ∈ suc 𝐴 ↔ ((rank‘𝑥) ∈ 𝐴 ∨ (rank‘𝑥) = 𝐴))
39	36, 38	sylib 217	. . . . 5 ⊢ ((𝐴 ∈ Inacc ∧ 𝑥 ∈ 𝒫 (𝑅₁‘𝐴)) → ((rank‘𝑥) ∈ 𝐴 ∨ (rank‘𝑥) = 𝐴))
40	39	orcomd 870	. . . 4 ⊢ ((𝐴 ∈ Inacc ∧ 𝑥 ∈ 𝒫 (𝑅₁‘𝐴)) → ((rank‘𝑥) = 𝐴 ∨ (rank‘𝑥) ∈ 𝐴))
41		fvex 6905	. . . . . . . 8 ⊢ (𝑅₁‘𝐴) ∈ V
42		elpwi 4610	. . . . . . . . 9 ⊢ (𝑥 ∈ 𝒫 (𝑅₁‘𝐴) → 𝑥 ⊆ (𝑅₁‘𝐴))
43	42	ad2antlr 726	. . . . . . . 8 ⊢ (((𝐴 ∈ Inacc ∧ 𝑥 ∈ 𝒫 (𝑅₁‘𝐴)) ∧ (rank‘𝑥) = 𝐴) → 𝑥 ⊆ (𝑅₁‘𝐴))
44		ssdomg 8996	. . . . . . . 8 ⊢ ((𝑅₁‘𝐴) ∈ V → (𝑥 ⊆ (𝑅₁‘𝐴) → 𝑥 ≼ (𝑅₁‘𝐴)))
45	41, 43, 44	mpsyl 68	. . . . . . 7 ⊢ (((𝐴 ∈ Inacc ∧ 𝑥 ∈ 𝒫 (𝑅₁‘𝐴)) ∧ (rank‘𝑥) = 𝐴) → 𝑥 ≼ (𝑅₁‘𝐴))
46		rankcf 10772	. . . . . . . . . 10 ⊢ ¬ 𝑥 ≺ (cf‘(rank‘𝑥))
47		fveq2 6892	. . . . . . . . . . . 12 ⊢ ((rank‘𝑥) = 𝐴 → (cf‘(rank‘𝑥)) = (cf‘𝐴))
48		elina 10682	. . . . . . . . . . . . 13 ⊢ (𝐴 ∈ Inacc ↔ (𝐴 ≠ ∅ ∧ (cf‘𝐴) = 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝒫 𝑥 ≺ 𝐴))
49	48	simp2bi 1147	. . . . . . . . . . . 12 ⊢ (𝐴 ∈ Inacc → (cf‘𝐴) = 𝐴)
50	47, 49	sylan9eqr 2795	. . . . . . . . . . 11 ⊢ ((𝐴 ∈ Inacc ∧ (rank‘𝑥) = 𝐴) → (cf‘(rank‘𝑥)) = 𝐴)
51	50	breq2d 5161	. . . . . . . . . 10 ⊢ ((𝐴 ∈ Inacc ∧ (rank‘𝑥) = 𝐴) → (𝑥 ≺ (cf‘(rank‘𝑥)) ↔ 𝑥 ≺ 𝐴))
52	46, 51	mtbii 326	. . . . . . . . 9 ⊢ ((𝐴 ∈ Inacc ∧ (rank‘𝑥) = 𝐴) → ¬ 𝑥 ≺ 𝐴)
53		inar1 10770	. . . . . . . . . . 11 ⊢ (𝐴 ∈ Inacc → (𝑅₁‘𝐴) ≈ 𝐴)
54		sdomentr 9111	. . . . . . . . . . . 12 ⊢ ((𝑥 ≺ (𝑅₁‘𝐴) ∧ (𝑅₁‘𝐴) ≈ 𝐴) → 𝑥 ≺ 𝐴)
55	54	expcom 415	. . . . . . . . . . 11 ⊢ ((𝑅₁‘𝐴) ≈ 𝐴 → (𝑥 ≺ (𝑅₁‘𝐴) → 𝑥 ≺ 𝐴))
56	53, 55	syl 17	. . . . . . . . . 10 ⊢ (𝐴 ∈ Inacc → (𝑥 ≺ (𝑅₁‘𝐴) → 𝑥 ≺ 𝐴))
57	56	adantr 482	. . . . . . . . 9 ⊢ ((𝐴 ∈ Inacc ∧ (rank‘𝑥) = 𝐴) → (𝑥 ≺ (𝑅₁‘𝐴) → 𝑥 ≺ 𝐴))
58	52, 57	mtod 197	. . . . . . . 8 ⊢ ((𝐴 ∈ Inacc ∧ (rank‘𝑥) = 𝐴) → ¬ 𝑥 ≺ (𝑅₁‘𝐴))
59	58	adantlr 714	. . . . . . 7 ⊢ (((𝐴 ∈ Inacc ∧ 𝑥 ∈ 𝒫 (𝑅₁‘𝐴)) ∧ (rank‘𝑥) = 𝐴) → ¬ 𝑥 ≺ (𝑅₁‘𝐴))
60		bren2 8979	. . . . . . 7 ⊢ (𝑥 ≈ (𝑅₁‘𝐴) ↔ (𝑥 ≼ (𝑅₁‘𝐴) ∧ ¬ 𝑥 ≺ (𝑅₁‘𝐴)))
61	45, 59, 60	sylanbrc 584	. . . . . 6 ⊢ (((𝐴 ∈ Inacc ∧ 𝑥 ∈ 𝒫 (𝑅₁‘𝐴)) ∧ (rank‘𝑥) = 𝐴) → 𝑥 ≈ (𝑅₁‘𝐴))
62	61	ex 414	. . . . 5 ⊢ ((𝐴 ∈ Inacc ∧ 𝑥 ∈ 𝒫 (𝑅₁‘𝐴)) → ((rank‘𝑥) = 𝐴 → 𝑥 ≈ (𝑅₁‘𝐴)))
63		r1elwf 9791	. . . . . . . . 9 ⊢ (𝑥 ∈ (𝑅₁‘suc 𝐴) → 𝑥 ∈ ∪ (𝑅₁ “ On))
64	33, 63	syl6bir 254	. . . . . . . 8 ⊢ (𝐴 ∈ Inacc → (𝑥 ∈ 𝒫 (𝑅₁‘𝐴) → 𝑥 ∈ ∪ (𝑅₁ “ On)))
65	64	imp 408	. . . . . . 7 ⊢ ((𝐴 ∈ Inacc ∧ 𝑥 ∈ 𝒫 (𝑅₁‘𝐴)) → 𝑥 ∈ ∪ (𝑅₁ “ On))
66		r1fnon 9762	. . . . . . . . . 10 ⊢ 𝑅₁ Fn On
67	66	fndmi 6654	. . . . . . . . 9 ⊢ dom 𝑅₁ = On
68	30, 67	eleqtrrdi 2845	. . . . . . . 8 ⊢ (𝐴 ∈ Inacc → 𝐴 ∈ dom 𝑅₁)
69	68	adantr 482	. . . . . . 7 ⊢ ((𝐴 ∈ Inacc ∧ 𝑥 ∈ 𝒫 (𝑅₁‘𝐴)) → 𝐴 ∈ dom 𝑅₁)
70		rankr1ag 9797	. . . . . . 7 ⊢ ((𝑥 ∈ ∪ (𝑅₁ “ On) ∧ 𝐴 ∈ dom 𝑅₁) → (𝑥 ∈ (𝑅₁‘𝐴) ↔ (rank‘𝑥) ∈ 𝐴))
71	65, 69, 70	syl2anc 585	. . . . . 6 ⊢ ((𝐴 ∈ Inacc ∧ 𝑥 ∈ 𝒫 (𝑅₁‘𝐴)) → (𝑥 ∈ (𝑅₁‘𝐴) ↔ (rank‘𝑥) ∈ 𝐴))
72	71	biimprd 247	. . . . 5 ⊢ ((𝐴 ∈ Inacc ∧ 𝑥 ∈ 𝒫 (𝑅₁‘𝐴)) → ((rank‘𝑥) ∈ 𝐴 → 𝑥 ∈ (𝑅₁‘𝐴)))
73	62, 72	orim12d 964	. . . 4 ⊢ ((𝐴 ∈ Inacc ∧ 𝑥 ∈ 𝒫 (𝑅₁‘𝐴)) → (((rank‘𝑥) = 𝐴 ∨ (rank‘𝑥) ∈ 𝐴) → (𝑥 ≈ (𝑅₁‘𝐴) ∨ 𝑥 ∈ (𝑅₁‘𝐴))))
74	40, 73	mpd 15	. . 3 ⊢ ((𝐴 ∈ Inacc ∧ 𝑥 ∈ 𝒫 (𝑅₁‘𝐴)) → (𝑥 ≈ (𝑅₁‘𝐴) ∨ 𝑥 ∈ (𝑅₁‘𝐴)))
75	74	ralrimiva 3147	. 2 ⊢ (𝐴 ∈ Inacc → ∀𝑥 ∈ 𝒫 (𝑅₁‘𝐴)(𝑥 ≈ (𝑅₁‘𝐴) ∨ 𝑥 ∈ (𝑅₁‘𝐴)))
76		eltsk2g 10746	. . 3 ⊢ ((𝑅₁‘𝐴) ∈ V → ((𝑅₁‘𝐴) ∈ Tarski ↔ (∀𝑥 ∈ (𝑅₁‘𝐴)(𝒫 𝑥 ⊆ (𝑅₁‘𝐴) ∧ 𝒫 𝑥 ∈ (𝑅₁‘𝐴)) ∧ ∀𝑥 ∈ 𝒫 (𝑅₁‘𝐴)(𝑥 ≈ (𝑅₁‘𝐴) ∨ 𝑥 ∈ (𝑅₁‘𝐴)))))
77	41, 76	ax-mp 5	. 2 ⊢ ((𝑅₁‘𝐴) ∈ Tarski ↔ (∀𝑥 ∈ (𝑅₁‘𝐴)(𝒫 𝑥 ⊆ (𝑅₁‘𝐴) ∧ 𝒫 𝑥 ∈ (𝑅₁‘𝐴)) ∧ ∀𝑥 ∈ 𝒫 (𝑅₁‘𝐴)(𝑥 ≈ (𝑅₁‘𝐴) ∨ 𝑥 ∈ (𝑅₁‘𝐴))))
78	29, 75, 77	sylanbrc 584	1 ⊢ (𝐴 ∈ Inacc → (𝑅₁‘𝐴) ∈ Tarski)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ↔ wb 205 ∧ wa 397 ∨ wo 846 = wceq 1542 ∈ wcel 2107 ≠ wne 2941 ∀wral 3062 ∃wrex 3071 Vcvv 3475 ⊆ wss 3949 ∅c0 4323 𝒫 cpw 4603 ∪ cuni 4909 ∪ ciun 4998 class class class wbr 5149 dom cdm 5677 “ cima 5680 Oncon0 6365 Lim wlim 6366 suc csuc 6367 ‘cfv 6544 ≈ cen 8936 ≼ cdom 8937 ≺ csdm 8938 𝑅₁cr1 9757 rankcrnk 9758 cfccf 9932 Inacc_wcwina 10677 Inacccina 10678 Tarskictsk 10743

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2704 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7725 ax-inf2 9636 ax-ac2 10458

This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3or 1089 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-mo 2535 df-eu 2564 df-clab 2711 df-cleq 2725 df-clel 2811 df-nfc 2886 df-ne 2942 df-ral 3063 df-rex 3072 df-rmo 3377 df-reu 3378 df-rab 3434 df-v 3477 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-iin 5001 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-se 5633 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-isom 6553 df-riota 7365 df-ov 7412 df-oprab 7413 df-mpo 7414 df-om 7856 df-1st 7975 df-2nd 7976 df-frecs 8266 df-wrecs 8297 df-recs 8371 df-rdg 8410 df-1o 8466 df-2o 8467 df-er 8703 df-map 8822 df-en 8940 df-dom 8941 df-sdom 8942 df-fin 8943 df-oi 9505 df-r1 9759 df-rank 9760 df-card 9934 df-cf 9936 df-acn 9937 df-ac 10111 df-wina 10679 df-ina 10680 df-tsk 10744

This theorem is referenced by: r1omtsk 10774 r1tskina 10777 grutsk 10817 inagrud 43103

W3C validator