| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > xpcan2m | GIF version | ||
| Description: Cancellation law for cross-product. (Contributed by Jim Kingdon, 14-Dec-2018.) |
| Ref | Expression |
|---|---|
| xpcan2m | ⊢ (∃𝑥 𝑥 ∈ 𝐶 → ((𝐴 × 𝐶) = (𝐵 × 𝐶) ↔ 𝐴 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ssxp1 5180 | . . 3 ⊢ (∃𝑥 𝑥 ∈ 𝐶 → ((𝐴 × 𝐶) ⊆ (𝐵 × 𝐶) ↔ 𝐴 ⊆ 𝐵)) | |
| 2 | ssxp1 5180 | . . 3 ⊢ (∃𝑥 𝑥 ∈ 𝐶 → ((𝐵 × 𝐶) ⊆ (𝐴 × 𝐶) ↔ 𝐵 ⊆ 𝐴)) | |
| 3 | 1, 2 | anbi12d 473 | . 2 ⊢ (∃𝑥 𝑥 ∈ 𝐶 → (((𝐴 × 𝐶) ⊆ (𝐵 × 𝐶) ∧ (𝐵 × 𝐶) ⊆ (𝐴 × 𝐶)) ↔ (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴))) |
| 4 | eqss 3243 | . 2 ⊢ ((𝐴 × 𝐶) = (𝐵 × 𝐶) ↔ ((𝐴 × 𝐶) ⊆ (𝐵 × 𝐶) ∧ (𝐵 × 𝐶) ⊆ (𝐴 × 𝐶))) | |
| 5 | eqss 3243 | . 2 ⊢ (𝐴 = 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴)) | |
| 6 | 3, 4, 5 | 3bitr4g 223 | 1 ⊢ (∃𝑥 𝑥 ∈ 𝐶 → ((𝐴 × 𝐶) = (𝐵 × 𝐶) ↔ 𝐴 = 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 = wceq 1398 ∃wex 1541 ∈ wcel 2202 ⊆ wss 3201 × cxp 4729 |
| 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 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-14 2205 ax-ext 2213 ax-sep 4212 ax-pow 4270 ax-pr 4305 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ral 2516 df-rex 2517 df-v 2805 df-un 3205 df-in 3207 df-ss 3214 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-br 4094 df-opab 4156 df-xp 4737 df-dm 4741 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |