| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > abvdom | Structured version Visualization version GIF version | ||
| Description: Any ring with an absolute value is a domain, which is to say that it contains no zero divisors. (Contributed by Mario Carneiro, 10-Sep-2014.) |
| Ref | Expression |
|---|---|
| abv0.a | ⊢ 𝐴 = (AbsVal‘𝑅) |
| abvneg.b | ⊢ 𝐵 = (Base‘𝑅) |
| abvrec.z | ⊢ 0 = (0g‘𝑅) |
| abvdom.t | ⊢ · = (.r‘𝑅) |
| Ref | Expression |
|---|---|
| abvdom | ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝑋 · 𝑌) ≠ 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp1 1136 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → 𝐹 ∈ 𝐴) | |
| 2 | simp2l 1199 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → 𝑋 ∈ 𝐵) | |
| 3 | simp3l 1201 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → 𝑌 ∈ 𝐵) | |
| 4 | abv0.a | . . . . 5 ⊢ 𝐴 = (AbsVal‘𝑅) | |
| 5 | abvneg.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑅) | |
| 6 | abvdom.t | . . . . 5 ⊢ · = (.r‘𝑅) | |
| 7 | 4, 5, 6 | abvmul 20795 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 · 𝑌)) = ((𝐹‘𝑋) · (𝐹‘𝑌))) |
| 8 | 1, 2, 3, 7 | syl3anc 1372 | . . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘(𝑋 · 𝑌)) = ((𝐹‘𝑋) · (𝐹‘𝑌))) |
| 9 | 4, 5 | abvcl 20790 | . . . . . 6 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → (𝐹‘𝑋) ∈ ℝ) |
| 10 | 1, 2, 9 | syl2anc 584 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘𝑋) ∈ ℝ) |
| 11 | 10 | recnd 11272 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘𝑋) ∈ ℂ) |
| 12 | 4, 5 | abvcl 20790 | . . . . . 6 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) → (𝐹‘𝑌) ∈ ℝ) |
| 13 | 1, 3, 12 | syl2anc 584 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘𝑌) ∈ ℝ) |
| 14 | 13 | recnd 11272 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘𝑌) ∈ ℂ) |
| 15 | simp2r 1200 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → 𝑋 ≠ 0 ) | |
| 16 | abvrec.z | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
| 17 | 4, 5, 16 | abvne0 20793 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) → (𝐹‘𝑋) ≠ 0) |
| 18 | 1, 2, 15, 17 | syl3anc 1372 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘𝑋) ≠ 0) |
| 19 | simp3r 1202 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → 𝑌 ≠ 0 ) | |
| 20 | 4, 5, 16 | abvne0 20793 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 ) → (𝐹‘𝑌) ≠ 0) |
| 21 | 1, 3, 19, 20 | syl3anc 1372 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘𝑌) ≠ 0) |
| 22 | 11, 14, 18, 21 | mulne0d 11898 | . . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → ((𝐹‘𝑋) · (𝐹‘𝑌)) ≠ 0) |
| 23 | 8, 22 | eqnetrd 2998 | . 2 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘(𝑋 · 𝑌)) ≠ 0) |
| 24 | 4, 16 | abv0 20797 | . . . . 5 ⊢ (𝐹 ∈ 𝐴 → (𝐹‘ 0 ) = 0) |
| 25 | 1, 24 | syl 17 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘ 0 ) = 0) |
| 26 | fveqeq2 6896 | . . . 4 ⊢ ((𝑋 · 𝑌) = 0 → ((𝐹‘(𝑋 · 𝑌)) = 0 ↔ (𝐹‘ 0 ) = 0)) | |
| 27 | 25, 26 | syl5ibrcom 247 | . . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → ((𝑋 · 𝑌) = 0 → (𝐹‘(𝑋 · 𝑌)) = 0)) |
| 28 | 27 | necon3d 2952 | . 2 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → ((𝐹‘(𝑋 · 𝑌)) ≠ 0 → (𝑋 · 𝑌) ≠ 0 )) |
| 29 | 23, 28 | mpd 15 | 1 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝑋 · 𝑌) ≠ 0 ) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1539 ∈ wcel 2107 ≠ wne 2931 ‘cfv 6542 (class class class)co 7414 ℝcr 11137 0cc0 11138 · cmul 11143 Basecbs 17230 .rcmulr 17278 0gc0g 17460 AbsValcabv 20782 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-sep 5278 ax-nul 5288 ax-pow 5347 ax-pr 5414 ax-un 7738 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-nel 3036 df-ral 3051 df-rex 3060 df-rmo 3364 df-reu 3365 df-rab 3421 df-v 3466 df-sbc 3773 df-csb 3882 df-dif 3936 df-un 3938 df-in 3940 df-ss 3950 df-nul 4316 df-if 4508 df-pw 4584 df-sn 4609 df-pr 4611 df-op 4615 df-uni 4890 df-br 5126 df-opab 5188 df-mpt 5208 df-id 5560 df-po 5574 df-so 5575 df-xp 5673 df-rel 5674 df-cnv 5675 df-co 5676 df-dm 5677 df-rn 5678 df-res 5679 df-ima 5680 df-iota 6495 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-er 8728 df-map 8851 df-en 8969 df-dom 8970 df-sdom 8971 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11477 df-neg 11478 df-ico 13376 df-0g 17462 df-mgm 18627 df-sgrp 18706 df-mnd 18722 df-grp 18928 df-ring 20205 df-abv 20783 |
| This theorem is referenced by: abvn0b 20810 |
| Copyright terms: Public domain | W3C validator |