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 4802 | . . 3 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → 〈𝐴, 𝐵〉 = {{𝐴}, {𝐴, 𝐵}}) | |
2 | 1 | 3adant1 1129 | . 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → 〈𝐴, 𝐵〉 = {{𝐴}, {𝐴, 𝐵}}) |
3 | simp1 1135 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → 𝑈 ∈ Univ) | |
4 | grusn 10560 | . . . 4 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → {𝐴} ∈ 𝑈) | |
5 | 4 | 3adant3 1131 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → {𝐴} ∈ 𝑈) |
6 | grupr 10553 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → {𝐴, 𝐵} ∈ 𝑈) | |
7 | grupr 10553 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ {𝐴} ∈ 𝑈 ∧ {𝐴, 𝐵} ∈ 𝑈) → {{𝐴}, {𝐴, 𝐵}} ∈ 𝑈) | |
8 | 3, 5, 6, 7 | syl3anc 1370 | . 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → {{𝐴}, {𝐴, 𝐵}} ∈ 𝑈) |
9 | 2, 8 | eqeltrd 2839 | 1 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → 〈𝐴, 𝐵〉 ∈ 𝑈) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 {csn 4561 {cpr 4563 〈cop 4567 Univcgru 10546 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-ral 3069 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-tr 5192 df-iota 6391 df-fv 6441 df-ov 7278 df-gru 10547 |
This theorem is referenced by: gruf 10567 |
Copyright terms: Public domain | W3C validator |