| 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 3939 | . 2 ⊢ (𝐴 ⊆ ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ 𝜑)} ↔ ∀𝑥((𝐴 ⊆ 𝑥 ∧ 𝜑) → 𝐴 ⊆ 𝑥)) | |
| 2 | simpl 109 | . 2 ⊢ ((𝐴 ⊆ 𝑥 ∧ 𝜑) → 𝐴 ⊆ 𝑥) | |
| 3 | 1, 2 | mpgbir 1499 | 1 ⊢ 𝐴 ⊆ ∩ {𝑥 ∣ (𝐴 ⊆ 𝑥 ∧ 𝜑)} |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 {cab 2215 ⊆ wss 3197 ∩ cint 3922 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-v 2801 df-in 3203 df-ss 3210 df-int 3923 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |