| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > gruss | Structured version Visualization version GIF version | ||
| Description: Any subset of an element of a Grothendieck universe is also an element. (Contributed by Mario Carneiro, 9-Jun-2013.) |
| Ref | Expression |
|---|---|
| gruss | ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ⊆ 𝐴) → 𝐵 ∈ 𝑈) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | elpw2g 5269 | . . . 4 ⊢ (𝐴 ∈ 𝑈 → (𝐵 ∈ 𝒫 𝐴 ↔ 𝐵 ⊆ 𝐴)) | |
| 2 | 1 | adantl 481 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → (𝐵 ∈ 𝒫 𝐴 ↔ 𝐵 ⊆ 𝐴)) |
| 3 | grupw 10678 | . . . . 5 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → 𝒫 𝐴 ∈ 𝑈) | |
| 4 | gruelss 10677 | . . . . 5 ⊢ ((𝑈 ∈ Univ ∧ 𝒫 𝐴 ∈ 𝑈) → 𝒫 𝐴 ⊆ 𝑈) | |
| 5 | 3, 4 | syldan 591 | . . . 4 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → 𝒫 𝐴 ⊆ 𝑈) |
| 6 | 5 | sseld 3931 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → (𝐵 ∈ 𝒫 𝐴 → 𝐵 ∈ 𝑈)) |
| 7 | 2, 6 | sylbird 260 | . 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → (𝐵 ⊆ 𝐴 → 𝐵 ∈ 𝑈)) |
| 8 | 7 | 3impia 1117 | 1 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ⊆ 𝐴) → 𝐵 ∈ 𝑈) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 ∈ wcel 2110 ⊆ wss 3900 𝒫 cpw 4548 Univcgru 10673 |
| 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 1968 ax-7 2009 ax-8 2112 ax-9 2120 ax-ext 2702 ax-sep 5232 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-sb 2067 df-clab 2709 df-cleq 2722 df-clel 2804 df-ral 3046 df-rex 3055 df-rab 3394 df-v 3436 df-dif 3903 df-un 3905 df-in 3907 df-ss 3917 df-nul 4282 df-if 4474 df-pw 4550 df-sn 4575 df-pr 4577 df-op 4581 df-uni 4858 df-br 5090 df-tr 5197 df-iota 6433 df-fv 6485 df-ov 7344 df-gru 10674 |
| This theorem is referenced by: grurn 10684 gruima 10685 gruxp 10690 grumap 10691 gruixp 10692 gruiin 10693 grudomon 10700 gruina 10701 gru0eld 44241 grur1cld 44244 grurankrcld 44246 grumnudlem 44297 |
| Copyright terms: Public domain | W3C validator |