| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gruun | Structured version Visualization version GIF version | ||
| Description: A Grothendieck universe contains binary unions of its elements. (Contributed by Mario Carneiro, 9-Jun-2013.) |
| Ref | Expression |
|---|---|
| gruun | ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → (𝐴 ∪ 𝐵) ∈ 𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | uniprg 4890 | . . . 4 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵)) | |
| 2 | 1 | 3adant1 1148 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → ∪ {𝐴, 𝐵} = (𝐴 ∪ 𝐵)) |
| 3 | uniiun 5025 | . . 3 ⊢ ∪ {𝐴, 𝐵} = ∪ 𝑥 ∈ {𝐴, 𝐵}𝑥 | |
| 4 | 2, 3 | eqtr3di 2815 | . 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → (𝐴 ∪ 𝐵) = ∪ 𝑥 ∈ {𝐴, 𝐵}𝑥) |
| 5 | simp1 1154 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → 𝑈 ∈ Univ) | |
| 6 | grupr 10793 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → {𝐴, 𝐵} ∈ 𝑈) | |
| 7 | vex 3461 | . . . . . . 7 ⊢ 𝑥 ∈ V | |
| 8 | 7 | elpr 4616 | . . . . . 6 ⊢ (𝑥 ∈ {𝐴, 𝐵} ↔ (𝑥 = 𝐴 ∨ 𝑥 = 𝐵)) |
| 9 | eleq1a 2860 | . . . . . . 7 ⊢ (𝐴 ∈ 𝑈 → (𝑥 = 𝐴 → 𝑥 ∈ 𝑈)) | |
| 10 | eleq1a 2860 | . . . . . . 7 ⊢ (𝐵 ∈ 𝑈 → (𝑥 = 𝐵 → 𝑥 ∈ 𝑈)) | |
| 11 | 9, 10 | jaao 969 | . . . . . 6 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → ((𝑥 = 𝐴 ∨ 𝑥 = 𝐵) → 𝑥 ∈ 𝑈)) |
| 12 | 8, 11 | biimtrid 245 | . . . . 5 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → (𝑥 ∈ {𝐴, 𝐵} → 𝑥 ∈ 𝑈)) |
| 13 | 12 | ralrimiv 3158 | . . . 4 ⊢ ((𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → ∀𝑥 ∈ {𝐴, 𝐵}𝑥 ∈ 𝑈) |
| 14 | 13 | 3adant1 1148 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → ∀𝑥 ∈ {𝐴, 𝐵}𝑥 ∈ 𝑈) |
| 15 | gruiun 10795 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ {𝐴, 𝐵} ∈ 𝑈 ∧ ∀𝑥 ∈ {𝐴, 𝐵}𝑥 ∈ 𝑈) → ∪ 𝑥 ∈ {𝐴, 𝐵}𝑥 ∈ 𝑈) | |
| 16 | 5, 6, 14, 15 | syl3anc 1398 | . 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → ∪ 𝑥 ∈ {𝐴, 𝐵}𝑥 ∈ 𝑈) |
| 17 | 4, 16 | eqeltrd 2865 | 1 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ∈ 𝑈) → (𝐴 ∪ 𝐵) ∈ 𝑈) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∨ wo 861 ∧ w3a 1103 = wceq 1570 ∈ wcel 2146 ∀wral 3081 ∪ cun 3904 {cpr 4593 ∪ cuni 4874 ∪ ciun 4958 Univcgru 10786 |
| 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 2148 ax-9 2156 ax-10 2179 ax-11 2195 ax-12 2216 ax-ext 2737 ax-sep 5259 ax-pow 5338 ax-pr 5406 ax-un 7738 |
| 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-nf 1817 df-sb 2100 df-mo 2569 df-eu 2599 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-ral 3082 df-rex 3092 df-rab 3419 df-v 3459 df-sbc 3747 df-dif 3909 df-un 3911 df-in 3913 df-ss 3923 df-nul 4287 df-if 4490 df-pw 4566 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4875 df-iun 4960 df-br 5112 df-opab 5176 df-mpt 5195 df-tr 5221 df-id 5558 df-xp 5669 df-rel 5670 df-cnv 5671 df-co 5672 df-dm 5673 df-rn 5674 df-res 5675 df-ima 5676 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-fv 6548 df-ov 7419 df-oprab 7420 df-mpo 7421 df-map 8828 df-gru 10787 |
| This theorem is used by: gruxp 10803 grusucd 44987 grumnudlem 45028 |
| Copyright terms: Public domain | W3C validator |