MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  gruun Structured version   Visualization version   GIF version

Theorem gruun 10792
Description: A Grothendieck universe contains binary unions of its elements. (Contributed by Mario Carneiro, 9-Jun-2013.)
Assertion
Ref Expression
gruun ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐵𝑈) → (𝐴𝐵) ∈ 𝑈)

Proof of Theorem gruun
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 uniprg 4889 . . . 4 ((𝐴𝑈𝐵𝑈) → {𝐴, 𝐵} = (𝐴𝐵))
213adant1 1148 . . 3 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐵𝑈) → {𝐴, 𝐵} = (𝐴𝐵))
3 uniiun 5024 . . 3 {𝐴, 𝐵} = 𝑥 ∈ {𝐴, 𝐵}𝑥
42, 3eqtr3di 2813 . 2 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐵𝑈) → (𝐴𝐵) = 𝑥 ∈ {𝐴, 𝐵}𝑥)
5 simp1 1154 . . 3 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐵𝑈) → 𝑈 ∈ Univ)
6 grupr 10783 . . 3 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐵𝑈) → {𝐴, 𝐵} ∈ 𝑈)
7 vex 3459 . . . . . . 7 𝑥 ∈ V
87elpr 4615 . . . . . 6 (𝑥 ∈ {𝐴, 𝐵} ↔ (𝑥 = 𝐴𝑥 = 𝐵))
9 eleq1a 2858 . . . . . . 7 (𝐴𝑈 → (𝑥 = 𝐴𝑥𝑈))
10 eleq1a 2858 . . . . . . 7 (𝐵𝑈 → (𝑥 = 𝐵𝑥𝑈))
119, 10jaao 969 . . . . . 6 ((𝐴𝑈𝐵𝑈) → ((𝑥 = 𝐴𝑥 = 𝐵) → 𝑥𝑈))
128, 11biimtrid 245 . . . . 5 ((𝐴𝑈𝐵𝑈) → (𝑥 ∈ {𝐴, 𝐵} → 𝑥𝑈))
1312ralrimiv 3156 . . . 4 ((𝐴𝑈𝐵𝑈) → ∀𝑥 ∈ {𝐴, 𝐵}𝑥𝑈)
14133adant1 1148 . . 3 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐵𝑈) → ∀𝑥 ∈ {𝐴, 𝐵}𝑥𝑈)
15 gruiun 10785 . . 3 ((𝑈 ∈ Univ ∧ {𝐴, 𝐵} ∈ 𝑈 ∧ ∀𝑥 ∈ {𝐴, 𝐵}𝑥𝑈) → 𝑥 ∈ {𝐴, 𝐵}𝑥𝑈)
165, 6, 14, 15syl3anc 1398 . 2 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐵𝑈) → 𝑥 ∈ {𝐴, 𝐵}𝑥𝑈)
174, 16eqeltrd 2863 1 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐵𝑈) → (𝐴𝐵) ∈ 𝑈)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  wo 860  w3a 1103   = wceq 1570  wcel 2143  wral 3079  cun 3904  {cpr 4592   cuni 4873   ciun 4957  Univcgru 10776
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5258  ax-pow 5338  ax-pr 5406  ax-un 7734
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3746  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4489  df-pw 4565  df-sn 4591  df-pr 4593  df-op 4597  df-uni 4874  df-iun 4959  df-br 5111  df-opab 5175  df-mpt 5194  df-tr 5220  df-id 5558  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546  df-ov 7415  df-oprab 7416  df-mpo 7417  df-map 8827  df-gru 10777
This theorem is referenced by:  gruxp  10793  grusucd  44937  grumnudlem  44978
  Copyright terms: Public domain W3C validator