![]() |
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 20844 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝐹‘(𝑋 · 𝑌)) = ((𝐹‘𝑋) · (𝐹‘𝑌))) |
8 | 1, 2, 3, 7 | syl3anc 1371 | . . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘(𝑋 · 𝑌)) = ((𝐹‘𝑋) · (𝐹‘𝑌))) |
9 | 4, 5 | abvcl 20839 | . . . . . 6 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → (𝐹‘𝑋) ∈ ℝ) |
10 | 1, 2, 9 | syl2anc 583 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘𝑋) ∈ ℝ) |
11 | 10 | recnd 11318 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘𝑋) ∈ ℂ) |
12 | 4, 5 | abvcl 20839 | . . . . . 6 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵) → (𝐹‘𝑌) ∈ ℝ) |
13 | 1, 3, 12 | syl2anc 583 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘𝑌) ∈ ℝ) |
14 | 13 | recnd 11318 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘𝑌) ∈ ℂ) |
15 | simp2r 1200 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → 𝑋 ≠ 0 ) | |
16 | abvrec.z | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
17 | 4, 5, 16 | abvne0 20842 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) → (𝐹‘𝑋) ≠ 0) |
18 | 1, 2, 15, 17 | syl3anc 1371 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘𝑋) ≠ 0) |
19 | simp3r 1202 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → 𝑌 ≠ 0 ) | |
20 | 4, 5, 16 | abvne0 20842 | . . . . 5 ⊢ ((𝐹 ∈ 𝐴 ∧ 𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 ) → (𝐹‘𝑌) ≠ 0) |
21 | 1, 3, 19, 20 | syl3anc 1371 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘𝑌) ≠ 0) |
22 | 11, 14, 18, 21 | mulne0d 11942 | . . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → ((𝐹‘𝑋) · (𝐹‘𝑌)) ≠ 0) |
23 | 8, 22 | eqnetrd 3014 | . 2 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘(𝑋 · 𝑌)) ≠ 0) |
24 | 4, 16 | abv0 20846 | . . . . 5 ⊢ (𝐹 ∈ 𝐴 → (𝐹‘ 0 ) = 0) |
25 | 1, 24 | syl 17 | . . . 4 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → (𝐹‘ 0 ) = 0) |
26 | fveqeq2 6929 | . . . 4 ⊢ ((𝑋 · 𝑌) = 0 → ((𝐹‘(𝑋 · 𝑌)) = 0 ↔ (𝐹‘ 0 ) = 0)) | |
27 | 25, 26 | syl5ibrcom 247 | . . 3 ⊢ ((𝐹 ∈ 𝐴 ∧ (𝑋 ∈ 𝐵 ∧ 𝑋 ≠ 0 ) ∧ (𝑌 ∈ 𝐵 ∧ 𝑌 ≠ 0 )) → ((𝑋 · 𝑌) = 0 → (𝐹‘(𝑋 · 𝑌)) = 0)) |
28 | 27 | necon3d 2967 | . 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 1087 = wceq 1537 ∈ wcel 2108 ≠ wne 2946 ‘cfv 6573 (class class class)co 7448 ℝcr 11183 0cc0 11184 · cmul 11189 Basecbs 17258 .rcmulr 17312 0gc0g 17499 AbsValcabv 20831 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-opab 5229 df-mpt 5250 df-id 5593 df-po 5607 df-so 5608 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-er 8763 df-map 8886 df-en 9004 df-dom 9005 df-sdom 9006 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-ico 13413 df-0g 17501 df-mgm 18678 df-sgrp 18757 df-mnd 18773 df-grp 18976 df-ring 20262 df-abv 20832 |
This theorem is referenced by: abvn0b 20859 |
Copyright terms: Public domain | W3C validator |