| 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 1154 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → 𝐹 ∈ 𝐴) | |
| 2 | simp2l 1218 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → 𝑋 ∈ 𝐵) | |
| 3 | simp3l 1220 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → 𝑌 ∈ 𝐵) | |
| 4 | abv0.a | . . . . 5 ⊢ 𝐴 = (AbsVal‘𝑅) | |
| 5 | abvneg.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑅) | |
| 6 | abvdom.t | . . . . 5 ⊢ · = (.r‘𝑅) | |
| 7 | 4, 5, 6 | abvmul 20990 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 · 𝑌)) = ((𝐹‘𝑋) · (𝐹‘𝑌))) |
| 8 | 1, 2, 3, 7 | syl3anc 1398 | . . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘(𝑋 · 𝑌)) = ((𝐹‘𝑋) · (𝐹‘𝑌))) |
| 9 | 4, 5 | abvcl 20985 | . . . . . 6 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → (𝐹‘𝑋) ∈ ℝ) |
| 10 | 1, 2, 9 | syl2anc 596 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘𝑋) ∈ ℝ) |
| 11 | 10 | recnd 11264 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘𝑋) ∈ ℂ) |
| 12 | 4, 5 | abvcl 20985 | . . . . . 6 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) → (𝐹‘𝑌) ∈ ℝ) |
| 13 | 1, 3, 12 | syl2anc 596 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘𝑌) ∈ ℝ) |
| 14 | 13 | recnd 11264 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘𝑌) ∈ ℂ) |
| 15 | simp2r 1219 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → 𝑋 ≠ 0 ) | |
| 16 | abvrec.z | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
| 17 | 4, 5, 16 | abvne0 20988 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) → (𝐹‘𝑋) ≠ 0) |
| 18 | 1, 2, 15, 17 | syl3anc 1398 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘𝑋) ≠ 0) |
| 19 | simp3r 1221 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → 𝑌 ≠ 0 ) | |
| 20 | 4, 5, 16 | abvne0 20988 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 ) → (𝐹‘𝑌) ≠ 0) |
| 21 | 1, 3, 19, 20 | syl3anc 1398 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘𝑌) ≠ 0) |
| 22 | 11, 14, 18, 21 | mulne0d 11893 | . . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → ((𝐹‘𝑋) · (𝐹‘𝑌)) ≠ 0) |
| 23 | 8, 22 | eqnetrd 3022 | . 2 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘(𝑋 · 𝑌)) ≠ 0) |
| 24 | 4, 16 | abv0 20992 | . . . . 5 ⊢ (𝐹 ∈ 𝐴 → (𝐹‘ 0 ) = 0) |
| 25 | 1, 24 | syl 18 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘ 0 ) = 0) |
| 26 | fveqeq2 6888 | . . . 4 ⊢ ((𝑋 · 𝑌) = 0 → ((𝐹‘(𝑋 · 𝑌)) = 0 ↔ (𝐹‘ 0 ) = 0)) | |
| 27 | 25, 26 | syl5ibrcom 250 | . . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → ((𝑋 · 𝑌) = 0 → (𝐹‘(𝑋 · 𝑌)) = 0)) |
| 28 | 27 | necon3d 2976 | . 2 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → ((𝐹‘(𝑋 · 𝑌)) ≠ 0 → (𝑋 · 𝑌) ≠ 0 )) |
| 29 | 23, 28 | mpd 16 | 1 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝑋 · 𝑌) ≠ 0 ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ≠ wne 2955 ‘cfv 6533 (class class class)co 7414 ℝcr 11126 0cc0 11127 · cmul 11132 Basecbs 17304 .rcmulr 17346 0gc0g 17527 AbsValcabv 20977 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11183 ax-resscn 11184 ax-1cn 11185 ax-icn 11186 ax-addcl 11187 ax-addrcl 11188 ax-mulcl 11189 ax-mulrcl 11190 ax-mulcom 11191 ax-addass 11192 ax-mulass 11193 ax-distr 11194 ax-i2m1 11195 ax-1ne0 11196 ax-1rid 11197 ax-rnegex 11198 ax-rrecex 11199 ax-cnre 11200 ax-pre-lttri 11201 ax-pre-lttrn 11202 ax-pre-ltadd 11203 ax-pre-mulgt0 11204 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-po 5563 df-so 5564 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-er 8699 df-map 8831 df-en 8956 df-dom 8957 df-sdom 8958 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11470 df-neg 11471 df-ico 13407 df-0g 17529 df-mgm 18733 df-sgrp 18824 df-mnd 18840 df-grp 19063 df-ring 20377 df-abv 20978 |
| This theorem is used by: abvn0b 21005 |
| Copyright terms: Public domain | W3C validator |