| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ssmin | GIF version | ||
| Description: Subclass of the minimum value of class of supersets. (Contributed by NM, 10-Aug-2006.) |
| Ref | Expression |
|---|---|
| ssmin | ⊢ 𝐴 ⊆ ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ 𝜑)} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssintab 3985 | . 2 ⊢ (𝐴 ⊆ ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ 𝜑)} ↔ ∀𝑥((𝐴 ⊆ 𝑥 ∧ 𝜑) → 𝐴 ⊆ 𝑥)) | |
| 2 | simpl 109 | . 2 ⊢ ((𝐴 ⊆ 𝑥 ∧ 𝜑) → 𝐴 ⊆ 𝑥) | |
| 3 | 1, 2 | mpgbir 1506 | 1 ⊢ 𝐴 ⊆ ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ 𝜑)} |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 {cab 2224 ⊆ wss 3220 ∩ cint 3968 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 721 ax-5 1500 ax-7 1501 ax-gen 1502 ax-ie1 1546 ax-ie2 1547 ax-8 1557 ax-10 1558 ax-11 1559 ax-i12 1560 ax-bndl 1562 ax-4 1563 ax-17 1579 ax-i9 1583 ax-ial 1587 ax-i5r 1588 ax-ext 2220 |
| This theorem depends on definitions: df-bi 117 df-tru 1405 df-nf 1514 df-sb 1816 df-clab 2225 df-cleq 2231 df-clel 2234 df-nfc 2381 df-ral 2533 df-v 2823 df-in 3226 df-ss 3233 df-int 3969 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |