| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > intidOLD | Structured version Visualization version GIF version | ||
| Description: Obsolete version of intidg 5432 as of 18-Jan-2025. (Contributed by NM, 5-Jun-2009.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| intid.1 | ⊢ 𝐴 ∈ V |
| Ref | Expression |
|---|---|
| intidOLD | ⊢ ∩ {𝑥 ∣ 𝐴 ∈ 𝑥} = {𝐴} |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | snex 5406 | . . 3 ⊢ {𝐴} ∈ V | |
| 2 | eleq2 2823 | . . . 4 ⊢ (𝑥 = {𝐴} → (𝐴 ∈ 𝑥 ↔ 𝐴 ∈ {𝐴})) | |
| 3 | intid.1 | . . . . 5 ⊢ 𝐴 ∈ V | |
| 4 | 3 | snid 4638 | . . . 4 ⊢ 𝐴 ∈ {𝐴} |
| 5 | 2, 4 | intmin3 4952 | . . 3 ⊢ ({𝐴} ∈ V → ∩ {𝑥 ∣ 𝐴 ∈ 𝑥} ⊆ {𝐴}) |
| 6 | 1, 5 | ax-mp 5 | . 2 ⊢ ∩ {𝑥 ∣ 𝐴 ∈ 𝑥} ⊆ {𝐴} |
| 7 | 3 | elintab 4934 | . . . 4 ⊢ (𝐴 ∈ ∩ {𝑥 ∣ 𝐴 ∈ 𝑥} ↔ ∀𝑥(𝐴 ∈ 𝑥 → 𝐴 ∈ 𝑥)) |
| 8 | id 22 | . . . 4 ⊢ (𝐴 ∈ 𝑥 → 𝐴 ∈ 𝑥) | |
| 9 | 7, 8 | mpgbir 1799 | . . 3 ⊢ 𝐴 ∈ ∩ {𝑥 ∣ 𝐴 ∈ 𝑥} |
| 10 | snssi 4784 | . . 3 ⊢ (𝐴 ∈ ∩ {𝑥 ∣ 𝐴 ∈ 𝑥} → {𝐴} ⊆ ∩ {𝑥 ∣ 𝐴 ∈ 𝑥}) | |
| 11 | 9, 10 | ax-mp 5 | . 2 ⊢ {𝐴} ⊆ ∩ {𝑥 ∣ 𝐴 ∈ 𝑥} |
| 12 | 6, 11 | eqssi 3975 | 1 ⊢ ∩ {𝑥 ∣ 𝐴 ∈ 𝑥} = {𝐴} |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ∈ wcel 2108 {cab 2713 Vcvv 3459 ⊆ wss 3926 {csn 4601 ∩ cint 4922 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-sep 5266 ax-nul 5276 ax-pr 5402 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-clab 2714 df-cleq 2727 df-clel 2809 df-ral 3052 df-v 3461 df-dif 3929 df-un 3931 df-ss 3943 df-nul 4309 df-sn 4602 df-pr 4604 df-int 4923 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |