Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iinxprg | Structured version Visualization version GIF version |
Description: Indexed intersection with an unordered pair index. (Contributed by NM, 25-Jan-2012.) |
Ref | Expression |
---|---|
iinxprg.1 | ⊢ (𝑥 = 𝐴 → 𝐶 = 𝐷) |
iinxprg.2 | ⊢ (𝑥 = 𝐵 → 𝐶 = 𝐸) |
Ref | Expression |
---|---|
iinxprg | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∩ 𝑥 ∈ {𝐴, 𝐵}𝐶 = (𝐷 ∩ 𝐸)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | iinxprg.1 | . . . . 5 ⊢ (𝑥 = 𝐴 → 𝐶 = 𝐷) | |
2 | 1 | eleq2d 2898 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑦 ∈ 𝐶 ↔ 𝑦 ∈ 𝐷)) |
3 | iinxprg.2 | . . . . 5 ⊢ (𝑥 = 𝐵 → 𝐶 = 𝐸) | |
4 | 3 | eleq2d 2898 | . . . 4 ⊢ (𝑥 = 𝐵 → (𝑦 ∈ 𝐶 ↔ 𝑦 ∈ 𝐸)) |
5 | 2, 4 | ralprg 4632 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∀𝑥 ∈ {𝐴, 𝐵}𝑦 ∈ 𝐶 ↔ (𝑦 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸))) |
6 | 5 | abbidv 2885 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → {𝑦 ∣ ∀𝑥 ∈ {𝐴, 𝐵}𝑦 ∈ 𝐶} = {𝑦 ∣ (𝑦 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸)}) |
7 | df-iin 4922 | . 2 ⊢ ∩ 𝑥 ∈ {𝐴, 𝐵}𝐶 = {𝑦 ∣ ∀𝑥 ∈ {𝐴, 𝐵}𝑦 ∈ 𝐶} | |
8 | df-in 3943 | . 2 ⊢ (𝐷 ∩ 𝐸) = {𝑦 ∣ (𝑦 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸)} | |
9 | 6, 7, 8 | 3eqtr4g 2881 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∩ 𝑥 ∈ {𝐴, 𝐵}𝐶 = (𝐷 ∩ 𝐸)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 ∈ wcel 2114 {cab 2799 ∀wral 3138 ∩ cin 3935 {cpr 4569 ∩ ciin 4920 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-v 3496 df-sbc 3773 df-un 3941 df-in 3943 df-sn 4568 df-pr 4570 df-iin 4922 |
This theorem is referenced by: pmapmeet 36924 diameetN 38207 dihmeetlem2N 38450 dihmeetcN 38453 dihmeet 38494 |
Copyright terms: Public domain | W3C validator |