Mathbox for Glauco Siliprandi |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > cbvmpo1 | Structured version Visualization version GIF version |
Description: Rule to change the first bound variable in a maps-to function, using implicit substitution. (Contributed by Glauco Siliprandi, 26-Jun-2021.) |
Ref | Expression |
---|---|
cbvmpo1.1 | ⊢ Ⅎ𝑥𝐵 |
cbvmpo1.2 | ⊢ Ⅎ𝑧𝐵 |
cbvmpo1.3 | ⊢ Ⅎ𝑧𝐶 |
cbvmpo1.4 | ⊢ Ⅎ𝑥𝐸 |
cbvmpo1.5 | ⊢ (𝑥 = 𝑧 → 𝐶 = 𝐸) |
Ref | Expression |
---|---|
cbvmpo1 | ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑧 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐸) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1915 | . . . . 5 ⊢ Ⅎ𝑧 𝑥 ∈ 𝐴 | |
2 | cbvmpo1.2 | . . . . . 6 ⊢ Ⅎ𝑧𝐵 | |
3 | 2 | nfcri 2892 | . . . . 5 ⊢ Ⅎ𝑧 𝑦 ∈ 𝐵 |
4 | 1, 3 | nfan 1900 | . . . 4 ⊢ Ⅎ𝑧(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) |
5 | cbvmpo1.3 | . . . . 5 ⊢ Ⅎ𝑧𝐶 | |
6 | 5 | nfeq2 2922 | . . . 4 ⊢ Ⅎ𝑧 𝑢 = 𝐶 |
7 | 4, 6 | nfan 1900 | . . 3 ⊢ Ⅎ𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐶) |
8 | nfv 1915 | . . . . 5 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐴 | |
9 | cbvmpo1.1 | . . . . . 6 ⊢ Ⅎ𝑥𝐵 | |
10 | 9 | nfcri 2892 | . . . . 5 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐵 |
11 | 8, 10 | nfan 1900 | . . . 4 ⊢ Ⅎ𝑥(𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) |
12 | cbvmpo1.4 | . . . . 5 ⊢ Ⅎ𝑥𝐸 | |
13 | 12 | nfeq2 2922 | . . . 4 ⊢ Ⅎ𝑥 𝑢 = 𝐸 |
14 | 11, 13 | nfan 1900 | . . 3 ⊢ Ⅎ𝑥((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐸) |
15 | eleq1w 2819 | . . . . 5 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴)) | |
16 | 15 | anbi1d 631 | . . . 4 ⊢ (𝑥 = 𝑧 → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ↔ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵))) |
17 | cbvmpo1.5 | . . . . 5 ⊢ (𝑥 = 𝑧 → 𝐶 = 𝐸) | |
18 | 17 | eqeq2d 2747 | . . . 4 ⊢ (𝑥 = 𝑧 → (𝑢 = 𝐶 ↔ 𝑢 = 𝐸)) |
19 | 16, 18 | anbi12d 632 | . . 3 ⊢ (𝑥 = 𝑧 → (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐶) ↔ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐸))) |
20 | 7, 14, 19 | cbvoprab1 7394 | . 2 ⊢ {〈〈𝑥, 𝑦〉, 𝑢〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐶)} = {〈〈𝑧, 𝑦〉, 𝑢〉 ∣ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐸)} |
21 | df-mpo 7312 | . 2 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = {〈〈𝑥, 𝑦〉, 𝑢〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐶)} | |
22 | df-mpo 7312 | . 2 ⊢ (𝑧 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐸) = {〈〈𝑧, 𝑦〉, 𝑢〉 ∣ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐸)} | |
23 | 20, 21, 22 | 3eqtr4i 2774 | 1 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑧 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐸) |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 397 = wceq 1539 ∈ wcel 2104 Ⅎwnfc 2885 {coprab 7308 ∈ cmpo 7309 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2707 ax-sep 5232 ax-nul 5239 ax-pr 5361 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 846 df-3an 1089 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-clab 2714 df-cleq 2728 df-clel 2814 df-nfc 2887 df-rab 3287 df-v 3439 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-sn 4566 df-pr 4568 df-op 4572 df-opab 5144 df-oprab 7311 df-mpo 7312 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |