Theorem ssuncl 39935

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

Hypothesis

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

Assertion

Ref	Expression
ssuncl	⊢ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ∪ 𝑦) ∈ 𝐴

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

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

Proof of Theorem ssuncl

Step	Hyp	Ref	Expression
1		ssficl.a	. 2 ⊢ 𝐴 = {𝑧 ∣ 𝑧 ⊆ 𝐵}
2		vex 3500	. . 3 ⊢ 𝑥 ∈ V
3		vex 3500	. . 3 ⊢ 𝑦 ∈ V
4	2, 3	unex 7472	. 2 ⊢ (𝑥 ∪ 𝑦) ∈ V
5		sseq1 3995	. 2 ⊢ (𝑧 = (𝑥 ∪ 𝑦) → (𝑧 ⊆ 𝐵 ↔ (𝑥 ∪ 𝑦) ⊆ 𝐵))
6		sseq1 3995	. 2 ⊢ (𝑧 = 𝑥 → (𝑧 ⊆ 𝐵 ↔ 𝑥 ⊆ 𝐵))
7		sseq1 3995	. 2 ⊢ (𝑧 = 𝑦 → (𝑧 ⊆ 𝐵 ↔ 𝑦 ⊆ 𝐵))
8		unss 4163	. . 3 ⊢ ((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝐵) ↔ (𝑥 ∪ 𝑦) ⊆ 𝐵)
9	8	biimpi 218	. 2 ⊢ ((𝑥 ⊆ 𝐵 ∧ 𝑦 ⊆ 𝐵) → (𝑥 ∪ 𝑦) ⊆ 𝐵)
10	1, 4, 5, 6, 7, 9	cllem0 39931	1 ⊢ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ∪ 𝑦) ∈ 𝐴

Syntax hints:   ∧ wa 398   = wceq 1536   ∈ wcel 2113  {cab 2802  ∀wral 3141  Vcvv 3497   ∪ cun 3937   ⊆ wss 3939

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 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-sep 5206  ax-nul 5213  ax-pr 5333  ax-un 7464

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ral 3146  df-v 3499  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-nul 4295  df-sn 4571  df-pr 4573  df-uni 4842

This theorem is referenced by: (None)