| 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 1151 | . . 3 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵)) | |
| 2 | domneq0.b | . . . . . 6 ⊢ 𝐵 = (Base‘𝑅) | |
| 3 | domneq0.t | . . . . . 6 ⊢ · = (.r‘𝑅) | |
| 4 | domneq0.z | . . . . . 6 ⊢ 0 = (0g‘𝑅) | |
| 5 | 2, 3, 4 | isdomn 20650 | . . . . 5 ⊢ (𝑅 ∈ Domn ↔ (𝑅 ∈ NzRing ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 )))) |
| 6 | 5 | simprbi 497 | . . . 4 ⊢ (𝑅 ∈ Domn → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 ))) |
| 7 | 6 | 3ad2ant1 1134 | . . 3 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 ))) |
| 8 | oveq1 7375 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑥 · 𝑦) = (𝑋 · 𝑦)) | |
| 9 | 8 | eqeq1d 2739 | . . . . 5 ⊢ (𝑥 = 𝑋 → ((𝑥 · 𝑦) = 0 ↔ (𝑋 · 𝑦) = 0 )) |
| 10 | eqeq1 2741 | . . . . . 6 ⊢ (𝑥 = 𝑋 → (𝑥 = 0 ↔ 𝑋 = 0 )) | |
| 11 | 10 | orbi1d 917 | . . . . 5 ⊢ (𝑥 = 𝑋 → ((𝑥 = 0 ∨ 𝑦 = 0 ) ↔ (𝑋 = 0 ∨ 𝑦 = 0 ))) |
| 12 | 9, 11 | imbi12d 344 | . . . 4 ⊢ (𝑥 = 𝑋 → (((𝑥 · 𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 )) ↔ ((𝑋 · 𝑦) = 0 → (𝑋 = 0 ∨ 𝑦 = 0 )))) |
| 13 | oveq2 7376 | . . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑋 · 𝑦) = (𝑋 · 𝑌)) | |
| 14 | 13 | eqeq1d 2739 | . . . . 5 ⊢ (𝑦 = 𝑌 → ((𝑋 · 𝑦) = 0 ↔ (𝑋 · 𝑌) = 0 )) |
| 15 | eqeq1 2741 | . . . . . 6 ⊢ (𝑦 = 𝑌 → (𝑦 = 0 ↔ 𝑌 = 0 )) | |
| 16 | 15 | orbi2d 916 | . . . . 5 ⊢ (𝑦 = 𝑌 → ((𝑋 = 0 ∨ 𝑦 = 0 ) ↔ (𝑋 = 0 ∨ 𝑌 = 0 ))) |
| 17 | 14, 16 | imbi12d 344 | . . . 4 ⊢ (𝑦 = 𝑌 → (((𝑋 · 𝑦) = 0 → (𝑋 = 0 ∨ 𝑦 = 0 )) ↔ ((𝑋 · 𝑌) = 0 → (𝑋 = 0 ∨ 𝑌 = 0 )))) |
| 18 | 12, 17 | rspc2va 3590 | . . 3 ⊢ (((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ((𝑥 · 𝑦) = 0 → (𝑥 = 0 ∨ 𝑦 = 0 ))) → ((𝑋 · 𝑌) = 0 → (𝑋 = 0 ∨ 𝑌 = 0 ))) |
| 19 | 1, 7, 18 | syl2anc 585 | . 2 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 · 𝑌) = 0 → (𝑋 = 0 ∨ 𝑌 = 0 ))) |
| 20 | domnring 20652 | . . . . . 6 ⊢ (𝑅 ∈ Domn → 𝑅 ∈ Ring) | |
| 21 | 20 | 3ad2ant1 1134 | . . . . 5 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑅 ∈ Ring) |
| 22 | simp3 1139 | . . . . 5 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 23 | 2, 3, 4 | ringlz 20240 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑌 ∈ 𝐵) → ( 0 · 𝑌) = 0 ) |
| 24 | 21, 22, 23 | syl2anc 585 | . . . 4 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ( 0 · 𝑌) = 0 ) |
| 25 | oveq1 7375 | . . . . 5 ⊢ (𝑋 = 0 → (𝑋 · 𝑌) = ( 0 · 𝑌)) | |
| 26 | 25 | eqeq1d 2739 | . . . 4 ⊢ (𝑋 = 0 → ((𝑋 · 𝑌) = 0 ↔ ( 0 · 𝑌) = 0 )) |
| 27 | 24, 26 | syl5ibrcom 247 | . . 3 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 = 0 → (𝑋 · 𝑌) = 0 )) |
| 28 | simp2 1138 | . . . . 5 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 29 | 2, 3, 4 | ringrz 20241 | . . . . 5 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (𝑋 · 0 ) = 0 ) |
| 30 | 21, 28, 29 | syl2anc 585 | . . . 4 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 0 ) = 0 ) |
| 31 | oveq2 7376 | . . . . 5 ⊢ (𝑌 = 0 → (𝑋 · 𝑌) = (𝑋 · 0 )) | |
| 32 | 31 | eqeq1d 2739 | . . . 4 ⊢ (𝑌 = 0 → ((𝑋 · 𝑌) = 0 ↔ (𝑋 · 0 ) = 0 )) |
| 33 | 30, 32 | syl5ibrcom 247 | . . 3 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑌 = 0 → (𝑋 · 𝑌) = 0 )) |
| 34 | 27, 33 | jaod 860 | . 2 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 = 0 ∨ 𝑌 = 0 ) → (𝑋 · 𝑌) = 0 )) |
| 35 | 19, 34 | impbid 212 | 1 ⊢ ((𝑅 ∈ Domn ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ((𝑋 · 𝑌) = 0 ↔ (𝑋 = 0 ∨ 𝑌 = 0 ))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∨ wo 848 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 ∀wral 3052 ‘cfv 6500 (class class class)co 7368 Basecbs 17148 .rcmulr 17190 0gc0g 17371 Ringcrg 20180 NzRingcnzr 20457 Domncdomn 20637 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-pss 3923 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-tr 5208 df-id 5527 df-eprel 5532 df-po 5540 df-so 5541 df-fr 5585 df-we 5587 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-pred 6267 df-ord 6328 df-on 6329 df-lim 6330 df-suc 6331 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-mpo 7373 df-om 7819 df-2nd 7944 df-frecs 8233 df-wrecs 8264 df-recs 8313 df-rdg 8351 df-er 8645 df-en 8896 df-dom 8897 df-sdom 8898 df-pnf 11180 df-mnf 11181 df-xr 11182 df-ltxr 11183 df-le 11184 df-sub 11378 df-neg 11379 df-nn 12158 df-2 12220 df-sets 17103 df-slot 17121 df-ndx 17133 df-base 17149 df-plusg 17202 df-0g 17373 df-mgm 18577 df-sgrp 18656 df-mnd 18672 df-grp 18878 df-minusg 18879 df-cmn 19723 df-abl 19724 df-mgp 20088 df-rng 20100 df-ur 20129 df-ring 20182 df-nzr 20458 df-domn 20640 |
| This theorem is referenced by: domnmuln0 20654 drngmul0or 20705 fidomndrnglem 20717 domnchr 21499 znidomb 21528 fta1glem2 26142 domnmuln0rd 33367 domnprodeq0 33369 subrdom 33378 qsidomlem1 33544 minplyirred 33888 lidldomn1 48588 |
| Copyright terms: Public domain | W3C validator |