Theorem unssin 3402

Description: Union as a subset of class complement and intersection (De Morgan's law). One direction of the definition of union in [Mendelson] p. 231. This would be an equality, rather than subset, in classical logic. (Contributed by Jim Kingdon, 25-Jul-2018.)

Assertion

Ref	Expression
unssin	⊢ (𝐴 ∪ 𝐵) ⊆ (V ∖ ((V ∖ 𝐴) ∩ (V ∖ 𝐵)))

Proof of Theorem unssin

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		oranim 782	. . . . 5 ⊢ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) → ¬ (¬ 𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵))
2		eldifn 3286	. . . . . 6 ⊢ (𝑥 ∈ (V ∖ 𝐴) → ¬ 𝑥 ∈ 𝐴)
3		eldifn 3286	. . . . . 6 ⊢ (𝑥 ∈ (V ∖ 𝐵) → ¬ 𝑥 ∈ 𝐵)
4	2, 3	anim12i 338	. . . . 5 ⊢ ((𝑥 ∈ (V ∖ 𝐴) ∧ 𝑥 ∈ (V ∖ 𝐵)) → (¬ 𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵))
5	1, 4	nsyl 629	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) → ¬ (𝑥 ∈ (V ∖ 𝐴) ∧ 𝑥 ∈ (V ∖ 𝐵)))
6		elin 3346	. . . 4 ⊢ (𝑥 ∈ ((V ∖ 𝐴) ∩ (V ∖ 𝐵)) ↔ (𝑥 ∈ (V ∖ 𝐴) ∧ 𝑥 ∈ (V ∖ 𝐵)))
7	5, 6	sylnibr 678	. . 3 ⊢ ((𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵) → ¬ 𝑥 ∈ ((V ∖ 𝐴) ∩ (V ∖ 𝐵)))
8		elun 3304	. . 3 ⊢ (𝑥 ∈ (𝐴 ∪ 𝐵) ↔ (𝑥 ∈ 𝐴 ∨ 𝑥 ∈ 𝐵))
9		vex 2766	. . . 4 ⊢ 𝑥 ∈ V
10		eldif 3166	. . . 4 ⊢ (𝑥 ∈ (V ∖ ((V ∖ 𝐴) ∩ (V ∖ 𝐵))) ↔ (𝑥 ∈ V ∧ ¬ 𝑥 ∈ ((V ∖ 𝐴) ∩ (V ∖ 𝐵))))
11	9, 10	mpbiran 942	. . 3 ⊢ (𝑥 ∈ (V ∖ ((V ∖ 𝐴) ∩ (V ∖ 𝐵))) ↔ ¬ 𝑥 ∈ ((V ∖ 𝐴) ∩ (V ∖ 𝐵)))
12	7, 8, 11	3imtr4i 201	. 2 ⊢ (𝑥 ∈ (𝐴 ∪ 𝐵) → 𝑥 ∈ (V ∖ ((V ∖ 𝐴) ∩ (V ∖ 𝐵))))
13	12	ssriv 3187	1 ⊢ (𝐴 ∪ 𝐵) ⊆ (V ∖ ((V ∖ 𝐴) ∩ (V ∖ 𝐵)))

Syntax hints:  ¬ wn 3   ∧ wa 104   ∨ wo 709   ∈ wcel 2167  Vcvv 2763   ∖ cdif 3154   ∪ cun 3155   ∩ cin 3156   ⊆ wss 3157

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-ext 2178

This theorem depends on definitions:  df-bi 117  df-tru 1367  df-nf 1475  df-sb 1777  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-v 2765  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170

This theorem is referenced by: (None)