Theorem tsk0 9464

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 3890	. . 3 ⊢ (𝑇 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝑇)
2		0ss 3924	. . . . . 6 ⊢ ∅ ⊆ 𝑥
3		tskss 9459	. . . . . 6 ⊢ ((𝑇 ∈ Tarski ∧ 𝑥 ∈ 𝑇 ∧ ∅ ⊆ 𝑥) → ∅ ∈ 𝑇)
4	2, 3	mp3an3 1405	. . . . 5 ⊢ ((𝑇 ∈ Tarski ∧ 𝑥 ∈ 𝑇) → ∅ ∈ 𝑇)
5	4	expcom 450	. . . 4 ⊢ (𝑥 ∈ 𝑇 → (𝑇 ∈ Tarski → ∅ ∈ 𝑇))
6	5	exlimiv 1845	. . 3 ⊢ (∃𝑥 𝑥 ∈ 𝑇 → (𝑇 ∈ Tarski → ∅ ∈ 𝑇))
7	1, 6	sylbi 206	. 2 ⊢ (𝑇 ≠ ∅ → (𝑇 ∈ Tarski → ∅ ∈ 𝑇))
8	7	impcom 445	1 ⊢ ((𝑇 ∈ Tarski ∧ 𝑇 ≠ ∅) → ∅ ∈ 𝑇)

Syntax hints:   → wi 4   ∧ wa 383  ∃wex 1695   ∈ wcel 1977   ≠ wne 2780   ⊆ wss 3540  ∅c0 3874  Tarskictsk 9449

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-br 4584  df-tsk 9450

This theorem is referenced by:  tsk1  9465  tskr1om  9468