| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iinxsng | Structured version Visualization version GIF version | ||
| Description: A singleton index picks out an instance of an indexed intersection's argument. (Contributed by NM, 15-Jan-2012.) (Proof shortened by Mario Carneiro, 17-Nov-2016.) |
| Ref | Expression |
|---|---|
| iinxsng.1 | ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) |
| Ref | Expression |
|---|---|
| iinxsng | ⊢ (𝐴 ∈ 𝑉 → ∩ 𝑥 ∈ {𝐴}𝐵 = 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-iin 4942 | . 2 ⊢ ∩ 𝑥 ∈ {𝐴}𝐵 = {𝑦 ∣ ∀𝑥 ∈ {𝐴}𝑦 ∈ 𝐵} | |
| 2 | iinxsng.1 | . . . . 5 ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) | |
| 3 | 2 | eleq2d 2838 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶)) |
| 4 | 3 | ralsng 4624 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥 ∈ {𝐴}𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶)) |
| 5 | 4 | eqabcdv 2886 | . 2 ⊢ (𝐴 ∈ 𝑉 → {𝑦 ∣ ∀𝑥 ∈ {𝐴}𝑦 ∈ 𝐵} = 𝐶) |
| 6 | 1, 5 | eqtrid 2799 | 1 ⊢ (𝐴 ∈ 𝑉 → ∩ 𝑥 ∈ {𝐴}𝐵 = 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1550 ∈ wcel 2132 {cab 2730 ∀wral 3066 {csn 4572 ∩ ciin 4940 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1805 ax-4 1819 ax-5 1920 ax-6 1977 ax-7 2018 ax-8 2134 ax-9 2142 ax-ext 2724 |
| This theorem depends on definitions: df-bi 209 df-an 399 df-tru 1553 df-ex 1790 df-sb 2081 df-clab 2731 df-cleq 2744 df-clel 2827 df-ral 3067 df-v 3446 df-sn 4573 df-iin 4942 |
| This theorem is referenced by: polatN 40493 |
| Copyright terms: Public domain | W3C validator |