| Mathbox for Scott Fenton |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > altxpeq2 | Structured version Visualization version GIF version | ||
| Description: Equality for alternate Cartesian products. (Contributed by Scott Fenton, 24-Mar-2012.) |
| Ref | Expression |
|---|---|
| altxpeq2 | ⊢ (𝐴 = 𝐵 → (𝐶 ×× 𝐴) = (𝐶 ×× 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rexeq 3325 | . . . 4 ⊢ (𝐴 = 𝐵 → (∃𝑦 ∈ 𝐴 𝑧 = ⟪𝑥, 𝑦⟫ ↔ ∃𝑦 ∈ 𝐵 𝑧 = ⟪𝑥, 𝑦⟫)) | |
| 2 | 1 | rexbidv 3195 | . . 3 ⊢ (𝐴 = 𝐵 → (∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐴 𝑧 = ⟪𝑥, 𝑦⟫ ↔ ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐵 𝑧 = ⟪𝑥, 𝑦⟫)) |
| 3 | 2 | abbidv 2835 | . 2 ⊢ (𝐴 = 𝐵 → {𝑧 ∣ ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐴 𝑧 = ⟪𝑥, 𝑦⟫} = {𝑧 ∣ ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐵 𝑧 = ⟪𝑥, 𝑦⟫}) |
| 4 | df-altxp 36384 | . 2 ⊢ (𝐶 ×× 𝐴) = {𝑧 ∣ ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐴 𝑧 = ⟪𝑥, 𝑦⟫} | |
| 5 | df-altxp 36384 | . 2 ⊢ (𝐶 ×× 𝐵) = {𝑧 ∣ ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐵 𝑧 = ⟪𝑥, 𝑦⟫} | |
| 6 | 3, 4, 5 | 3eqtr4g 2829 | 1 ⊢ (𝐴 = 𝐵 → (𝐶 ×× 𝐴) = (𝐶 ×× 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1567 {cab 2747 ∃wrex 3095 ⟪caltop 36381 ×× caltxp 36382 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-9 2159 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1807 df-sb 2098 df-clab 2748 df-cleq 2761 df-rex 3096 df-altxp 36384 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |