| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > intmin2 | Structured version Visualization version GIF version | ||
| Description: Any set is the smallest of all sets that include it. (Contributed by NM, 20-Sep-2003.) |
| Ref | Expression |
|---|---|
| intmin2.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| intmin2 | ⊢ ∩ {𝑥 ∣ 𝐴 ⊆ 𝑥} = 𝐴 |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rabab 3483 | . . 3 ⊢ {𝑥 ∈ V ∣ 𝐴 ⊆ 𝑥} = {𝑥 ∣ 𝐴 ⊆ 𝑥} | |
| 2 | 1 | inteqi 4908 | . 2 ⊢ ∩ {𝑥 ∈ V ∣ 𝐴 ⊆ 𝑥} = ∩ {𝑥 ∣ 𝐴 ⊆ 𝑥} |
| 3 | intmin2.1 | . . 3 ⊢ 𝐴 ∈ V | |
| 4 | intmin 4925 | . . 3 ⊢ (𝐴 ∈ V → ∩ {𝑥 ∈ V ∣ 𝐴 ⊆ 𝑥} = 𝐴) | |
| 5 | 3, 4 | ax-mp 5 | . 2 ⊢ ∩ {𝑥 ∈ V ∣ 𝐴 ⊆ 𝑥} = 𝐴 |
| 6 | 2, 5 | eqtr3i 2786 | 1 ⊢ ∩ {𝑥 ∣ 𝐴 ⊆ 𝑥} = 𝐴 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1559 ∈ wcel 2141 {cab 2739 {crab 3413 Vcvv 3453 ⊆ wss 3904 ∩ cint 4904 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-tru 1562 df-ex 1799 df-nf 1803 df-sb 2090 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3076 df-rex 3086 df-rab 3414 df-v 3455 df-ss 3921 df-int 4905 |
| This theorem is referenced by: dfid7 44152 |
| Copyright terms: Public domain | W3C validator |