Theorem tsk0 10829

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 4300	. . 3 ⊢ (𝑇 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝑇)
2		0ss 4350	. . . . . 6 ⊢ ∅ ⊆ 𝑥
3		tskss 10824	. . . . . 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 2145   ≠ wne 2956   ⊆ wss 3899  ∅c0 4279  Tarskictsk 10814

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 2147  ax-9 2155  ax-ext 2733  ax-sep 5249

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 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-tsk 10815

This theorem is used by:  tsk1  10830  tskr1om  10833