Theorem sssymdifcl 43067

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 3467	. . . 4 ⊢ 𝑥 ∈ V
3	2	difexi 5325	. . 3 ⊢ (𝑥 ∖ 𝑦) ∈ V
4		vex 3467	. . . 4 ⊢ 𝑦 ∈ V
5	4	difexi 5325	. . 3 ⊢ (𝑦 ∖ 𝑥) ∈ V
6	3, 5	unex 7746	. 2 ⊢ ((𝑥 ∖ 𝑦) ∪ (𝑦 ∖ 𝑥)) ∈ V
7		sseq1 3998	. 2 ⊢ (𝑧 = ((𝑥 ∖ 𝑦) ∪ (𝑦 ∖ 𝑥)) → (𝑧 ⊆ 𝐵 ↔ ((𝑥 ∖ 𝑦) ∪ (𝑦 ∖ 𝑥)) ⊆ 𝐵))
8		sseq1 3998	. 2 ⊢ (𝑧 = 𝑥 → (𝑧 ⊆ 𝐵 ↔ 𝑥 ⊆ 𝐵))
9		sseq1 3998	. 2 ⊢ (𝑧 = 𝑦 → (𝑧 ⊆ 𝐵 ↔ 𝑦 ⊆ 𝐵))
10		ssdifss 4128	. . 3 ⊢ (𝑥 ⊆ 𝐵 → (𝑥 ∖ 𝑦) ⊆ 𝐵)
11		ssdifss 4128	. . 3 ⊢ (𝑦 ⊆ 𝐵 → (𝑦 ∖ 𝑥) ⊆ 𝐵)
12		unss 4178	. . . 4 ⊢ (((𝑥 ∖ 𝑦) ⊆ 𝐵 ∧ (𝑦 ∖ 𝑥) ⊆ 𝐵) ↔ ((𝑥 ∖ 𝑦) ∪ (𝑦 ∖ 𝑥)) ⊆ 𝐵)
13	12	biimpi 215	. . 3 ⊢ (((𝑥 ∖ 𝑦) ⊆ 𝐵 ∧ (𝑦 ∖ 𝑥) ⊆ 𝐵) → ((𝑥 ∖ 𝑦) ∪ (𝑦 ∖ 𝑥)) ⊆ 𝐵)
14	10, 11, 13	syl2an 594	. 2 ⊢ ((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝐵) → ((𝑥 ∖ 𝑦) ∪ (𝑦 ∖ 𝑥)) ⊆ 𝐵)
15	1, 6, 7, 8, 9, 14	cllem0 43061	1 ⊢ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 ((𝑥 ∖ 𝑦) ∪ (𝑦 ∖ 𝑥)) ∈ 𝐴

Syntax hints:   ∧ wa 394   = wceq 1533   ∈ wcel 2098  {cab 2702  ∀wral 3051  Vcvv 3463   ∖ cdif 3936   ∪ cun 3937   ⊆ wss 3939

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-ext 2696  ax-sep 5294  ax-nul 5301  ax-pr 5423  ax-un 7738

This theorem depends on definitions:  df-bi 206  df-an 395  df-or 846  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-sb 2060  df-clab 2703  df-cleq 2717  df-clel 2802  df-ral 3052  df-rab 3420  df-v 3465  df-dif 3942  df-un 3944  df-in 3946  df-ss 3956  df-nul 4319  df-sn 4625  df-pr 4627  df-uni 4904

This theorem is referenced by: (None)