Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > domneq0 | Structured version Visualization version GIF version |
Description: In a domain, a product is zero iff it has a zero factor. (Contributed by Mario Carneiro, 28-Mar-2015.) |
Ref | Expression |
---|---|
domneq0.b | ⊢ 𝐵 = (Base‘𝑅) |
domneq0.t | ⊢ · = (.r‘𝑅) |
domneq0.z | ⊢ 0 = (0g‘𝑅) |
Ref | Expression |
---|---|
domneq0 | ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 · 𝑌) = 0 ↔ (𝑋 = 0 ∨ 𝑌 = 0 ))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 3simpc 1146 | . . 3 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) | |
2 | domneq0.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
3 | domneq0.t | . . . . . 6 ⊢ · = (.r‘𝑅) | |
4 | domneq0.z | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
5 | 2, 3, 4 | isdomn 20061 | . . . . 5 ⊢ (𝑅 ∈ Domn ↔ (𝑅 ∈ NzRing ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 )))) |
6 | 5 | simprbi 499 | . . . 4 ⊢ (𝑅 ∈ Domn → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 ))) |
7 | 6 | 3ad2ant1 1129 | . . 3 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 ))) |
8 | oveq1 7157 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑥 · 𝑦) = (𝑋 · 𝑦)) | |
9 | 8 | eqeq1d 2823 | . . . . 5 ⊢ (𝑥 = 𝑋 → ((𝑥 · 𝑦) = 0 ↔ (𝑋 · 𝑦) = 0 )) |
10 | eqeq1 2825 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑥 = 0 ↔ 𝑋 = 0 )) | |
11 | 10 | orbi1d 913 | . . . . 5 ⊢ (𝑥 = 𝑋 → ((𝑥 = 0 ∨ 𝑦 = 0 ) ↔ (𝑋 = 0 ∨ 𝑦 = 0 ))) |
12 | 9, 11 | imbi12d 347 | . . . 4 ⊢ (𝑥 = 𝑋 → (((𝑥 · 𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 )) ↔ ((𝑋 · 𝑦) = 0 → (𝑋 = 0 ∨ 𝑦 = 0 )))) |
13 | oveq2 7158 | . . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑋 · 𝑦) = (𝑋 · 𝑌)) | |
14 | 13 | eqeq1d 2823 | . . . . 5 ⊢ (𝑦 = 𝑌 → ((𝑋 · 𝑦) = 0 ↔ (𝑋 · 𝑌) = 0 )) |
15 | eqeq1 2825 | . . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑦 = 0 ↔ 𝑌 = 0 )) | |
16 | 15 | orbi2d 912 | . . . . 5 ⊢ (𝑦 = 𝑌 → ((𝑋 = 0 ∨ 𝑦 = 0 ) ↔ (𝑋 = 0 ∨ 𝑌 = 0 ))) |
17 | 14, 16 | imbi12d 347 | . . . 4 ⊢ (𝑦 = 𝑌 → (((𝑋 · 𝑦) = 0 → (𝑋 = 0 ∨ 𝑦 = 0 )) ↔ ((𝑋 · 𝑌) = 0 → (𝑋 = 0 ∨ 𝑌 = 0 )))) |
18 | 12, 17 | rspc2va 3634 | . . 3 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 ))) → ((𝑋 · 𝑌) = 0 → (𝑋 = 0 ∨ 𝑌 = 0 ))) |
19 | 1, 7, 18 | syl2anc 586 | . 2 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 · 𝑌) = 0 → (𝑋 = 0 ∨ 𝑌 = 0 ))) |
20 | domnring 20063 | . . . . . 6 ⊢ (𝑅 ∈ Domn → 𝑅 ∈ Ring) | |
21 | 20 | 3ad2ant1 1129 | . . . . 5 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑅 ∈ Ring) |
22 | simp3 1134 | . . . . 5 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
23 | 2, 3, 4 | ringlz 19331 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵) → ( 0 · 𝑌) = 0 ) |
24 | 21, 22, 23 | syl2anc 586 | . . . 4 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( 0 · 𝑌) = 0 ) |
25 | oveq1 7157 | . . . . 5 ⊢ (𝑋 = 0 → (𝑋 · 𝑌) = ( 0 · 𝑌)) | |
26 | 25 | eqeq1d 2823 | . . . 4 ⊢ (𝑋 = 0 → ((𝑋 · 𝑌) = 0 ↔ ( 0 · 𝑌) = 0 )) |
27 | 24, 26 | syl5ibrcom 249 | . . 3 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 = 0 → (𝑋 · 𝑌) = 0 )) |
28 | simp2 1133 | . . . . 5 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
29 | 2, 3, 4 | ringrz 19332 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (𝑋 · 0 ) = 0 ) |
30 | 21, 28, 29 | syl2anc 586 | . . . 4 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 0 ) = 0 ) |
31 | oveq2 7158 | . . . . 5 ⊢ (𝑌 = 0 → (𝑋 · 𝑌) = (𝑋 · 0 )) | |
32 | 31 | eqeq1d 2823 | . . . 4 ⊢ (𝑌 = 0 → ((𝑋 · 𝑌) = 0 ↔ (𝑋 · 0 ) = 0 )) |
33 | 30, 32 | syl5ibrcom 249 | . . 3 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 = 0 → (𝑋 · 𝑌) = 0 )) |
34 | 27, 33 | jaod 855 | . 2 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 = 0 ∨ 𝑌 = 0 ) → (𝑋 · 𝑌) = 0 )) |
35 | 19, 34 | impbid 214 | 1 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 · 𝑌) = 0 ↔ (𝑋 = 0 ∨ 𝑌 = 0 ))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∨ wo 843 ∧ w3a 1083 = wceq 1533 ∈ wcel 2110 ∀wral 3138 ‘cfv 6350 (class class class)co 7150 Basecbs 16477 .rcmulr 16560 0gc0g 16707 Ringcrg 19291 NzRingcnzr 20024 Domncdomn 20047 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 ax-cnex 10587 ax-resscn 10588 ax-1cn 10589 ax-icn 10590 ax-addcl 10591 ax-addrcl 10592 ax-mulcl 10593 ax-mulrcl 10594 ax-mulcom 10595 ax-addass 10596 ax-mulass 10597 ax-distr 10598 ax-i2m1 10599 ax-1ne0 10600 ax-1rid 10601 ax-rnegex 10602 ax-rrecex 10603 ax-cnre 10604 ax-pre-lttri 10605 ax-pre-lttrn 10606 ax-pre-ltadd 10607 ax-pre-mulgt0 10608 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3497 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-tp 4566 df-op 4568 df-uni 4833 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5455 df-eprel 5460 df-po 5469 df-so 5470 df-fr 5509 df-we 5511 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-pred 6143 df-ord 6189 df-on 6190 df-lim 6191 df-suc 6192 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-f1 6355 df-fo 6356 df-f1o 6357 df-fv 6358 df-riota 7108 df-ov 7153 df-oprab 7154 df-mpo 7155 df-om 7575 df-wrecs 7941 df-recs 8002 df-rdg 8040 df-er 8283 df-en 8504 df-dom 8505 df-sdom 8506 df-pnf 10671 df-mnf 10672 df-xr 10673 df-ltxr 10674 df-le 10675 df-sub 10866 df-neg 10867 df-nn 11633 df-2 11694 df-ndx 16480 df-slot 16481 df-base 16483 df-sets 16484 df-plusg 16572 df-0g 16709 df-mgm 17846 df-sgrp 17895 df-mnd 17906 df-grp 18100 df-minusg 18101 df-mgp 19234 df-ring 19293 df-nzr 20025 df-domn 20051 |
This theorem is referenced by: domnmuln0 20065 opprdomn 20068 fidomndrnglem 20073 domnchr 20673 znidomb 20702 fta1glem2 24754 qsidomlem1 30960 lidldomn1 44185 |
Copyright terms: Public domain | W3C validator |