| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ixpeq2 | 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 6856 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 → X𝑥 ∈ 𝐴 𝐵 ⊆ X𝑥 ∈ 𝐴 𝐶) | |
| 2 | ss2ixp 6856 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵 → X𝑥 ∈ 𝐴 𝐶 ⊆ X𝑥 ∈ 𝐴 𝐵) | |
| 3 | 1, 2 | anim12i 338 | . 2 ⊢ ((∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 ∧ ∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵) → (X𝑥 ∈ 𝐴 𝐵 ⊆ X𝑥 ∈ 𝐴 𝐶 ∧ X𝑥 ∈ 𝐴 𝐶 ⊆ X𝑥 ∈ 𝐴 𝐵)) |
| 4 | eqss 3239 | . . . 4 ⊢ (𝐵 = 𝐶 ↔ (𝐵 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵)) | |
| 5 | 4 | ralbii 2536 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 ↔ ∀𝑥 ∈ 𝐴 (𝐵 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵)) |
| 6 | r19.26 2657 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 (𝐵 ⊆ 𝐶 ∧ 𝐶 ⊆ 𝐵) ↔ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 ∧ ∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵)) | |
| 7 | 5, 6 | bitri 184 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 ↔ (∀𝑥 ∈ 𝐴 𝐵 ⊆ 𝐶 ∧ ∀𝑥 ∈ 𝐴 𝐶 ⊆ 𝐵)) |
| 8 | eqss 3239 | . 2 ⊢ (X𝑥 ∈ 𝐴 𝐵 = X𝑥 ∈ 𝐴 𝐶 ↔ (X𝑥 ∈ 𝐴 𝐵 ⊆ X𝑥 ∈ 𝐴 𝐶 ∧ X𝑥 ∈ 𝐴 𝐶 ⊆ X𝑥 ∈ 𝐴 𝐵)) | |
| 9 | 3, 7, 8 | 3imtr4i 201 | 1 ⊢ (∀𝑥 ∈ 𝐴 𝐵 = 𝐶 → X𝑥 ∈ 𝐴 𝐵 = X𝑥 ∈ 𝐴 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∀wral 2508 ⊆ wss 3197 Xcixp 6843 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-in 3203 df-ss 3210 df-ixp 6844 |
| This theorem is referenced by: ixpeq2dva 6858 ixpintm 6870 prdsbas3 13315 pwsbas 13320 |
| Copyright terms: Public domain | W3C validator |