![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > xpcanm | GIF version |
Description: Cancellation law for cross-product. (Contributed by Jim Kingdon, 14-Dec-2018.) |
Ref | Expression |
---|---|
xpcanm | ⊢ (∃𝑥 𝑥 ∈ 𝐶 → ((𝐶 × 𝐴) = (𝐶 × 𝐵) ↔ 𝐴 = 𝐵)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssxp2 4809 | . . 3 ⊢ (∃𝑥 𝑥 ∈ 𝐶 → ((𝐶 × 𝐴) ⊆ (𝐶 × 𝐵) ↔ 𝐴 ⊆ 𝐵)) | |
2 | ssxp2 4809 | . . 3 ⊢ (∃𝑥 𝑥 ∈ 𝐶 → ((𝐶 × 𝐵) ⊆ (𝐶 × 𝐴) ↔ 𝐵 ⊆ 𝐴)) | |
3 | 1, 2 | anbi12d 457 | . 2 ⊢ (∃𝑥 𝑥 ∈ 𝐶 → (((𝐶 × 𝐴) ⊆ (𝐶 × 𝐵) ∧ (𝐶 × 𝐵) ⊆ (𝐶 × 𝐴)) ↔ (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴))) |
4 | eqss 3024 | . 2 ⊢ ((𝐶 × 𝐴) = (𝐶 × 𝐵) ↔ ((𝐶 × 𝐴) ⊆ (𝐶 × 𝐵) ∧ (𝐶 × 𝐵) ⊆ (𝐶 × 𝐴))) | |
5 | eqss 3024 | . 2 ⊢ (𝐴 = 𝐵 ↔ (𝐴 ⊆ 𝐵 ∧ 𝐵 ⊆ 𝐴)) | |
6 | 3, 4, 5 | 3bitr4g 221 | 1 ⊢ (∃𝑥 𝑥 ∈ 𝐶 → ((𝐶 × 𝐴) = (𝐶 × 𝐵) ↔ 𝐴 = 𝐵)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 ↔ wb 103 = wceq 1285 ∃wex 1422 ∈ wcel 1434 ⊆ wss 2983 × cxp 4390 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 663 ax-5 1377 ax-7 1378 ax-gen 1379 ax-ie1 1423 ax-ie2 1424 ax-8 1436 ax-10 1437 ax-11 1438 ax-i12 1439 ax-bndl 1440 ax-4 1441 ax-14 1446 ax-17 1460 ax-i9 1464 ax-ial 1468 ax-i5r 1469 ax-ext 2065 ax-sep 3917 ax-pow 3969 ax-pr 3993 |
This theorem depends on definitions: df-bi 115 df-3an 922 df-tru 1288 df-nf 1391 df-sb 1688 df-eu 1946 df-mo 1947 df-clab 2070 df-cleq 2076 df-clel 2079 df-nfc 2212 df-ral 2358 df-rex 2359 df-v 2612 df-un 2987 df-in 2989 df-ss 2996 df-pw 3403 df-sn 3423 df-pr 3424 df-op 3426 df-br 3807 df-opab 3861 df-xp 4398 df-rel 4399 df-cnv 4400 df-dm 4402 df-rn 4403 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |