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

Theorem grupr 10757
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 10752 . . . . . . 7 (𝑈 ∈ Univ → (𝑈 ∈ Univ ↔ (Tr 𝑈 ∧ ∀𝑥𝑈 (𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈))))
21ibi 267 . . . . . 6 (𝑈 ∈ Univ → (Tr 𝑈 ∧ ∀𝑥𝑈 (𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈)))
32simprd 495 . . . . 5 (𝑈 ∈ Univ → ∀𝑥𝑈 (𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈))
4 preq2 4701 . . . . . . . . . 10 (𝑦 = 𝐵 → {𝑥, 𝑦} = {𝑥, 𝐵})
54eleq1d 2814 . . . . . . . . 9 (𝑦 = 𝐵 → ({𝑥, 𝑦} ∈ 𝑈 ↔ {𝑥, 𝐵} ∈ 𝑈))
65rspccv 3588 . . . . . . . 8 (∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 → (𝐵𝑈 → {𝑥, 𝐵} ∈ 𝑈))
763ad2ant2 1134 . . . . . . 7 ((𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈) → (𝐵𝑈 → {𝑥, 𝐵} ∈ 𝑈))
87com12 32 . . . . . 6 (𝐵𝑈 → ((𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈) → {𝑥, 𝐵} ∈ 𝑈))
98ralimdv 3148 . . . . 5 (𝐵𝑈 → (∀𝑥𝑈 (𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈) → ∀𝑥𝑈 {𝑥, 𝐵} ∈ 𝑈))
103, 9syl5com 31 . . . 4 (𝑈 ∈ Univ → (𝐵𝑈 → ∀𝑥𝑈 {𝑥, 𝐵} ∈ 𝑈))
11 preq1 4700 . . . . . 6 (𝑥 = 𝐴 → {𝑥, 𝐵} = {𝐴, 𝐵})
1211eleq1d 2814 . . . . 5 (𝑥 = 𝐴 → ({𝑥, 𝐵} ∈ 𝑈 ↔ {𝐴, 𝐵} ∈ 𝑈))
1312rspccv 3588 . . . 4 (∀𝑥𝑈 {𝑥, 𝐵} ∈ 𝑈 → (𝐴𝑈 → {𝐴, 𝐵} ∈ 𝑈))
1410, 13syl6 35 . . 3 (𝑈 ∈ Univ → (𝐵𝑈 → (𝐴𝑈 → {𝐴, 𝐵} ∈ 𝑈)))
1514com23 86 . 2 (𝑈 ∈ Univ → (𝐴𝑈 → (𝐵𝑈 → {𝐴, 𝐵} ∈ 𝑈)))
16153imp 1110 1 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐵𝑈) → {𝐴, 𝐵} ∈ 𝑈)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  w3a 1086   = wceq 1540  wcel 2109  wral 3045  𝒫 cpw 4566  {cpr 4594   cuni 4874  Tr wtr 5217  ran crn 5642  (class class class)co 7390  m cmap 8802  Univcgru 10750
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-ext 2702
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-clab 2709  df-cleq 2722  df-clel 2804  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-br 5111  df-tr 5218  df-iota 6467  df-fv 6522  df-ov 7393  df-gru 10751
This theorem is referenced by:  grusn  10764  gruop  10765  gruun  10766  gruwun  10773  intgru  10774
  Copyright terms: Public domain W3C validator