Theorem tsk0 10852

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.

Step	Hyp	Ref	Expression
1		n0 4299	. . 3 ⊢ (𝑇 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝑇)
2		0ss 4349	. . . . . 6 ⊢ ∅ ⊆ 𝑥
3		tskss 10847	. . . . . 6 ⊢ ((𝑇 ∈ Tarski ∧ 𝑥 ∈ 𝑇 ∧ ∅ ⊆ 𝑥) → ∅ ∈ 𝑇)
4	2, 3	mp3an3 1479	. . . . 5 ⊢ ((𝑇 ∈ Tarski ∧ 𝑥 ∈ 𝑇) → ∅ ∈ 𝑇)
5	4	expcom 419	. . . 4 ⊢ (𝑥 ∈ 𝑇 → (𝑇 ∈ Tarski → ∅ ∈ 𝑇))
6	5	exlimiv 1962	. . 3 ⊢ (∃𝑥 𝑥 ∈ 𝑇 → (𝑇 ∈ Tarski → ∅ ∈ 𝑇))
7	1, 6	sylbi 220	. 2 ⊢ (𝑇 ≠ ∅ → (𝑇 ∈ Tarski → ∅ ∈ 𝑇))
8	7	impcom 413	1 ⊢ ((𝑇 ∈ Tarski ∧ 𝑇 ≠ ∅) → ∅ ∈ 𝑇)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401  ∃wex 1811   ∈ wcel 2144   ≠ wne 2955   ⊆ wss 3895  ∅c0 4278  Tarskictsk 10837

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-ext 2732  ax-sep 5248

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-tsk 10838

This theorem is used by:  tsk1  10853  tskr1om  10856