Theorem superuncl 44706

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

Hypothesis

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

Assertion

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

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

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

Proof of Theorem superuncl

Step	Hyp	Ref	Expression
1		superficl.a	. 2 ⊢ 𝐴 = {𝑧 ∣ 𝐵 ⊆ 𝑧}
2		vex 3454	. . 3 ⊢ 𝑥 ∈ V
3		vex 3454	. . 3 ⊢ 𝑦 ∈ V
4	2, 3	unex 7765	. 2 ⊢ (𝑥 ∪ 𝑦) ∈ V
5		sseq2 3935	. 2 ⊢ (𝑧 = (𝑥 ∪ 𝑦) → (𝐵 ⊆ 𝑧 ↔ 𝐵 ⊆ (𝑥 ∪ 𝑦)))
6		sseq2 3935	. 2 ⊢ (𝑧 = 𝑥 → (𝐵 ⊆ 𝑧 ↔ 𝐵 ⊆ 𝑥))
7		sseq2 3935	. 2 ⊢ (𝑧 = 𝑦 → (𝐵 ⊆ 𝑧 ↔ 𝐵 ⊆ 𝑦))
8		ssun3 4177	. . 3 ⊢ (𝐵 ⊆ 𝑥 → 𝐵 ⊆ (𝑥 ∪ 𝑦))
9	8	adantr 486	. 2 ⊢ ((𝐵 ⊆ 𝑥 ∧ 𝐵 ⊆ 𝑦) → 𝐵 ⊆ (𝑥 ∪ 𝑦))
10	1, 4, 5, 6, 7, 9	cllem0 44704	1 ⊢ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥 ∪ 𝑦) ∈ 𝐴

This proof depends on syntax axioms:   = wceq 1569   ∈ wcel 2144  {cab 2738  ∀wral 3076  Vcvv 3450   ⊆ wss 3896   ∪ cun 4148

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-ext 2732  ax-sep 5248  ax-pr 5391  ax-un 7755

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1572  df-ex 1812  df-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-v 3452  df-ss 3897  df-un 4150  df-sn 4585  df-pr 4587  df-uni 4867

This theorem is used by: (None)