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

Theorem elgrug 10788
Description: Properties of a Grothendieck universe. (Contributed by Mario Carneiro, 9-Jun-2013.)
Assertion
Ref Expression
elgrug (𝑈𝑉 → (𝑈 ∈ Univ ↔ (Tr 𝑈 ∧ ∀𝑥𝑈 (𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈))))
Distinct variable group:   𝑥,𝑈,𝑦
Allowed substitution hints:   𝑉(𝑥, 𝑦)

Proof of Theorem elgrug
Dummy variable 𝑢 is distinct from all other variables.
StepHypRef Expression
1 treq 5227 . . 3 (𝑢 = 𝑈 → (Tr 𝑢 ↔ Tr 𝑈))
2 eleq2 2854 . . . . 5 (𝑢 = 𝑈 → (𝒫 𝑥𝑢 ↔ 𝒫 𝑥𝑈))
3 eleq2 2854 . . . . . 6 (𝑢 = 𝑈 → ({𝑥, 𝑦} ∈ 𝑢 ↔ {𝑥, 𝑦} ∈ 𝑈))
43raleqbi1dv 3335 . . . . 5 (𝑢 = 𝑈 → (∀𝑦𝑢 {𝑥, 𝑦} ∈ 𝑢 ↔ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈))
5 oveq1 7423 . . . . . 6 (𝑢 = 𝑈 → (𝑢m 𝑥) = (𝑈m 𝑥))
6 eleq2 2854 . . . . . 6 (𝑢 = 𝑈 → ( ran 𝑦𝑢 ran 𝑦𝑈))
75, 6raleqbidv 3340 . . . . 5 (𝑢 = 𝑈 → (∀𝑦 ∈ (𝑢m 𝑥) ran 𝑦𝑢 ↔ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈))
82, 4, 73anbi123d 1464 . . . 4 (𝑢 = 𝑈 → ((𝒫 𝑥𝑢 ∧ ∀𝑦𝑢 {𝑥, 𝑦} ∈ 𝑢 ∧ ∀𝑦 ∈ (𝑢m 𝑥) ran 𝑦𝑢) ↔ (𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈)))
98raleqbi1dv 3335 . . 3 (𝑢 = 𝑈 → (∀𝑥𝑢 (𝒫 𝑥𝑢 ∧ ∀𝑦𝑢 {𝑥, 𝑦} ∈ 𝑢 ∧ ∀𝑦 ∈ (𝑢m 𝑥) ran 𝑦𝑢) ↔ ∀𝑥𝑈 (𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈)))
101, 9anbi12d 644 . 2 (𝑢 = 𝑈 → ((Tr 𝑢 ∧ ∀𝑥𝑢 (𝒫 𝑥𝑢 ∧ ∀𝑦𝑢 {𝑥, 𝑦} ∈ 𝑢 ∧ ∀𝑦 ∈ (𝑢m 𝑥) ran 𝑦𝑢)) ↔ (Tr 𝑈 ∧ ∀𝑥𝑈 (𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈))))
11 df-gru 10787 . 2 Univ = {𝑢 ∣ (Tr 𝑢 ∧ ∀𝑥𝑢 (𝒫 𝑥𝑢 ∧ ∀𝑦𝑢 {𝑥, 𝑦} ∈ 𝑢 ∧ ∀𝑦 ∈ (𝑢m 𝑥) ran 𝑦𝑢))}
1210, 11elab2g 3641 1 (𝑈𝑉 → (𝑈 ∈ Univ ↔ (Tr 𝑈 ∧ ∀𝑥𝑈 (𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈))))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wb 209  wa 401  w3a 1103   = wceq 1570  wcel 2146  wral 3081  𝒫 cpw 4564  {cpr 4593   cuni 4874  Tr wtr 5220  ran crn 5664  (class class class)co 7416  m cmap 8826  Univcgru 10786
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 2148  ax-9 2156  ax-ext 2737
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-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3082  df-rex 3092  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-br 5112  df-tr 5221  df-iota 6496  df-fv 6548  df-ov 7419  df-gru 10787
This theorem is used by:  grutr  10789  grupw  10791  grupr  10793  gruurn  10794  intgru  10810  ingru  10811  grutsk1  10817  mnugrud  45027
  Copyright terms: Public domain W3C validator