Theorem tsk0 10766

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 4310	. . 3 ⊢ (𝑇 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝑇)
2		0ss 4360	. . . . . 6 ⊢ ∅ ⊆ 𝑥
3		tskss 10761	. . . . . 6 ⊢ ((𝑇 ∈ Tarski ∧ 𝑥 ∈ 𝑇 ∧ ∅ ⊆ 𝑥) → ∅ ∈ 𝑇)
4	2, 3	mp3an3 1479	. . . . 5 ⊢ ((𝑇 ∈ Tarski ∧ 𝑥 ∈ 𝑇) → ∅ ∈ 𝑇)
5	4	expcom 419	. . . 4 ⊢ (𝑥 ∈ 𝑇 → (𝑇 ∈ Tarski → ∅ ∈ 𝑇))
6	5	exlimiv 1963	. . 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 1812   ∈ wcel 2146   ≠ wne 2961   ⊆ wss 3908  ∅c0 4289  Tarskictsk 10751

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 2148  ax-9 2156  ax-ext 2738  ax-sep 5262

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-br 5115  df-tsk 10752

This theorem is used by:  tsk1  10767  tskr1om  10770