| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ixpeq1 | Structured version Visualization version GIF version | ||
| Description: Equality theorem for infinite Cartesian product. (Contributed by NM, 29-Sep-2006.) |
| Ref | Expression |
|---|---|
| ixpeq1 | ⊢ (𝐴 = 𝐵 → X𝑥 ∈ 𝐴 𝐶 = X𝑥 ∈ 𝐵 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fneq2 6661 | . . . 4 ⊢ (𝐴 = 𝐵 → (𝑓 Fn 𝐴 ↔ 𝑓 Fn 𝐵)) | |
| 2 | raleq 3320 | . . . 4 ⊢ (𝐴 = 𝐵 → (∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐶 ↔ ∀𝑥 ∈ 𝐵 (𝑓‘𝑥) ∈ 𝐶)) | |
| 3 | 1, 2 | anbi12d 644 | . . 3 ⊢ (𝐴 = 𝐵 → ((𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐶) ↔ (𝑓 Fn 𝐵 ∧ ∀𝑥 ∈ 𝐵 (𝑓‘𝑥) ∈ 𝐶))) |
| 4 | 3 | abbidv 2829 | . 2 ⊢ (𝐴 = 𝐵 → {𝑓 ∣ (𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐶)} = {𝑓 ∣ (𝑓 Fn 𝐵 ∧ ∀𝑥 ∈ 𝐵 (𝑓‘𝑥) ∈ 𝐶)}) |
| 5 | dfixp 8965 | . 2 ⊢ X𝑥 ∈ 𝐴 𝐶 = {𝑓 ∣ (𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐶)} | |
| 6 | dfixp 8965 | . 2 ⊢ X𝑥 ∈ 𝐵 𝐶 = {𝑓 ∣ (𝑓 Fn 𝐵 ∧ ∀𝑥 ∈ 𝐵 (𝑓‘𝑥) ∈ 𝐶)} | |
| 7 | 4, 5, 6 | 3eqtr4g 2823 | 1 ⊢ (𝐴 = 𝐵 → X𝑥 ∈ 𝐴 𝐶 = X𝑥 ∈ 𝐵 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 {cab 2741 ∀wral 3080 Fn wfn 6561 ‘cfv 6566 Xcixp 8963 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-ext 2735 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2102 df-clab 2742 df-cleq 2755 df-clel 2839 df-ral 3081 df-rex 3091 df-fn 6569 df-ixp 8964 |
| This theorem is used by: ixpeq1d 8975 finixpnum 38796 ioorrnopn 47588 ioorrnopnxr 47590 ovnval 47824 hoicvr 47831 hoidmv1le 47877 hoidmvle 47883 ovnhoi 47886 hspval 47892 ovnlecvr2 47893 hoiqssbl 47908 vonhoire 47955 iunhoiioo 47959 vonioo 47965 vonicc 47968 |
| Copyright terms: Public domain | W3C validator |