| 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 5299 | . . . 4 ⊢ (𝐴 ∈ 𝑈 → (𝐵 ∈ 𝒫 𝐴 ↔ 𝐵 ⊆ 𝐴)) | |
| 2 | 1 | adantl 487 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → (𝐵 ∈ 𝒫 𝐴 ↔ 𝐵 ⊆ 𝐴)) |
| 3 | grupw 10907 | . . . . 5 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → 𝒫 𝐴 ∈ 𝑈) | |
| 4 | gruelss 10906 | . . . . 5 ⊢ ((𝑈 ∈ Univ ∧ 𝒫 𝐴 ∈ 𝑈) → 𝒫 𝐴 ⊆ 𝑈) | |
| 5 | 3, 4 | syldan 603 | . . . 4 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → 𝒫 𝐴 ⊆ 𝑈) |
| 6 | 5 | sseld 3912 | . . 3 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → (𝐵 ∈ 𝒫 𝐴 → 𝐵 ∈ 𝑈)) |
| 7 | 2, 6 | sylbird 263 | . 2 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈) → (𝐵 ⊆ 𝐴 → 𝐵 ∈ 𝑈)) |
| 8 | 7 | 3impia 1135 | 1 ⊢ ((𝑈 ∈ Univ ∧ 𝐴 ∈ 𝑈 ∧ 𝐵 ⊆ 𝐴) → 𝐵 ∈ 𝑈) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 ∈ wcel 2147 ⊆ wss 3900 𝒫 cpw 4560 Univcgru 10902 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 ax-sep 5252 |
| 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-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-rab 3417 df-v 3456 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-br 5107 df-tr 5216 df-iota 6512 df-fv 6566 df-ov 7446 df-gru 10903 |
| This theorem is used by: grurn 10913 gruima 10914 gruxp 10919 grumap 10920 gruixp 10921 gruiin 10922 grudomon 10929 gruina 10930 gru0eld 45419 grur1cld 45422 grurankrcld 45424 grumnudlem 45461 |
| Copyright terms: Public domain | W3C validator |