| Mathbox for Jeff Madsen |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dmncan2 | Structured version Visualization version GIF version | ||
| Description: Cancellation law for domains. (Contributed by Jeff Madsen, 6-Jan-2011.) |
| Ref | Expression |
|---|---|
| dmncan.1 | ⊢ 𝐺 = (1st ‘𝑅) |
| dmncan.2 | ⊢ 𝐻 = (2nd ‘𝑅) |
| dmncan.3 | ⊢ 𝑋 = ran 𝐺 |
| dmncan.4 | ⊢ 𝑍 = (GId‘𝐺) |
| Ref | Expression |
|---|---|
| dmncan2 | ⊢ (((𝑅 ∈ Dmn ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐶 ≠ 𝑍) → ((𝐴𝐻𝐶) = (𝐵𝐻𝐶) → 𝐴 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dmncrng 38552 | . . . 4 ⊢ (𝑅 ∈ Dmn → 𝑅 ∈ CRingOps) | |
| 2 | dmncan.1 | . . . . . . 7 ⊢ 𝐺 = (1st ‘𝑅) | |
| 3 | dmncan.2 | . . . . . . 7 ⊢ 𝐻 = (2nd ‘𝑅) | |
| 4 | dmncan.3 | . . . . . . 7 ⊢ 𝑋 = ran 𝐺 | |
| 5 | 2, 3, 4 | crngocom 38497 | . . . . . 6 ⊢ ((𝑅 ∈ CRingOps ∧ 𝐴 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐴𝐻𝐶) = (𝐶𝐻𝐴)) |
| 6 | 5 | 3adant3r2 1197 | . . . . 5 ⊢ ((𝑅 ∈ CRingOps ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐴𝐻𝐶) = (𝐶𝐻𝐴)) |
| 7 | 2, 3, 4 | crngocom 38497 | . . . . . 6 ⊢ ((𝑅 ∈ CRingOps ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐵𝐻𝐶) = (𝐶𝐻𝐵)) |
| 8 | 7 | 3adant3r1 1196 | . . . . 5 ⊢ ((𝑅 ∈ CRingOps ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → (𝐵𝐻𝐶) = (𝐶𝐻𝐵)) |
| 9 | 6, 8 | eqeq12d 2778 | . . . 4 ⊢ ((𝑅 ∈ CRingOps ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐻𝐶) = (𝐵𝐻𝐶) ↔ (𝐶𝐻𝐴) = (𝐶𝐻𝐵))) |
| 10 | 1, 9 | sylan 589 | . . 3 ⊢ ((𝑅 ∈ Dmn ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) → ((𝐴𝐻𝐶) = (𝐵𝐻𝐶) ↔ (𝐶𝐻𝐴) = (𝐶𝐻𝐵))) |
| 11 | 10 | adantr 484 | . 2 ⊢ (((𝑅 ∈ Dmn ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐶 ≠ 𝑍) → ((𝐴𝐻𝐶) = (𝐵𝐻𝐶) ↔ (𝐶𝐻𝐴) = (𝐶𝐻𝐵))) |
| 12 | 3anrot 1112 | . . . 4 ⊢ ((𝐶 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ↔ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) | |
| 13 | 12 | biimpri 230 | . . 3 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → (𝐶 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) |
| 14 | dmncan.4 | . . . 4 ⊢ 𝑍 = (GId‘𝐺) | |
| 15 | 2, 3, 4, 14 | dmncan1 38572 | . . 3 ⊢ (((𝑅 ∈ Dmn ∧ (𝐶 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) ∧ 𝐶 ≠ 𝑍) → ((𝐶𝐻𝐴) = (𝐶𝐻𝐵) → 𝐴 = 𝐵)) |
| 16 | 13, 15 | sylanl2 691 | . 2 ⊢ (((𝑅 ∈ Dmn ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐶 ≠ 𝑍) → ((𝐶𝐻𝐴) = (𝐶𝐻𝐵) → 𝐴 = 𝐵)) |
| 17 | 11, 16 | sylbid 242 | 1 ⊢ (((𝑅 ∈ Dmn ∧ (𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋)) ∧ 𝐶 ≠ 𝑍) → ((𝐴𝐻𝐶) = (𝐵𝐻𝐶) → 𝐴 = 𝐵)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∧ w3a 1098 = wceq 1560 ∈ wcel 2142 ≠ wne 2957 ran crn 5648 ‘cfv 6521 (class class class)co 7396 1st c1st 7968 2nd c2nd 7969 GIdcgi 30690 CRingOpsccring 38489 Dmncdmn 38543 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5227 ax-sep 5246 ax-nul 5256 ax-pow 5322 ax-pr 5390 ax-un 7718 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1100 df-tru 1563 df-fal 1573 df-ex 1800 df-nf 1804 df-sb 2091 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3077 df-rex 3087 df-rmo 3367 df-reu 3368 df-rab 3415 df-v 3456 df-sbc 3745 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4481 df-pw 4557 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-int 4906 df-iun 4951 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-res 5659 df-ima 5660 df-suc 6352 df-iota 6477 df-fun 6523 df-fn 6524 df-f 6525 df-f1 6526 df-fo 6527 df-f1o 6528 df-fv 6529 df-riota 7353 df-ov 7399 df-oprab 7400 df-mpo 7401 df-1st 7970 df-2nd 7971 df-1o 8437 df-en 8928 df-grpo 30693 df-gid 30694 df-ginv 30695 df-gdiv 30696 df-ablo 30745 df-ass 38339 df-exid 38341 df-mgmOLD 38345 df-sgrOLD 38357 df-mndo 38363 df-rngo 38391 df-com2 38486 df-crngo 38490 df-idl 38506 df-pridl 38507 df-prrngo 38544 df-dmn 38545 df-igen 38556 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |