![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ssintub | Structured version Visualization version GIF version |
Description: Subclass of the least upper bound. (Contributed by NM, 8-Aug-2000.) |
Ref | Expression |
---|---|
ssintub | ⊢ 𝐴 ⊆ ∩ {𝑥 ∈ 𝐵 ∣ 𝐴 ⊆ 𝑥} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssint 4854 | . 2 ⊢ (𝐴 ⊆ ∩ {𝑥 ∈ 𝐵 ∣ 𝐴 ⊆ 𝑥} ↔ ∀𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝐴 ⊆ 𝑥}𝐴 ⊆ 𝑦) | |
2 | sseq2 3941 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝐴 ⊆ 𝑥 ↔ 𝐴 ⊆ 𝑦)) | |
3 | 2 | elrab 3628 | . . 3 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝐴 ⊆ 𝑥} ↔ (𝑦 ∈ 𝐵 ∧ 𝐴 ⊆ 𝑦)) |
4 | 3 | simprbi 500 | . 2 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝐴 ⊆ 𝑥} → 𝐴 ⊆ 𝑦) |
5 | 1, 4 | mprgbir 3121 | 1 ⊢ 𝐴 ⊆ ∩ {𝑥 ∈ 𝐵 ∣ 𝐴 ⊆ 𝑥} |
Colors of variables: wff setvar class |
Syntax hints: ∈ wcel 2111 {crab 3110 ⊆ wss 3881 ∩ cint 4838 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rab 3115 df-v 3443 df-in 3888 df-ss 3898 df-int 4839 |
This theorem is referenced by: intmin 4858 wuncid 10154 mrcssid 16880 lspssid 19750 lbsextlem3 19925 aspssid 20564 sscls 21661 filufint 22525 spanss2 29128 shsval2i 29170 ococin 29191 chsupsn 29196 sssigagen 31514 dynkin 31536 igenss 35500 pclssidN 37191 dochocss 38662 rgspnssid 40114 |
Copyright terms: Public domain | W3C validator |