Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cbviin | Structured version Visualization version GIF version |
Description: Change bound variables in an indexed intersection. (Contributed by Jeff Hankins, 26-Aug-2009.) (Revised by Mario Carneiro, 14-Oct-2016.) Add disjoint variable condition to avoid ax-13 2390. See cbviing 4966 for a less restrictive version requiring more axioms. (Revised by Gino Giotto, 20-Jan-2024.) |
Ref | Expression |
---|---|
cbviun.1 | ⊢ Ⅎ𝑦𝐵 |
cbviun.2 | ⊢ Ⅎ𝑥𝐶 |
cbviun.3 | ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶) |
Ref | Expression |
---|---|
cbviin | ⊢ ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑦 ∈ 𝐴 𝐶 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbviun.1 | . . . . 5 ⊢ Ⅎ𝑦𝐵 | |
2 | 1 | nfcri 2973 | . . . 4 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐵 |
3 | cbviun.2 | . . . . 5 ⊢ Ⅎ𝑥𝐶 | |
4 | 3 | nfcri 2973 | . . . 4 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐶 |
5 | cbviun.3 | . . . . 5 ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶) | |
6 | 5 | eleq2d 2900 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑧 ∈ 𝐵 ↔ 𝑧 ∈ 𝐶)) |
7 | 2, 4, 6 | cbvralw 3443 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝑧 ∈ 𝐵 ↔ ∀𝑦 ∈ 𝐴 𝑧 ∈ 𝐶) |
8 | 7 | abbii 2888 | . 2 ⊢ {𝑧 ∣ ∀𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} = {𝑧 ∣ ∀𝑦 ∈ 𝐴 𝑧 ∈ 𝐶} |
9 | df-iin 4924 | . 2 ⊢ ∩ 𝑥 ∈ 𝐴 𝐵 = {𝑧 ∣ ∀𝑥 ∈ 𝐴 𝑧 ∈ 𝐵} | |
10 | df-iin 4924 | . 2 ⊢ ∩ 𝑦 ∈ 𝐴 𝐶 = {𝑧 ∣ ∀𝑦 ∈ 𝐴 𝑧 ∈ 𝐶} | |
11 | 8, 9, 10 | 3eqtr4i 2856 | 1 ⊢ ∩ 𝑥 ∈ 𝐴 𝐵 = ∩ 𝑦 ∈ 𝐴 𝐶 |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1537 ∈ wcel 2114 {cab 2801 Ⅎwnfc 2963 ∀wral 3140 ∩ ciin 4922 |
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 2795 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ral 3145 df-iin 4924 |
This theorem is referenced by: cbviinv 4968 elrfirn2 39300 fnlimfvre 41962 smflimlem6 43059 smflim 43060 smflim2 43087 smfsup 43095 smfinflem 43098 smfinf 43099 smflimsup 43109 smfliminf 43112 |
Copyright terms: Public domain | W3C validator |