Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cbviin | GIF version |
Description: Change bound variables in an indexed intersection. (Contributed by Jeff Hankins, 26-Aug-2009.) (Revised by Mario Carneiro, 14-Oct-2016.) |
Ref | Expression |
---|---|
cbviun.1 | ⊢ Ⅎ𝑦𝐵 |
cbviun.2 | ⊢ Ⅎ𝑥𝐶 |
cbviun.3 | ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶) |
Ref | Expression |
---|---|
cbviin | ⊢ ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑦 ∈ 𝐴 𝐶 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbviun.1 | . . . . 5 ⊢ Ⅎ𝑦𝐵 | |
2 | 1 | nfcri 2172 | . . . 4 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐵 |
3 | cbviun.2 | . . . . 5 ⊢ Ⅎ𝑥𝐶 | |
4 | 3 | nfcri 2172 | . . . 4 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐶 |
5 | cbviun.3 | . . . . 5 ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶) | |
6 | 5 | eleq2d 2107 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑧 ∈ 𝐵 ↔ 𝑧 ∈ 𝐶)) |
7 | 2, 4, 6 | cbvral 2529 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∀𝑦 ∈ 𝐴 𝑧 ∈ 𝐶) |
8 | 7 | abbii 2153 | . 2 ⊢ {𝑧 ∣ ∀𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} = {𝑧 ∣ ∀𝑦 ∈ 𝐴 𝑧 ∈ 𝐶} |
9 | df-iin 3660 | . 2 ⊢ ∩ 𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ ∀𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} | |
10 | df-iin 3660 | . 2 ⊢ ∩ 𝑦 ∈ 𝐴 𝐶 = {𝑧 ∣ ∀𝑦 ∈ 𝐴 𝑧 ∈ 𝐶} | |
11 | 8, 9, 10 | 3eqtr4i 2070 | 1 ⊢ ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑦 ∈ 𝐴 𝐶 |
Colors of variables: wff set class |
Syntax hints: → wi 4 = wceq 1243 ∈ wcel 1393 {cab 2026 Ⅎwnfc 2165 ∀wral 2306 ∩ ciin 3658 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-io 630 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-10 1396 ax-11 1397 ax-i12 1398 ax-bndl 1399 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-i5r 1428 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-tru 1246 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-nfc 2167 df-ral 2311 df-iin 3660 |
This theorem is referenced by: cbviinv 3697 |
Copyright terms: Public domain | W3C validator |