| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ixpeq2 | Structured version Visualization version GIF version | ||
| Description: Equality theorem for infinite Cartesian product. (Contributed by NM, 29-Sep-2006.) |
| Ref | Expression |
|---|---|
| ixpeq2 | ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → X𝑥 ∈ 𝐴 𝐵 = X𝑥 ∈ 𝐴 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ss2ixp 8945 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → X𝑥 ∈ 𝐴 𝐵 ⊆ X𝑥 ∈ 𝐴 𝐶) | |
| 2 | ss2ixp 8945 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵 → X𝑥 ∈ 𝐴 𝐶 ⊆ X𝑥 ∈ 𝐴 𝐵) | |
| 3 | 1, 2 | anim12i 625 | . 2 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 ∧ ∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵) → (X𝑥 ∈ 𝐴 𝐵 ⊆ X𝑥 ∈ 𝐴 𝐶 ∧ X𝑥 ∈ 𝐴 𝐶 ⊆ X𝑥 ∈ 𝐴 𝐵)) |
| 4 | eqss 3924 | . . . 4 ⊢ (𝐵 = 𝐶 ↔ (𝐵 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵)) | |
| 5 | 4 | ralbii 3108 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 ↔ ∀𝑥 ∈ 𝐴 (𝐵 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵)) |
| 6 | r19.26 3122 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 (𝐵 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) ↔ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 ∧ ∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵)) | |
| 7 | 5, 6 | bitri 278 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 ↔ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 ∧ ∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵)) |
| 8 | eqss 3924 | . 2 ⊢ (X𝑥 ∈ 𝐴 𝐵 = X𝑥 ∈ 𝐴 𝐶 ↔ (X𝑥 ∈ 𝐴 𝐵 ⊆ X𝑥 ∈ 𝐴 𝐶 ∧ X𝑥 ∈ 𝐴 𝐶 ⊆ X𝑥 ∈ 𝐴 𝐵)) | |
| 9 | 3, 7, 8 | 3imtr4i 295 | 1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → X𝑥 ∈ 𝐴 𝐵 = X𝑥 ∈ 𝐴 𝐶) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1569 ∀wral 3076 ⊆ wss 3896 Xcixp 8932 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 |
| This proof depends on definitions: df-bi 210 df-an 402 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-ss 3897 df-ixp 8933 |
| This theorem is used by: ixpeq2dva 8947 ixpint 8960 prdsbas3 17661 pwsbas 17667 ptbasfi 23909 ptunimpt 23923 pttopon 23924 ptcld 23941 ptrescn 23967 ptuncnv 24135 ptunhmeo 24136 ixpeq12i 37086 ptrest 38646 prdstotbnd 38837 ixpeq2d 46193 hoidmv1le 47712 |
| Copyright terms: Public domain | W3C validator |