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

Theorem gruiin 10822
Description: A Grothendieck universe contains indexed intersections of its elements. (Contributed by Mario Carneiro, 9-Jun-2013.)
Assertion
Ref Expression
gruiin ((𝑈 ∈ Univ ∧ ∃𝑥𝐴 𝐵𝑈) → 𝑥𝐴 𝐵𝑈)
Distinct variable groups:   𝑥,𝑈   𝑥,𝐴
Allowed substitution hint:   𝐵(𝑥)

Proof of Theorem gruiin
StepHypRef Expression
1 nfv 1947 . . 3 𝑥 𝑈 ∈ Univ
2 nfii1 4987 . . . 4 𝑥 𝑥𝐴 𝐵
32nfel1 2938 . . 3 𝑥 𝑥𝐴 𝐵𝑈
4 iinss2 5016 . . . . . 6 (𝑥𝐴 𝑥𝐴 𝐵𝐵)
5 gruss 10808 . . . . . 6 ((𝑈 ∈ Univ ∧ 𝐵𝑈 𝑥𝐴 𝐵𝐵) → 𝑥𝐴 𝐵𝑈)
64, 5syl3an3 1183 . . . . 5 ((𝑈 ∈ Univ ∧ 𝐵𝑈𝑥𝐴) → 𝑥𝐴 𝐵𝑈)
763exp 1137 . . . 4 (𝑈 ∈ Univ → (𝐵𝑈 → (𝑥𝐴 𝑥𝐴 𝐵𝑈)))
87com23 87 . . 3 (𝑈 ∈ Univ → (𝑥𝐴 → (𝐵𝑈 𝑥𝐴 𝐵𝑈)))
91, 3, 8rexlimd 3269 . 2 (𝑈 ∈ Univ → (∃𝑥𝐴 𝐵𝑈 𝑥𝐴 𝐵𝑈))
109imp 412 1 ((𝑈 ∈ Univ ∧ ∃𝑥𝐴 𝐵𝑈) → 𝑥𝐴 𝐵𝑈)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  wcel 2145  wrex 3086  wss 3899   ciin 4952  Univcgru 10802
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iin 4954  df-br 5104  df-tr 5213  df-iota 6489  df-fv 6541  df-ov 7417  df-gru 10803
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator