Users' Mathboxes Mathbox for Glauco Siliprandi < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  unidmex Structured version   Visualization version   GIF version

Theorem unidmex 46401
Description: If 𝐹 is a set, then ∪ dom 𝐹 is a set. (Contributed by Glauco Siliprandi, 17-Aug-2020.)
Hypotheses
Ref Expression
unidmex.f (𝜑 → 𝐹 ∈ 𝑉)
unidmex.x 𝑋 = ∪ dom 𝐹
Assertion
Ref Expression
unidmex (𝜑 → 𝑋 ∈ V)

Proof of Theorem unidmex
StepHypRef Expression
1 unidmex.x . 2 𝑋 = ∪ dom 𝐹
2 unidmex.f . . 3 (𝜑 → 𝐹 ∈ 𝑉)
3 dmexg 7946 . . 3 (𝐹 ∈ 𝑉 → dom 𝐹 ∈ V)
4 uniexg 7788 . . 3 (dom 𝐹 ∈ V → ∪ dom 𝐹 ∈ V)
52, 3, 43syl 19 . 2 (𝜑 → ∪ dom 𝐹 ∈ V)
61, 5eqeltrid 2871 1 (𝜑 → 𝑋 ∈ V)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   = wceq 1572   ∈ wcel 2150  Vcvv 3453  ∪ cuni 4871  dom cdm 5657
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-ext 2738  ax-sep 5254  ax-pr 5397  ax-un 7782
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-sb 2104  df-clab 2745  df-cleq 2758  df-clel 2842  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-cnv 5665  df-dm 5667  df-rn 5668
This theorem is used by:  omessle  47841  caragensplit  47843  omeunile  47848  caragenuncl  47856  omeunle  47859  omeiunlempt  47863  carageniuncllem2  47865  caragencmpl  47878
  Copyright terms: Public domain W3C validator