| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gruop | Structured version Visualization version GIF version | ||
| Description: A Grothendieck universe contains ordered pairs of its elements. (Contributed by Mario Carneiro, 10-Jun-2013.) |
| Ref | Expression |
|---|---|
| gruop | ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → 〈𝐴, 𝐵〉 ∈ 𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dfopg 4823 | . . 3 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → 〈𝐴, 𝐵〉 = {{𝐴}, {𝐴, 𝐵}}) | |
| 2 | 1 | 3adant1 1139 | . 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → 〈𝐴, 𝐵〉 = {{𝐴}, {𝐴, 𝐵}}) |
| 3 | simp1 1145 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → 𝑈 ∈ Univ) | |
| 4 | grusn 10752 | . . . 4 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → {𝐴} ∈ 𝑈) | |
| 5 | 4 | 3adant3 1141 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → {𝐴} ∈ 𝑈) |
| 6 | grupr 10745 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → {𝐴, 𝐵} ∈ 𝑈) | |
| 7 | grupr 10745 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ {𝐴} ∈ 𝑈 ∧ {𝐴, 𝐵} ∈ 𝑈) → {{𝐴}, {𝐴, 𝐵}} ∈ 𝑈) | |
| 8 | 3, 5, 6, 7 | syl3anc 1386 | . 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → {{𝐴}, {𝐴, 𝐵}} ∈ 𝑈) |
| 9 | 2, 8 | eqeltrd 2856 | 1 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → 〈𝐴, 𝐵〉 ∈ 𝑈) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1095 = wceq 1554 ∈ wcel 2136 {csn 4576 {cpr 4578 〈cop 4582 Univcgru 10738 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1809 ax-4 1823 ax-5 1924 ax-6 1981 ax-7 2022 ax-8 2138 ax-9 2146 ax-ext 2728 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-or 857 df-3an 1097 df-tru 1557 df-fal 1567 df-ex 1794 df-sb 2085 df-clab 2735 df-cleq 2748 df-clel 2831 df-ral 3071 df-rex 3081 df-rab 3409 df-v 3450 df-dif 3902 df-un 3904 df-ss 3916 df-nul 4281 df-if 4475 df-sn 4577 df-pr 4579 df-op 4583 df-uni 4860 df-br 5095 df-tr 5202 df-iota 6466 df-fv 6518 df-ov 7388 df-gru 10739 |
| This theorem is referenced by: gruf 10759 |
| Copyright terms: Public domain | W3C validator |