![]() |
Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > unidmex | Structured version Visualization version GIF version |
Description: If 𝐹 is a set, then ∪ dom 𝐹 is a set. (Contributed by Glauco Siliprandi, 17-Aug-2020.) |
Ref | Expression |
---|---|
unidmex.f | ⊢ (𝜑 → 𝐹 ∈ 𝑉) |
unidmex.x | ⊢ 𝑋 = ∪ dom 𝐹 |
Ref | Expression |
---|---|
unidmex | ⊢ (𝜑 → 𝑋 ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | unidmex.x | . 2 ⊢ 𝑋 = ∪ dom 𝐹 | |
2 | unidmex.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝑉) | |
3 | dmexg 7594 | . . 3 ⊢ (𝐹 ∈ 𝑉 → dom 𝐹 ∈ V) | |
4 | uniexg 7446 | . . 3 ⊢ (dom 𝐹 ∈ V → ∪ dom 𝐹 ∈ V) | |
5 | 2, 3, 4 | 3syl 18 | . 2 ⊢ (𝜑 → ∪ dom 𝐹 ∈ V) |
6 | 1, 5 | eqeltrid 2894 | 1 ⊢ (𝜑 → 𝑋 ∈ V) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1538 ∈ wcel 2111 Vcvv 3441 ∪ cuni 4800 dom cdm 5519 |
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 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-rab 3115 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-br 5031 df-opab 5093 df-cnv 5527 df-dm 5529 df-rn 5530 |
This theorem is referenced by: omessle 43137 caragensplit 43139 omeunile 43144 caragenuncl 43152 omeunle 43155 omeiunlempt 43159 carageniuncllem2 43161 caragencmpl 43174 |
Copyright terms: Public domain | W3C validator |