Theorem ssdifsym 4215

Description: Symmetric class differences for subclasses. (Contributed by AV, 3-Jan-2022.)

Assertion

Ref	Expression
ssdifsym	⊢ ((𝐴 ⊆ 𝑉 ∧ 𝐵 ⊆ 𝑉) → (𝐵 = (𝑉 ∖ 𝐴) ↔ 𝐴 = (𝑉 ∖ 𝐵)))

Proof of Theorem ssdifsym

Step	Hyp	Ref	Expression
1		ssdifim 4214	. . 3 ⊢ ((𝐴 ⊆ 𝑉 ∧ 𝐵 = (𝑉 ∖ 𝐴)) → 𝐴 = (𝑉 ∖ 𝐵))
2	1	ex 412	. 2 ⊢ (𝐴 ⊆ 𝑉 → (𝐵 = (𝑉 ∖ 𝐴) → 𝐴 = (𝑉 ∖ 𝐵)))
3		ssdifim 4214	. . 3 ⊢ ((𝐵 ⊆ 𝑉 ∧ 𝐴 = (𝑉 ∖ 𝐵)) → 𝐵 = (𝑉 ∖ 𝐴))
4	3	ex 412	. 2 ⊢ (𝐵 ⊆ 𝑉 → (𝐴 = (𝑉 ∖ 𝐵) → 𝐵 = (𝑉 ∖ 𝐴)))
5	2, 4	anbiim 642	1 ⊢ ((𝐴 ⊆ 𝑉 ∧ 𝐵 ⊆ 𝑉) → (𝐵 = (𝑉 ∖ 𝐴) ↔ 𝐴 = (𝑉 ∖ 𝐵)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1542   ∖ cdif 3887   ⊆ wss 3890

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 2709

This theorem depends on definitions:  df-bi 207  df-an 396  df-3an 1089  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-rab 3391  df-v 3432  df-dif 3893  df-in 3897  df-ss 3907

This theorem is referenced by:  zarcls  34038