Theorem sssymdifcl 43932

Description: The class of all subsets of a class is closed under symmetric difference. (Contributed by RP, 3-Jan-2020.)

Hypothesis

Ref	Expression
ssficl.a	⊢ 𝐴 = {𝑧 ∣ 𝑧 ⊆ 𝐵}

Assertion

Ref	Expression
sssymdifcl	⊢ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝑥 ∖ 𝑦) ∪ (𝑦 ∖ 𝑥)) ∈ 𝐴

Distinct variable groups:   𝑥,𝑦,𝑧   𝑦,𝐴   𝑧,𝐵

Allowed substitution hints:   𝐴(𝑥,𝑧)   𝐵(𝑥,𝑦)

Proof of Theorem sssymdifcl

Step	Hyp	Ref	Expression
1		ssficl.a	. 2 ⊢ 𝐴 = {𝑧 ∣ 𝑧 ⊆ 𝐵}
2		vex 3446	. . . 4 ⊢ 𝑥 ∈ V
3	2	difexi 5277	. . 3 ⊢ (𝑥 ∖ 𝑦) ∈ V
4		vex 3446	. . . 4 ⊢ 𝑦 ∈ V
5	4	difexi 5277	. . 3 ⊢ (𝑦 ∖ 𝑥) ∈ V
6	3, 5	unex 7699	. 2 ⊢ ((𝑥 ∖ 𝑦) ∪ (𝑦 ∖ 𝑥)) ∈ V
7		sseq1 3961	. 2 ⊢ (𝑧 = ((𝑥 ∖ 𝑦) ∪ (𝑦 ∖ 𝑥)) → (𝑧 ⊆ 𝐵 ↔ ((𝑥 ∖ 𝑦) ∪ (𝑦 ∖ 𝑥)) ⊆ 𝐵))
8		sseq1 3961	. 2 ⊢ (𝑧 = 𝑥 → (𝑧 ⊆ 𝐵 ↔ 𝑥 ⊆ 𝐵))
9		sseq1 3961	. 2 ⊢ (𝑧 = 𝑦 → (𝑧 ⊆ 𝐵 ↔ 𝑦 ⊆ 𝐵))
10		ssdifss 4094	. . 3 ⊢ (𝑥 ⊆ 𝐵 → (𝑥 ∖ 𝑦) ⊆ 𝐵)
11		ssdifss 4094	. . 3 ⊢ (𝑦 ⊆ 𝐵 → (𝑦 ∖ 𝑥) ⊆ 𝐵)
12		unss 4144	. . . 4 ⊢ (((𝑥 ∖ 𝑦) ⊆ 𝐵 ∧ (𝑦 ∖ 𝑥) ⊆ 𝐵) ↔ ((𝑥 ∖ 𝑦) ∪ (𝑦 ∖ 𝑥)) ⊆ 𝐵)
13	12	biimpi 216	. . 3 ⊢ (((𝑥 ∖ 𝑦) ⊆ 𝐵 ∧ (𝑦 ∖ 𝑥) ⊆ 𝐵) → ((𝑥 ∖ 𝑦) ∪ (𝑦 ∖ 𝑥)) ⊆ 𝐵)
14	10, 11, 13	syl2an 597	. 2 ⊢ ((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝐵) → ((𝑥 ∖ 𝑦) ∪ (𝑦 ∖ 𝑥)) ⊆ 𝐵)
15	1, 6, 7, 8, 9, 14	cllem0 43926	1 ⊢ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝑥 ∖ 𝑦) ∪ (𝑦 ∖ 𝑥)) ∈ 𝐴

Syntax hints:   ∧ wa 395   = wceq 1542   ∈ wcel 2114  {cab 2715  ∀wral 3052  Vcvv 3442   ∖ cdif 3900   ∪ cun 3901   ⊆ wss 3903

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  ax-sep 5243  ax-pr 5379  ax-un 7690

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-ex 1782  df-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rab 3402  df-v 3444  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-sn 4583  df-pr 4585  df-uni 4866

This theorem is referenced by: (None)