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

Theorem tsk0 10749
Description: A nonempty Tarski class contains the empty set. (Contributed by FL, 30-Dec-2010.) (Revised by Mario Carneiro, 18-Jun-2013.)
Assertion
Ref Expression
tsk0 ((𝑇 ∈ Tarski ∧ 𝑇 ≠ ∅) → ∅ ∈ 𝑇)

Proof of Theorem tsk0
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 n0 4308 . . 3 (𝑇 ≠ ∅ ↔ ∃𝑥 𝑥𝑇)
2 0ss 4358 . . . . . 6 ∅ ⊆ 𝑥
3 tskss 10744 . . . . . 6 ((𝑇 ∈ Tarski ∧ 𝑥𝑇 ∧ ∅ ⊆ 𝑥) → ∅ ∈ 𝑇)
42, 3mp3an3 1479 . . . . 5 ((𝑇 ∈ Tarski ∧ 𝑥𝑇) → ∅ ∈ 𝑇)
54expcom 418 . . . 4 (𝑥𝑇 → (𝑇 ∈ Tarski → ∅ ∈ 𝑇))
65exlimiv 1960 . . 3 (∃𝑥 𝑥𝑇 → (𝑇 ∈ Tarski → ∅ ∈ 𝑇))
71, 6sylbi 220 . 2 (𝑇 ≠ ∅ → (𝑇 ∈ Tarski → ∅ ∈ 𝑇))
87impcom 412 1 ((𝑇 ∈ Tarski ∧ 𝑇 ≠ ∅) → ∅ ∈ 𝑇)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  wex 1809  wcel 2143  wne 2958  wss 3906  c0 4287  Tarskictsk 10734
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5258
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-clab 2742  df-cleq 2755  df-clel 2838  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-br 5111  df-tsk 10735
This theorem is referenced by:  tsk1  10750  tskr1om  10753
  Copyright terms: Public domain W3C validator