Theorem 0disj 5089

Description: Any collection of empty sets is disjoint. (Contributed by Mario Carneiro, 14-Nov-2016.)

Assertion

Ref	Expression
0disj	⊢ Disj 𝑥 ∈ 𝐴 ∅

Proof of Theorem 0disj

Step	Hyp	Ref	Expression
1		0ss 4350	. . 3 ⊢ ∅ ⊆ {𝑥}
2	1	rgenw 3053	. 2 ⊢ ∀𝑥 ∈ 𝐴 ∅ ⊆ {𝑥}
3		sndisj 5088	. 2 ⊢ Disj 𝑥 ∈ 𝐴 {𝑥}
4		disjss2 5066	. 2 ⊢ (∀𝑥 ∈ 𝐴 ∅ ⊆ {𝑥} → (Disj 𝑥 ∈ 𝐴 {𝑥} → Disj 𝑥 ∈ 𝐴 ∅))
5	2, 3, 4	mp2 9	1 ⊢ Disj 𝑥 ∈ 𝐴 ∅

Syntax hints:  ∀wral 3049   ⊆ wss 3899  ∅c0 4283  {csn 4578  Disj wdisj 5063

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-ext 2706

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-mo 2537  df-clab 2713  df-cleq 2726  df-clel 2809  df-ral 3050  df-rmo 3348  df-v 3440  df-dif 3902  df-ss 3916  df-nul 4284  df-sn 4579  df-disj 5064

This theorem is referenced by: (None)