Theorem tskord 10771

Description: A Tarski class contains all ordinals smaller than it. (Contributed by Mario Carneiro, 8-Jun-2013.)

Assertion

Ref	Expression
tskord	⊢ ((𝑇 ∈ Tarski ∧ 𝐴 ∈ On ∧ 𝐴 ≺ 𝑇) → 𝐴 ∈ 𝑇)

Proof of Theorem tskord

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

Step	Hyp	Ref	Expression
1		breq1 5111	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 ≺ 𝑇 ↔ 𝑦 ≺ 𝑇))
2	1	anbi2d 641	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) ↔ (𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇)))
3		eleq1 2850	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑇 ↔ 𝑦 ∈ 𝑇))
4	2, 3	imbi12d 347	. . . 4 ⊢ (𝑥 = 𝑦 → (((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) → 𝑥 ∈ 𝑇) ↔ ((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇)))
5		breq1 5111	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥 ≺ 𝑇 ↔ 𝐴 ≺ 𝑇))
6	5	anbi2d 641	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) ↔ (𝑇 ∈ Tarski ∧ 𝐴 ≺ 𝑇)))
7		eleq1 2850	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝑇 ↔ 𝐴 ∈ 𝑇))
8	6, 7	imbi12d 347	. . . 4 ⊢ (𝑥 = 𝐴 → (((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) → 𝑥 ∈ 𝑇) ↔ ((𝑇 ∈ Tarski ∧ 𝐴 ≺ 𝑇) → 𝐴 ∈ 𝑇)))
9		simplrl 788	. . . . . . . . 9 ⊢ (((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) ∧ 𝑦 ∈ 𝑥) → 𝑇 ∈ Tarski)
10		onelss 6403	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ On → (𝑦 ∈ 𝑥 → 𝑦 ⊆ 𝑥))
11		ssdomg 8995	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ On → (𝑦 ⊆ 𝑥 → 𝑦 ≼ 𝑥))
12	10, 11	syld 48	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ On → (𝑦 ∈ 𝑥 → 𝑦 ≼ 𝑥))
13	12	imp 411	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ 𝑥) → 𝑦 ≼ 𝑥)
14	13	adantlr 727	. . . . . . . . . 10 ⊢ (((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) ∧ 𝑦 ∈ 𝑥) → 𝑦 ≼ 𝑥)
15		simplrr 789	. . . . . . . . . 10 ⊢ (((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) ∧ 𝑦 ∈ 𝑥) → 𝑥 ≺ 𝑇)
16		domsdomtr 9098	. . . . . . . . . 10 ⊢ ((𝑦 ≼ 𝑥 ∧ 𝑥 ≺ 𝑇) → 𝑦 ≺ 𝑇)
17	14, 15, 16	syl2anc 595	. . . . . . . . 9 ⊢ (((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) ∧ 𝑦 ∈ 𝑥) → 𝑦 ≺ 𝑇)
18		pm2.27 43	. . . . . . . . 9 ⊢ ((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → (((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇) → 𝑦 ∈ 𝑇))
19	9, 17, 18	syl2anc 595	. . . . . . . 8 ⊢ (((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) ∧ 𝑦 ∈ 𝑥) → (((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇) → 𝑦 ∈ 𝑇))
20	19	ralimdva 3176	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) → (∀𝑦 ∈ 𝑥 ((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇) → ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑇))
21		dfss3 3925	. . . . . . . . . . 11 ⊢ (𝑥 ⊆ 𝑇 ↔ ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑇)
22		tskssel 10748	. . . . . . . . . . . 12 ⊢ ((𝑇 ∈ Tarski ∧ 𝑥 ⊆ 𝑇 ∧ 𝑥 ≺ 𝑇) → 𝑥 ∈ 𝑇)
23	22	3exp 1136	. . . . . . . . . . 11 ⊢ (𝑇 ∈ Tarski → (𝑥 ⊆ 𝑇 → (𝑥 ≺ 𝑇 → 𝑥 ∈ 𝑇)))
24	21, 23	biimtrrid 246	. . . . . . . . . 10 ⊢ (𝑇 ∈ Tarski → (∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑇 → (𝑥 ≺ 𝑇 → 𝑥 ∈ 𝑇)))
25	24	com23 87	. . . . . . . . 9 ⊢ (𝑇 ∈ Tarski → (𝑥 ≺ 𝑇 → (∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑇 → 𝑥 ∈ 𝑇)))
26	25	imp 411	. . . . . . . 8 ⊢ ((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) → (∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑇 → 𝑥 ∈ 𝑇))
27	26	adantl 486	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) → (∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑇 → 𝑥 ∈ 𝑇))
28	20, 27	syld 48	. . . . . 6 ⊢ ((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) → (∀𝑦 ∈ 𝑥 ((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇) → 𝑥 ∈ 𝑇))
29	28	ex 417	. . . . 5 ⊢ (𝑥 ∈ On → ((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) → (∀𝑦 ∈ 𝑥 ((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇) → 𝑥 ∈ 𝑇)))
30	29	com23 87	. . . 4 ⊢ (𝑥 ∈ On → (∀𝑦 ∈ 𝑥 ((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇) → ((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) → 𝑥 ∈ 𝑇)))
31	4, 8, 30	tfis3 7852	. . 3 ⊢ (𝐴 ∈ On → ((𝑇 ∈ Tarski ∧ 𝐴 ≺ 𝑇) → 𝐴 ∈ 𝑇))
32	31	3impib 1133	. 2 ⊢ ((𝐴 ∈ On ∧ 𝑇 ∈ Tarski ∧ 𝐴 ≺ 𝑇) → 𝐴 ∈ 𝑇)
33	32	3com12 1140	1 ⊢ ((𝑇 ∈ Tarski ∧ 𝐴 ∈ On ∧ 𝐴 ≺ 𝑇) → 𝐴 ∈ 𝑇)

This proof depends on syntax axioms:   → wi 4   ∧ wa 400   ∧ w3a 1102   = wceq 1569   ∈ wcel 2142  ∀wral 3078   ⊆ wss 3904   class class class wbr 5108  Oncon0 6360   ≼ cdom 8939   ≺ csdm 8940  Tarskictsk 10739

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-sep 5256  ax-pow 5335  ax-pr 5403  ax-un 7734

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3416  df-v 3456  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-br 5109  df-opab 5173  df-tr 5218  df-id 5555  df-eprel 5560  df-po 5568  df-so 5569  df-fr 5613  df-we 5615  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-ord 6363  df-on 6364  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-er 8692  df-en 8942  df-dom 8943  df-sdom 8944  df-tsk 10740

This theorem is used by:  tskcard  10772