Theorem tskord 10836

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 5105	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑥 ≺ 𝑇 ↔ 𝑦 ≺ 𝑇))
2	1	anbi2d 642	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) ↔ (𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇)))
3		eleq1 2848	. . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑇 ↔ 𝑦 ∈ 𝑇))
4	2, 3	imbi12d 347	. . . 4 ⊢ (𝑥 = 𝑦 → (((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) → 𝑥 ∈ 𝑇) ↔ ((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇)))
5		breq1 5105	. . . . . 6 ⊢ (𝑥 = 𝐴 → (𝑥 ≺ 𝑇 ↔ 𝐴 ≺ 𝑇))
6	5	anbi2d 642	. . . . 5 ⊢ (𝑥 = 𝐴 → ((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) ↔ (𝑇 ∈ Tarski ∧ 𝐴 ≺ 𝑇)))
7		eleq1 2848	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝑇 ↔ 𝐴 ∈ 𝑇))
8	6, 7	imbi12d 347	. . . 4 ⊢ (𝑥 = 𝐴 → (((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) → 𝑥 ∈ 𝑇) ↔ ((𝑇 ∈ Tarski ∧ 𝐴 ≺ 𝑇) → 𝐴 ∈ 𝑇)))
9		simplrl 789	. . . . . . . . 9 ⊢ (((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) ∧ 𝑦 ∈ 𝑥) → 𝑇 ∈ Tarski)
10		onelss 6394	. . . . . . . . . . . . 13 ⊢ (𝑥 ∈ On → (𝑦 ∈ 𝑥 → 𝑦 ⊆ 𝑥))
11		ssdomg 9005	. . . . . . . . . . . . 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 9109	. . . . . . . . . 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 3174	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) → (∀𝑦 ∈ 𝑥 ((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇) → ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑇))
21		dfss3 3919	. . . . . . . . . . 11 ⊢ (𝑥 ⊆ 𝑇 ↔ ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑇)
22		tskssel 10813	. . . . . . . . . . . 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 7852	. . 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 2145  ∀wral 3076   ⊆ wss 3898   class class class wbr 5102  Oncon0 6351   ≼ cdom 8949   ≺ csdm 8950  Tarskictsk 10804

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5248  ax-pow 5326  ax-pr 5390  ax-un 7734

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-tr 5212  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-ord 6354  df-on 6355  df-fun 6529  df-fn 6530  df-f 6531  df-f1 6532  df-fo 6533  df-f1o 6534  df-er 8695  df-en 8952  df-dom 8953  df-sdom 8954  df-tsk 10805

This theorem is used by:  tskcard  10837