Theorem nssinpss 4223

Description: Negation of subclass expressed in terms of intersection and proper subclass. (Contributed by NM, 30-Jun-2004.) (Proof shortened by Andrew Salmon, 26-Jun-2011.)

Assertion

Ref	Expression
nssinpss	⊢ (¬ 𝐴 ⊆ 𝐵 ↔ (𝐴 ∩ 𝐵) ⊊ 𝐴)

Proof of Theorem nssinpss

Step	Hyp	Ref	Expression
1		inss1 4192	. . 3 ⊢ (𝐴 ∩ 𝐵) ⊆ 𝐴
2	1	biantrur 540	. 2 ⊢ ((𝐴 ∩ 𝐵) ≠ 𝐴 ↔ ((𝐴 ∩ 𝐵) ⊆ 𝐴 ∧ (𝐴 ∩ 𝐵) ≠ 𝐴))
3		dfss2 3926	. . 3 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∩ 𝐵) = 𝐴)
4	3	necon3bbii 3008	. 2 ⊢ (¬ 𝐴 ⊆ 𝐵 ↔ (𝐴 ∩ 𝐵) ≠ 𝐴)
5		df-pss 3928	. 2 ⊢ ((𝐴 ∩ 𝐵) ⊊ 𝐴 ↔ ((𝐴 ∩ 𝐵) ⊆ 𝐴 ∧ (𝐴 ∩ 𝐵) ≠ 𝐴))
6	2, 4, 5	3bitr4i 306	1 ⊢ (¬ 𝐴 ⊆ 𝐵 ↔ (𝐴 ∩ 𝐵) ⊊ 𝐴)

This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∧ wa 401   ≠ wne 2961   ∩ cin 3907   ⊆ wss 3908   ⊊ wpss 3909

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

This proof depends on definitions:  df-bi 210  df-an 402  df-3an 1105  df-tru 1573  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ne 2962  df-v 3460  df-in 3915  df-ss 3925  df-pss 3928

This theorem is used by:  fbfinnfr  24035  chrelat2i  32754