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

Theorem gruun 10717
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 4879 . . . 4 ((𝐴𝑈𝐵𝑈) → {𝐴, 𝐵} = (𝐴𝐵))
213adant1 1130 . . 3 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐵𝑈) → {𝐴, 𝐵} = (𝐴𝐵))
3 uniiun 5014 . . 3 {𝐴, 𝐵} = 𝑥 ∈ {𝐴, 𝐵}𝑥
42, 3eqtr3di 2786 . 2 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐵𝑈) → (𝐴𝐵) = 𝑥 ∈ {𝐴, 𝐵}𝑥)
5 simp1 1136 . . 3 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐵𝑈) → 𝑈 ∈ Univ)
6 grupr 10708 . . 3 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐵𝑈) → {𝐴, 𝐵} ∈ 𝑈)
7 vex 3444 . . . . . . 7 𝑥 ∈ V
87elpr 4605 . . . . . 6 (𝑥 ∈ {𝐴, 𝐵} ↔ (𝑥 = 𝐴𝑥 = 𝐵))
9 eleq1a 2831 . . . . . . 7 (𝐴𝑈 → (𝑥 = 𝐴𝑥𝑈))
10 eleq1a 2831 . . . . . . 7 (𝐵𝑈 → (𝑥 = 𝐵𝑥𝑈))
119, 10jaao 956 . . . . . 6 ((𝐴𝑈𝐵𝑈) → ((𝑥 = 𝐴𝑥 = 𝐵) → 𝑥𝑈))
128, 11biimtrid 242 . . . . 5 ((𝐴𝑈𝐵𝑈) → (𝑥 ∈ {𝐴, 𝐵} → 𝑥𝑈))
1312ralrimiv 3127 . . . 4 ((𝐴𝑈𝐵𝑈) → ∀𝑥 ∈ {𝐴, 𝐵}𝑥𝑈)
14133adant1 1130 . . 3 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐵𝑈) → ∀𝑥 ∈ {𝐴, 𝐵}𝑥𝑈)
15 gruiun 10710 . . 3 ((𝑈 ∈ Univ ∧ {𝐴, 𝐵} ∈ 𝑈 ∧ ∀𝑥 ∈ {𝐴, 𝐵}𝑥𝑈) → 𝑥 ∈ {𝐴, 𝐵}𝑥𝑈)
165, 6, 14, 15syl3anc 1373 . 2 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐵𝑈) → 𝑥 ∈ {𝐴, 𝐵}𝑥𝑈)
174, 16eqeltrd 2836 1 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐵𝑈) → (𝐴𝐵) ∈ 𝑈)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wo 847  w3a 1086   = wceq 1541  wcel 2113  wral 3051  cun 3899  {cpr 4582   cuni 4863   ciun 4946  Univcgru 10701
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ral 3052  df-rex 3061  df-rab 3400  df-v 3442  df-sbc 3741  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-fv 6500  df-ov 7361  df-oprab 7362  df-mpo 7363  df-map 8765  df-gru 10702
This theorem is referenced by:  gruxp  10718  grusucd  44471  grumnudlem  44526
  Copyright terms: Public domain W3C validator