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

Theorem grupr 10221
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 10216 . . . . . . 7 (𝑈 ∈ Univ → (𝑈 ∈ Univ ↔ (Tr 𝑈 ∧ ∀𝑥𝑈 (𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈))))
21ibi 269 . . . . . 6 (𝑈 ∈ Univ → (Tr 𝑈 ∧ ∀𝑥𝑈 (𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈)))
32simprd 498 . . . . 5 (𝑈 ∈ Univ → ∀𝑥𝑈 (𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈))
4 preq2 4672 . . . . . . . . . 10 (𝑦 = 𝐵 → {𝑥, 𝑦} = {𝑥, 𝐵})
54eleq1d 2899 . . . . . . . . 9 (𝑦 = 𝐵 → ({𝑥, 𝑦} ∈ 𝑈 ↔ {𝑥, 𝐵} ∈ 𝑈))
65rspccv 3622 . . . . . . . 8 (∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 → (𝐵𝑈 → {𝑥, 𝐵} ∈ 𝑈))
763ad2ant2 1130 . . . . . . 7 ((𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈) → (𝐵𝑈 → {𝑥, 𝐵} ∈ 𝑈))
87com12 32 . . . . . 6 (𝐵𝑈 → ((𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈) → {𝑥, 𝐵} ∈ 𝑈))
98ralimdv 3180 . . . . 5 (𝐵𝑈 → (∀𝑥𝑈 (𝒫 𝑥𝑈 ∧ ∀𝑦𝑈 {𝑥, 𝑦} ∈ 𝑈 ∧ ∀𝑦 ∈ (𝑈m 𝑥) ran 𝑦𝑈) → ∀𝑥𝑈 {𝑥, 𝐵} ∈ 𝑈))
103, 9syl5com 31 . . . 4 (𝑈 ∈ Univ → (𝐵𝑈 → ∀𝑥𝑈 {𝑥, 𝐵} ∈ 𝑈))
11 preq1 4671 . . . . . 6 (𝑥 = 𝐴 → {𝑥, 𝐵} = {𝐴, 𝐵})
1211eleq1d 2899 . . . . 5 (𝑥 = 𝐴 → ({𝑥, 𝐵} ∈ 𝑈 ↔ {𝐴, 𝐵} ∈ 𝑈))
1312rspccv 3622 . . . 4 (∀𝑥𝑈 {𝑥, 𝐵} ∈ 𝑈 → (𝐴𝑈 → {𝐴, 𝐵} ∈ 𝑈))
1410, 13syl6 35 . . 3 (𝑈 ∈ Univ → (𝐵𝑈 → (𝐴𝑈 → {𝐴, 𝐵} ∈ 𝑈)))
1514com23 86 . 2 (𝑈 ∈ Univ → (𝐴𝑈 → (𝐵𝑈 → {𝐴, 𝐵} ∈ 𝑈)))
16153imp 1107 1 ((𝑈 ∈ Univ ∧ 𝐴𝑈𝐵𝑈) → {𝐴, 𝐵} ∈ 𝑈)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  w3a 1083   = wceq 1537  wcel 2114  wral 3140  𝒫 cpw 4541  {cpr 4571   cuni 4840  Tr wtr 5174  ran crn 5558  (class class class)co 7158  m cmap 8408  Univcgru 10214
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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rab 3149  df-v 3498  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-br 5069  df-tr 5175  df-iota 6316  df-fv 6365  df-ov 7161  df-gru 10215
This theorem is referenced by:  grusn  10228  gruop  10229  gruun  10230  gruwun  10237  intgru  10238
  Copyright terms: Public domain W3C validator