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

Theorem tskord 10865
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.
StepHypRef Expression
1 breq1 5105 . . . . . 6 (𝑥 = 𝑦 → (𝑥 ≺ 𝑇 ↔ 𝑦 ≺ 𝑇))
21anbi2d 642 . . . . 5 (𝑥 = 𝑦 → ((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) ↔ (𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇)))
3 eleq1 2848 . . . . 5 (𝑥 = 𝑦 → (𝑥 ∈ 𝑇 ↔ 𝑦 ∈ 𝑇))
42, 3imbi12d 347 . . . 4 (𝑥 = 𝑦 → (((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) → 𝑥 ∈ 𝑇) ↔ ((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇)))
5 breq1 5105 . . . . . 6 (𝑥 = 𝐴 → (𝑥 ≺ 𝑇 ↔ 𝐴 ≺ 𝑇))
65anbi2d 642 . . . . 5 (𝑥 = 𝐴 → ((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) ↔ (𝑇 ∈ Tarski ∧ 𝐴 ≺ 𝑇)))
7 eleq1 2848 . . . . 5 (𝑥 = 𝐴 → (𝑥 ∈ 𝑇 ↔ 𝐴 ∈ 𝑇))
86, 7imbi12d 347 . . . 4 (𝑥 = 𝐴 → (((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) → 𝑥 ∈ 𝑇) ↔ ((𝑇 ∈ Tarski ∧ 𝐴 ≺ 𝑇) → 𝐴 ∈ 𝑇)))
9 simplrl 789 . . . . . . . . 9 (((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) ∧ 𝑦 ∈ 𝑥) → 𝑇 ∈ Tarski)
10 onelss 6405 . . . . . . . . . . . . 13 (𝑥 ∈ On → (𝑦 ∈ 𝑥 → 𝑦 ⊆ 𝑥))
11 ssdomg 9027 . . . . . . . . . . . . 13 (𝑥 ∈ On → (𝑦 ⊆ 𝑥 → 𝑦 ≼ 𝑥))
1210, 11syld 48 . . . . . . . . . . . 12 (𝑥 ∈ On → (𝑦 ∈ 𝑥 → 𝑦 ≼ 𝑥))
1312imp 412 . . . . . . . . . . 11 ((𝑥 ∈ On ∧ 𝑦 ∈ 𝑥) → 𝑦 ≼ 𝑥)
1413adantlr 728 . . . . . . . . . 10 (((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) ∧ 𝑦 ∈ 𝑥) → 𝑦 ≼ 𝑥)
15 simplrr 790 . . . . . . . . . 10 (((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) ∧ 𝑦 ∈ 𝑥) → 𝑥 ≺ 𝑇)
16 domsdomtr 9131 . . . . . . . . . 10 ((𝑦 ≼ 𝑥 ∧ 𝑥 ≺ 𝑇) → 𝑦 ≺ 𝑇)
1714, 15, 16syl2anc 596 . . . . . . . . 9 (((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) ∧ 𝑦 ∈ 𝑥) → 𝑦 ≺ 𝑇)
18 pm2.27 43 . . . . . . . . 9 ((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → (((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇) → 𝑦 ∈ 𝑇))
199, 17, 18syl2anc 596 . . . . . . . 8 (((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) ∧ 𝑦 ∈ 𝑥) → (((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇) → 𝑦 ∈ 𝑇))
2019ralimdva 3174 . . . . . . 7 ((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) → (∀𝑦 ∈ 𝑥 ((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇) → ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑇))
21 dfss3 3897 . . . . . . . . . . 11 (𝑥 ⊆ 𝑇 ↔ ∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑇)
22 tskssel 10842 . . . . . . . . . . . 12 ((𝑇 ∈ Tarski ∧ 𝑥 ⊆ 𝑇 ∧ 𝑥 ≺ 𝑇) → 𝑥 ∈ 𝑇)
23223exp 1137 . . . . . . . . . . 11 (𝑇 ∈ Tarski → (𝑥 ⊆ 𝑇 → (𝑥 ≺ 𝑇 → 𝑥 ∈ 𝑇)))
2421, 23biimtrrid 246 . . . . . . . . . 10 (𝑇 ∈ Tarski → (∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑇 → (𝑥 ≺ 𝑇 → 𝑥 ∈ 𝑇)))
2524com23 87 . . . . . . . . 9 (𝑇 ∈ Tarski → (𝑥 ≺ 𝑇 → (∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑇 → 𝑥 ∈ 𝑇)))
2625imp 412 . . . . . . . 8 ((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) → (∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑇 → 𝑥 ∈ 𝑇))
2726adantl 487 . . . . . . 7 ((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) → (∀𝑦 ∈ 𝑥 𝑦 ∈ 𝑇 → 𝑥 ∈ 𝑇))
2820, 27syld 48 . . . . . 6 ((𝑥 ∈ On ∧ (𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇)) → (∀𝑦 ∈ 𝑥 ((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇) → 𝑥 ∈ 𝑇))
2928ex 418 . . . . 5 (𝑥 ∈ On → ((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) → (∀𝑦 ∈ 𝑥 ((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇) → 𝑥 ∈ 𝑇)))
3029com23 87 . . . 4 (𝑥 ∈ On → (∀𝑦 ∈ 𝑥 ((𝑇 ∈ Tarski ∧ 𝑦 ≺ 𝑇) → 𝑦 ∈ 𝑇) → ((𝑇 ∈ Tarski ∧ 𝑥 ≺ 𝑇) → 𝑥 ∈ 𝑇)))
314, 8, 30tfis3 7869 . . 3 (𝐴 ∈ On → ((𝑇 ∈ Tarski ∧ 𝐴 ≺ 𝑇) → 𝐴 ∈ 𝑇))
32313impib 1134 . 2 ((𝐴 ∈ On ∧ 𝑇 ∈ Tarski ∧ 𝐴 ≺ 𝑇) → 𝐴 ∈ 𝑇)
33323com12 1141 1 ((𝑇 ∈ Tarski ∧ 𝐴 ∈ On ∧ 𝐴 ≺ 𝑇) → 𝐴 ∈ 𝑇)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076   ⊆ wss 3895   class class class wbr 5102  Oncon0 6362   ≼ cdom 8971   ≺ csdm 8972  Tarskictsk 10833
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  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-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  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 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-ord 6365  df-on 6366  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-er 8717  df-en 8974  df-dom 8975  df-sdom 8976  df-tsk 10834
This theorem is used by:  tskcard  10866
  Copyright terms: Public domain W3C validator