![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > unexd | Structured version Visualization version GIF version |
Description: The union of two sets is a set. (Contributed by SN, 16-Jul-2024.) |
Ref | Expression |
---|---|
unexd.1 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
unexd.2 | ⊢ (𝜑 → 𝐵 ∈ 𝑊) |
Ref | Expression |
---|---|
unexd | ⊢ (𝜑 → (𝐴 ∪ 𝐵) ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | unexd.1 | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
2 | unexd.2 | . 2 ⊢ (𝜑 → 𝐵 ∈ 𝑊) | |
3 | unexg 7757 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (𝐴 ∪ 𝐵) ∈ V) | |
4 | 1, 2, 3 | syl2anc 582 | 1 ⊢ (𝜑 → (𝐴 ∪ 𝐵) ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∈ wcel 2098 Vcvv 3473 ∪ cun 3947 |
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 2699 ax-sep 5303 ax-nul 5310 ax-pr 5433 ax-un 7746 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-tru 1536 df-fal 1546 df-ex 1774 df-sb 2060 df-clab 2706 df-cleq 2720 df-clel 2806 df-rab 3431 df-v 3475 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-nul 4327 df-sn 4633 df-pr 4635 df-uni 4913 |
This theorem is referenced by: sexp2 8157 sexp3 8164 ssltun1 27761 ssltun2 27762 addsproplem2 27907 addsuniflem 27938 ssltmul1 28067 ssltmul2 28068 precsexlem11 28135 elrspunsn 33170 ofun 41758 tfsconcatun 42797 rclexi 43076 rtrclexlem 43077 trclubgNEW 43079 cnvrcl0 43086 dfrtrcl5 43090 iunrelexp0 43163 relexpmulg 43171 relexp01min 43174 clnbgrval 47191 |
Copyright terms: Public domain | W3C validator |