Theorem tskord 10889

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 5109	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 ≺ 𝑇 ↔ 𝑦 ≺ 𝑇))
2	1	anbi2d 642	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) ↔ (𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇)))
3		eleq1 2852	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑇 ↔ 𝑦 ∈ 𝑇))
4	2, 3	imbi12d 347	. . . 4 ⊢ (𝑥 = 𝑦 → (((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) → 𝑥 ∈ 𝑇) ↔ ((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇)))
5		breq1 5109	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥 ≺ 𝑇 ↔ 𝐴 ≺ 𝑇))
6	5	anbi2d 642	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) ↔ (𝑇 ∈ Tarski ∧ 𝐴 ≺ 𝑇)))
7		eleq1 2852	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝑇 ↔ 𝐴 ∈ 𝑇))
8	6, 7	imbi12d 347	. . . 4 ⊢ (𝑥 = 𝐴 → (((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) → 𝑥 ∈ 𝑇) ↔ ((𝑇 ∈ Tarski ∧ 𝐴 ≺ 𝑇) → 𝐴 ∈ 𝑇)))
9		simplrl 789	. . . . . . . . 9 ⊢ (((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) ∧ 𝑦 ∈ 𝑥) → 𝑇 ∈ Tarski)
10		onelss 6420	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ On → (𝑦 ∈ 𝑥 → 𝑦 ⊆ 𝑥))
11		ssdomg 9052	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ On → (𝑦 ⊆ 𝑥 → 𝑦 ≼ 𝑥))
12	10, 11	syld 48	. . . . . . . . . . . 12 ⊢ (𝑥 ∈ On → (𝑦 ∈ 𝑥 → 𝑦 ≼ 𝑥))
13	12	imp 412	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ 𝑥) → 𝑦 ≼ 𝑥)
14	13	adantlr 728	. . . . . . . . . 10 ⊢ (((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) ∧ 𝑦 ∈ 𝑥) → 𝑦 ≼ 𝑥)
15		simplrr 790	. . . . . . . . . 10 ⊢ (((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) ∧ 𝑦 ∈ 𝑥) → 𝑥 ≺ 𝑇)
16		domsdomtr 9156	. . . . . . . . . 10 ⊢ ((𝑦 ≼ 𝑥 ∧ 𝑥 ≺ 𝑇) → 𝑦 ≺ 𝑇)
17	14, 15, 16	syl2anc 596	. . . . . . . . 9 ⊢ (((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) ∧ 𝑦 ∈ 𝑥) → 𝑦 ≺ 𝑇)
18		pm2.27 43	. . . . . . . . 9 ⊢ ((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → (((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇) → 𝑦 ∈ 𝑇))
19	9, 17, 18	syl2anc 596	. . . . . . . 8 ⊢ (((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) ∧ 𝑦 ∈ 𝑥) → (((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇) → 𝑦 ∈ 𝑇))
20	19	ralimdva 3178	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) → (∀𝑦 ∈ 𝑥 ((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇) → ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑇))
21		dfss3 3902	. . . . . . . . . . 11 ⊢ (𝑥 ⊆ 𝑇 ↔ ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑇)
22		tskssel 10866	. . . . . . . . . . . 12 ⊢ ((𝑇 ∈ Tarski ∧ 𝑥 ⊆ 𝑇 ∧ 𝑥 ≺ 𝑇) → 𝑥 ∈ 𝑇)
23	22	3exp 1137	. . . . . . . . . . 11 ⊢ (𝑇 ∈ Tarski → (𝑥 ⊆ 𝑇 → (𝑥 ≺ 𝑇 → 𝑥 ∈ 𝑇)))
24	21, 23	biimtrrid 246	. . . . . . . . . 10 ⊢ (𝑇 ∈ Tarski → (∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑇 → (𝑥 ≺ 𝑇 → 𝑥 ∈ 𝑇)))
25	24	com23 87	. . . . . . . . 9 ⊢ (𝑇 ∈ Tarski → (𝑥 ≺ 𝑇 → (∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑇 → 𝑥 ∈ 𝑇)))
26	25	imp 412	. . . . . . . 8 ⊢ ((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) → (∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑇 → 𝑥 ∈ 𝑇))
27	26	adantl 487	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) → (∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑇 → 𝑥 ∈ 𝑇))
28	20, 27	syld 48	. . . . . 6 ⊢ ((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) → (∀𝑦 ∈ 𝑥 ((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇) → 𝑥 ∈ 𝑇))
29	28	ex 418	. . . . 5 ⊢ (𝑥 ∈ On → ((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) → (∀𝑦 ∈ 𝑥 ((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇) → 𝑥 ∈ 𝑇)))
30	29	com23 87	. . . 4 ⊢ (𝑥 ∈ On → (∀𝑦 ∈ 𝑥 ((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇) → ((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) → 𝑥 ∈ 𝑇)))
31	4, 8, 30	tfis3 7890	. . 3 ⊢ (𝐴 ∈ On → ((𝑇 ∈ Tarski ∧ 𝐴 ≺ 𝑇) → 𝐴 ∈ 𝑇))
32	31	3impib 1134	. 2 ⊢ ((𝐴 ∈ On ∧ 𝑇 ∈ Tarski ∧ 𝐴 ≺ 𝑇) → 𝐴 ∈ 𝑇)
33	32	3com12 1141	1 ⊢ ((𝑇 ∈ Tarski ∧ 𝐴 ∈ On ∧ 𝐴 ≺ 𝑇) → 𝐴 ∈ 𝑇)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ⊆ wss 3900   class class class wbr 5106  Oncon0 6377   ≼ cdom 8996   ≺ csdm 8997  Tarskictsk 10857

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-pow 5331  ax-pr 5395  ax-un 7772

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5171  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6380  df-on 6381  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-er 8742  df-en 8999  df-dom 9000  df-sdom 9001  df-tsk 10858

This theorem is used by:  tskcard  10890