Mathbox for BJ |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > bj-mpt2mptALT | Structured version Visualization version GIF version |
Description: Alternate proof of mpt2mpt 6752. (Contributed by BJ, 30-Dec-2020.) (Proof modification is discouraged.) (New usage is discouraged.) |
Ref | Expression |
---|---|
bj-mpt2mptALT.1 | ⊢ (𝑧 = 〈𝑥, 𝑦〉 → 𝐶 = 𝐷) |
Ref | Expression |
---|---|
bj-mpt2mptALT | ⊢ (𝑧 ∈ (𝐴 × 𝐵) ↦ 𝐶) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐷) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elxp2 5132 | . . . . 5 ⊢ (𝑧 ∈ (𝐴 × 𝐵) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 〈𝑥, 𝑦〉) | |
2 | 1 | anbi1i 731 | . . . 4 ⊢ ((𝑧 ∈ (𝐴 × 𝐵) ∧ 𝑡 = 𝐶) ↔ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑡 = 𝐶)) |
3 | r19.41v 3089 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 (∃𝑦 ∈ 𝐵 𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑡 = 𝐶) ↔ (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑡 = 𝐶)) | |
4 | r19.41v 3089 | . . . . . 6 ⊢ (∃𝑦 ∈ 𝐵 (𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑡 = 𝐶) ↔ (∃𝑦 ∈ 𝐵 𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑡 = 𝐶)) | |
5 | bj-mpt2mptALT.1 | . . . . . . . . 9 ⊢ (𝑧 = 〈𝑥, 𝑦〉 → 𝐶 = 𝐷) | |
6 | 5 | eqeq2d 2632 | . . . . . . . 8 ⊢ (𝑧 = 〈𝑥, 𝑦〉 → (𝑡 = 𝐶 ↔ 𝑡 = 𝐷)) |
7 | 6 | pm5.32i 669 | . . . . . . 7 ⊢ ((𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑡 = 𝐶) ↔ (𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑡 = 𝐷)) |
8 | 7 | rexbii 3041 | . . . . . 6 ⊢ (∃𝑦 ∈ 𝐵 (𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑡 = 𝐶) ↔ ∃𝑦 ∈ 𝐵 (𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑡 = 𝐷)) |
9 | 4, 8 | bitr3i 266 | . . . . 5 ⊢ ((∃𝑦 ∈ 𝐵 𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑡 = 𝐶) ↔ ∃𝑦 ∈ 𝐵 (𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑡 = 𝐷)) |
10 | 9 | rexbii 3041 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 (∃𝑦 ∈ 𝐵 𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑡 = 𝐶) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑡 = 𝐷)) |
11 | 2, 3, 10 | 3bitr2i 288 | . . 3 ⊢ ((𝑧 ∈ (𝐴 × 𝐵) ∧ 𝑡 = 𝐶) ↔ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑡 = 𝐷)) |
12 | 11 | opabbii 4717 | . 2 ⊢ {〈𝑧, 𝑡〉 ∣ (𝑧 ∈ (𝐴 × 𝐵) ∧ 𝑡 = 𝐶)} = {〈𝑧, 𝑡〉 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑡 = 𝐷)} |
13 | df-mpt 4730 | . 2 ⊢ (𝑧 ∈ (𝐴 × 𝐵) ↦ 𝐶) = {〈𝑧, 𝑡〉 ∣ (𝑧 ∈ (𝐴 × 𝐵) ∧ 𝑡 = 𝐶)} | |
14 | bj-dfmpt2a 33071 | . 2 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐷) = {〈𝑧, 𝑡〉 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐵 (𝑧 = 〈𝑥, 𝑦〉 ∧ 𝑡 = 𝐷)} | |
15 | 12, 13, 14 | 3eqtr4i 2654 | 1 ⊢ (𝑧 ∈ (𝐴 × 𝐵) ↦ 𝐶) = (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐷) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 384 = wceq 1483 ∈ wcel 1990 ∃wrex 2913 〈cop 4183 {copab 4712 ↦ cmpt 4729 × cxp 5112 ↦ cmpt2 6652 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-sep 4781 ax-nul 4789 ax-pr 4906 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ral 2917 df-rex 2918 df-rab 2921 df-v 3202 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-sn 4178 df-pr 4180 df-op 4184 df-opab 4713 df-mpt 4730 df-xp 5120 df-oprab 6654 df-mpt2 6655 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |