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

Theorem grupr 10809
Description: A Grothendieck universe contains pairs derived from its elements. (Contributed by Mario Carneiro, 9-Jun-2013.)
Assertion
Ref Expression
grupr ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐵𝑈) → {𝐴, 𝐵} ∈ 𝑈)

Proof of Theorem grupr
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elgrug 10804 . . . . . . 7 (𝑈 ∈ Univ → (𝑈 ∈ Univ ↔ (Tr 𝑈 ∧ ∀𝑥𝑈 (𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈))))
21ibi 270 . . . . . 6 (𝑈 ∈ Univ → (Tr 𝑈 ∧ ∀𝑥𝑈 (𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈)))
32simprd 501 . . . . 5 (𝑈 ∈ Univ → ∀𝑥𝑈 (𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈))
4 preq2 4698 . . . . . . . . . 10 (𝑦 = 𝐵 → {𝑥, 𝑦} = {𝑥, 𝐵})
54eleq1d 2847 . . . . . . . . 9 (𝑦 = 𝐵 → ({𝑥, 𝑦} ∈ 𝑈 ↔ {𝑥, 𝐵} ∈ 𝑈))
65rspccv 3576 . . . . . . . 8 (∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 → (𝐵𝑈 → {𝑥, 𝐵} ∈ 𝑈))
763ad2ant2 1152 . . . . . . 7 ((𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈) → (𝐵𝑈 → {𝑥, 𝐵} ∈ 𝑈))
87com12 33 . . . . . 6 (𝐵𝑈 → ((𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈) → {𝑥, 𝐵} ∈ 𝑈))
98ralimdv 3178 . . . . 5 (𝐵𝑈 → (∀𝑥𝑈 (𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈) → ∀𝑥𝑈 {𝑥, 𝐵} ∈ 𝑈))
103, 9syl5com 32 . . . 4 (𝑈 ∈ Univ → (𝐵𝑈 → ∀𝑥𝑈 {𝑥, 𝐵} ∈ 𝑈))
11 preq1 4697 . . . . . 6 (𝑥 = 𝐴 → {𝑥, 𝐵} = {𝐴, 𝐵})
1211eleq1d 2847 . . . . 5 (𝑥 = 𝐴 → ({𝑥, 𝐵} ∈ 𝑈 ↔ {𝐴, 𝐵} ∈ 𝑈))
1312rspccv 3576 . . . 4 (∀𝑥𝑈 {𝑥, 𝐵} ∈ 𝑈 → (𝐴𝑈 → {𝐴, 𝐵} ∈ 𝑈))
1410, 13syl6 36 . . 3 (𝑈 ∈ Univ → (𝐵𝑈 → (𝐴𝑈 → {𝐴, 𝐵} ∈ 𝑈)))
1514com23 87 . 2 (𝑈 ∈ Univ → (𝐴𝑈 → (𝐵𝑈 → {𝐴, 𝐵} ∈ 𝑈)))
16153imp 1128 1 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐵𝑈) → {𝐴, 𝐵} ∈ 𝑈)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401  w3a 1103   = wceq 1570  wcel 2145  wral 3078  𝒫 cpw 4560  {cpr 4589   cuni 4870  Tr wtr 5216  ran crn 5660  (class class class)co 7416  m cmap 8829  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-ext 2734
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 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-tr 5217  df-iota 6493  df-fv 6545  df-ov 7419  df-gru 10803
This theorem is used by:  grusn  10816  gruop  10817  gruun  10818  gruwun  10825  intgru  10826
  Copyright terms: Public domain W3C validator