![]() |
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 4789 | . 2 ⊢ ∩ 𝑥 ∈ {𝐴}𝐵 = {𝑦 ∣ ∀𝑥 ∈ {𝐴}𝑦 ∈ 𝐵} | |
2 | iinxsng.1 | . . . . 5 ⊢ (𝑥 = 𝐴 → 𝐵 = 𝐶) | |
3 | 2 | eleq2d 2845 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶)) |
4 | 3 | ralsng 4481 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (∀𝑥 ∈ {𝐴}𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐶)) |
5 | 4 | abbi1dv 2898 | . 2 ⊢ (𝐴 ∈ 𝑉 → {𝑦 ∣ ∀𝑥 ∈ {𝐴}𝑦 ∈ 𝐵} = 𝐶) |
6 | 1, 5 | syl5eq 2820 | 1 ⊢ (𝐴 ∈ 𝑉 → ∩ 𝑥 ∈ {𝐴}𝐵 = 𝐶) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1507 ∈ wcel 2050 {cab 2752 ∀wral 3082 {csn 4435 ∩ ciin 4787 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1758 ax-4 1772 ax-5 1869 ax-6 1928 ax-7 1965 ax-8 2052 ax-9 2059 ax-10 2079 ax-11 2093 ax-12 2106 ax-ext 2744 |
This theorem depends on definitions: df-bi 199 df-an 388 df-or 834 df-3an 1070 df-tru 1510 df-ex 1743 df-nf 1747 df-sb 2016 df-clab 2753 df-cleq 2765 df-clel 2840 df-nfc 2912 df-ral 3087 df-v 3411 df-sbc 3676 df-sn 4436 df-iin 4789 |
This theorem is referenced by: polatN 36512 |
Copyright terms: Public domain | W3C validator |