![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > iinxprg | 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 2247 | . . . 4 ⊢ (𝑥 = 𝐴 → (𝑦 ∈ 𝐶 ↔ 𝑦 ∈ 𝐷)) |
3 | iinxprg.2 | . . . . 5 ⊢ (𝑥 = 𝐵 → 𝐶 = 𝐸) | |
4 | 3 | eleq2d 2247 | . . . 4 ⊢ (𝑥 = 𝐵 → (𝑦 ∈ 𝐶 ↔ 𝑦 ∈ 𝐸)) |
5 | 2, 4 | ralprg 3643 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → (∀𝑥 ∈ {𝐴, 𝐵}𝑦 ∈ 𝐶 ↔ (𝑦 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸))) |
6 | 5 | abbidv 2295 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → {𝑦 ∣ ∀𝑥 ∈ {𝐴, 𝐵}𝑦 ∈ 𝐶} = {𝑦 ∣ (𝑦 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸)}) |
7 | df-iin 3889 | . 2 ⊢ ∩ 𝑥 ∈ {𝐴, 𝐵}𝐶 = {𝑦 ∣ ∀𝑥 ∈ {𝐴, 𝐵}𝑦 ∈ 𝐶} | |
8 | df-in 3135 | . 2 ⊢ (𝐷 ∩ 𝐸) = {𝑦 ∣ (𝑦 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸)} | |
9 | 6, 7, 8 | 3eqtr4g 2235 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊) → ∩ 𝑥 ∈ {𝐴, 𝐵}𝐶 = (𝐷 ∩ 𝐸)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 = wceq 1353 ∈ wcel 2148 {cab 2163 ∀wral 2455 ∩ cin 3128 {cpr 3593 ∩ ciin 3887 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-ext 2159 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-v 2739 df-sbc 2963 df-un 3133 df-in 3135 df-sn 3598 df-pr 3599 df-iin 3889 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |