Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > ssintub | GIF version |
Description: Subclass of the least upper bound. (Contributed by NM, 8-Aug-2000.) |
Ref | Expression |
---|---|
ssintub | ⊢ 𝐴 ⊆ ∩ {𝑥 ∈ 𝐵 ∣ 𝐴 ⊆ 𝑥} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssint 3823 | . 2 ⊢ (𝐴 ⊆ ∩ {𝑥 ∈ 𝐵 ∣ 𝐴 ⊆ 𝑥} ↔ ∀𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝐴 ⊆ 𝑥}𝐴 ⊆ 𝑦) | |
2 | sseq2 3152 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝐴 ⊆ 𝑥 ↔ 𝐴 ⊆ 𝑦)) | |
3 | 2 | elrab 2868 | . . 3 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝐴 ⊆ 𝑥} ↔ (𝑦 ∈ 𝐵 ∧ 𝐴 ⊆ 𝑦)) |
4 | 3 | simprbi 273 | . 2 ⊢ (𝑦 ∈ {𝑥 ∈ 𝐵 ∣ 𝐴 ⊆ 𝑥} → 𝐴 ⊆ 𝑦) |
5 | 1, 4 | mprgbir 2515 | 1 ⊢ 𝐴 ⊆ ∩ {𝑥 ∈ 𝐵 ∣ 𝐴 ⊆ 𝑥} |
Colors of variables: wff set class |
Syntax hints: ∈ wcel 2128 {crab 2439 ⊆ wss 3102 ∩ cint 3807 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1427 ax-7 1428 ax-gen 1429 ax-ie1 1473 ax-ie2 1474 ax-8 1484 ax-10 1485 ax-11 1486 ax-i12 1487 ax-bndl 1489 ax-4 1490 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2139 |
This theorem depends on definitions: df-bi 116 df-tru 1338 df-nf 1441 df-sb 1743 df-clab 2144 df-cleq 2150 df-clel 2153 df-nfc 2288 df-ral 2440 df-rab 2444 df-v 2714 df-in 3108 df-ss 3115 df-int 3808 |
This theorem is referenced by: intmin 3827 sscls 12520 |
Copyright terms: Public domain | W3C validator |