| 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 3460 | . . 3 ⊢ {𝑥 ∈ V ∣ 𝐴 ⊆ 𝑥} = {𝑥 ∣ 𝐴 ⊆ 𝑥} | |
| 2 | 1 | inteqi 4893 | . 2 ⊢ ∩ {𝑥 ∈ V ∣ 𝐴 ⊆ 𝑥} = ∩ {𝑥 ∣ 𝐴 ⊆ 𝑥} |
| 3 | intmin2.1 | . . 3 ⊢ 𝐴 ∈ V | |
| 4 | intmin 4910 | . . 3 ⊢ (𝐴 ∈ V → ∩ {𝑥 ∈ V ∣ 𝐴 ⊆ 𝑥} = 𝐴) | |
| 5 | 3, 4 | ax-mp 5 | . 2 ⊢ ∩ {𝑥 ∈ V ∣ 𝐴 ⊆ 𝑥} = 𝐴 |
| 6 | 2, 5 | eqtr3i 2761 | 1 ⊢ ∩ {𝑥 ∣ 𝐴 ⊆ 𝑥} = 𝐴 |
| Colors of variables: wff setvar class |
| Syntax hints: = wceq 1542 ∈ wcel 2114 {cab 2714 {crab 3389 Vcvv 3429 ⊆ wss 3889 ∩ cint 4889 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-tru 1545 df-ex 1782 df-nf 1786 df-sb 2069 df-clab 2715 df-cleq 2728 df-clel 2811 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-ss 3906 df-int 4890 |
| This theorem is referenced by: dfid7 44039 |
| Copyright terms: Public domain | W3C validator |