Theorem ssdifsn 4752

Description: Subset of a set with an element removed. (Contributed by Emmett Weisz, 7-Jul-2021.) (Proof shortened by JJ, 31-May-2022.)

Assertion

Ref	Expression
ssdifsn	⊢ (𝐴 ⊆ (𝐵 ∖ {𝐶}) ↔ (𝐴 ⊆ 𝐵 ∧ ¬ 𝐶 ∈ 𝐴))

Proof of Theorem ssdifsn

Step	Hyp	Ref	Expression
1		difss2 4101	. . 3 ⊢ (𝐴 ⊆ (𝐵 ∖ {𝐶}) → 𝐴 ⊆ 𝐵)
2		reldisj 4416	. . . 4 ⊢ (𝐴 ⊆ 𝐵 → ((𝐴 ∩ {𝐶}) = ∅ ↔ 𝐴 ⊆ (𝐵 ∖ {𝐶})))
3	2	bicomd 223	. . 3 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ⊆ (𝐵 ∖ {𝐶}) ↔ (𝐴 ∩ {𝐶}) = ∅))
4	1, 3	biadanii 821	. 2 ⊢ (𝐴 ⊆ (𝐵 ∖ {𝐶}) ↔ (𝐴 ⊆ 𝐵 ∧ (𝐴 ∩ {𝐶}) = ∅))
5		disjsn 4675	. . 3 ⊢ ((𝐴 ∩ {𝐶}) = ∅ ↔ ¬ 𝐶 ∈ 𝐴)
6	5	anbi2i 623	. 2 ⊢ ((𝐴 ⊆ 𝐵 ∧ (𝐴 ∩ {𝐶}) = ∅) ↔ (𝐴 ⊆ 𝐵 ∧ ¬ 𝐶 ∈ 𝐴))
7	4, 6	bitri 275	1 ⊢ (𝐴 ⊆ (𝐵 ∖ {𝐶}) ↔ (𝐴 ⊆ 𝐵 ∧ ¬ 𝐶 ∈ 𝐴))

Syntax hints:  ¬ wn 3   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109   ∖ cdif 3911   ∩ cin 3913   ⊆ wss 3914  ∅c0 4296  {csn 4589

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2701

This theorem depends on definitions:  df-bi 207  df-an 396  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-v 3449  df-dif 3917  df-in 3921  df-ss 3931  df-nul 4297  df-sn 4590

This theorem is referenced by:  naddcllem  8640  isdomn6  20623  imadrhmcl  20706  isdrng4  33245  drngmxidl  33448  assafld  33633  logdivsqrle  34641  elsetrecslem  49688