Theorem difprsnss 4744

Description: Removal of a singleton from an unordered pair. (Contributed by NM, 16-Mar-2006.) (Proof shortened by Andrew Salmon, 29-Jun-2011.)

Assertion

Ref	Expression
difprsnss	⊢ ({𝐴, 𝐵} ∖ {𝐴}) ⊆ {𝐵}

Proof of Theorem difprsnss

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 3433	. . . . 5 ⊢ 𝑥 ∈ V
2	1	elpr 4592	. . . 4 ⊢ (𝑥 ∈ {𝐴, 𝐵} ↔ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵))
3		velsn 4583	. . . . 5 ⊢ (𝑥 ∈ {𝐴} ↔ 𝑥 = 𝐴)
4	3	notbii 320	. . . 4 ⊢ (¬ 𝑥 ∈ {𝐴} ↔ ¬ 𝑥 = 𝐴)
5		biorf 937	. . . . 5 ⊢ (¬ 𝑥 = 𝐴 → (𝑥 = 𝐵 ↔ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵)))
6	5	biimparc 479	. . . 4 ⊢ (((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) ∧ ¬ 𝑥 = 𝐴) → 𝑥 = 𝐵)
7	2, 4, 6	syl2anb 599	. . 3 ⊢ ((𝑥 ∈ {𝐴, 𝐵} ∧ ¬ 𝑥 ∈ {𝐴}) → 𝑥 = 𝐵)
8		eldif 3899	. . 3 ⊢ (𝑥 ∈ ({𝐴, 𝐵} ∖ {𝐴}) ↔ (𝑥 ∈ {𝐴, 𝐵} ∧ ¬ 𝑥 ∈ {𝐴}))
9		velsn 4583	. . 3 ⊢ (𝑥 ∈ {𝐵} ↔ 𝑥 = 𝐵)
10	7, 8, 9	3imtr4i 292	. 2 ⊢ (𝑥 ∈ ({𝐴, 𝐵} ∖ {𝐴}) → 𝑥 ∈ {𝐵})
11	10	ssriv 3925	1 ⊢ ({𝐴, 𝐵} ∖ {𝐴}) ⊆ {𝐵}

Syntax hints:  ¬ wn 3   ∧ wa 395   ∨ wo 848   = wceq 1542   ∈ wcel 2114   ∖ cdif 3886   ⊆ wss 3889  {csn 4567  {cpr 4569

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2708

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2715  df-cleq 2728  df-clel 2811  df-v 3431  df-dif 3892  df-un 3894  df-ss 3906  df-sn 4568  df-pr 4570

This theorem is referenced by:  en2other2  9931  ex-chn1  18603  pmtrprfv  19428  itg11  25658