| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ringm2neg | GIF version | ||
| Description: Double negation of a product in a ring. (mul2neg 8619 analog.) (Contributed by Mario Carneiro, 4-Dec-2014.) |
| Ref | Expression |
|---|---|
| ringneglmul.b | ⊢ 𝐵 = (Base‘𝑅) |
| ringneglmul.t | ⊢ · = (.r‘𝑅) |
| ringneglmul.n | ⊢ 𝑁 = (invg‘𝑅) |
| ringneglmul.r | ⊢ (𝜑 → 𝑅 ∈ Ring) |
| ringneglmul.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| ringneglmul.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| ringm2neg | ⊢ (𝜑 → ((𝑁‘𝑋) · (𝑁‘𝑌)) = (𝑋 · 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ringneglmul.b | . . 3 ⊢ 𝐵 = (Base‘𝑅) | |
| 2 | ringneglmul.t | . . 3 ⊢ · = (.r‘𝑅) | |
| 3 | ringneglmul.n | . . 3 ⊢ 𝑁 = (invg‘𝑅) | |
| 4 | ringneglmul.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ Ring) | |
| 5 | ringneglmul.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 6 | ringgrp 14078 | . . . . 5 ⊢ (𝑅 ∈ Ring → 𝑅 ∈ Grp) | |
| 7 | 4, 6 | syl 14 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ Grp) |
| 8 | ringneglmul.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 9 | 1, 3 | grpinvcl 13694 | . . . 4 ⊢ ((𝑅 ∈ Grp ∧ 𝑌 ∈ 𝐵) → (𝑁‘𝑌) ∈ 𝐵) |
| 10 | 7, 8, 9 | syl2anc 411 | . . 3 ⊢ (𝜑 → (𝑁‘𝑌) ∈ 𝐵) |
| 11 | 1, 2, 3, 4, 5, 10 | ringmneg1 14130 | . 2 ⊢ (𝜑 → ((𝑁‘𝑋) · (𝑁‘𝑌)) = (𝑁‘(𝑋 · (𝑁‘𝑌)))) |
| 12 | 1, 2, 3, 4, 5, 8 | ringmneg2 14131 | . . 3 ⊢ (𝜑 → (𝑋 · (𝑁‘𝑌)) = (𝑁‘(𝑋 · 𝑌))) |
| 13 | 12 | fveq2d 5652 | . 2 ⊢ (𝜑 → (𝑁‘(𝑋 · (𝑁‘𝑌))) = (𝑁‘(𝑁‘(𝑋 · 𝑌)))) |
| 14 | 1, 2 | ringcl 14090 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 𝑌) ∈ 𝐵) |
| 15 | 4, 5, 8, 14 | syl3anc 1274 | . . 3 ⊢ (𝜑 → (𝑋 · 𝑌) ∈ 𝐵) |
| 16 | 1, 3 | grpinvinv 13713 | . . 3 ⊢ ((𝑅 ∈ Grp ∧ (𝑋 · 𝑌) ∈ 𝐵) → (𝑁‘(𝑁‘(𝑋 · 𝑌))) = (𝑋 · 𝑌)) |
| 17 | 7, 15, 16 | syl2anc 411 | . 2 ⊢ (𝜑 → (𝑁‘(𝑁‘(𝑋 · 𝑌))) = (𝑋 · 𝑌)) |
| 18 | 11, 13, 17 | 3eqtrd 2268 | 1 ⊢ (𝜑 → ((𝑁‘𝑋) · (𝑁‘𝑌)) = (𝑋 · 𝑌)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ∈ wcel 2202 ‘cfv 5333 (class class class)co 6028 Basecbs 13145 .rcmulr 13224 Grpcgrp 13646 invgcminusg 13647 Ringcrg 14073 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2204 ax-14 2205 ax-ext 2213 ax-coll 4209 ax-sep 4212 ax-pow 4270 ax-pr 4305 ax-un 4536 ax-setind 4641 ax-cnex 8166 ax-resscn 8167 ax-1cn 8168 ax-1re 8169 ax-icn 8170 ax-addcl 8171 ax-addrcl 8172 ax-mulcl 8173 ax-addcom 8175 ax-addass 8177 ax-i2m1 8180 ax-0lt1 8181 ax-0id 8183 ax-rnegex 8184 ax-pre-ltirr 8187 ax-pre-ltadd 8191 |
| This theorem depends on definitions: df-bi 117 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1811 df-eu 2082 df-mo 2083 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2364 df-ne 2404 df-nel 2499 df-ral 2516 df-rex 2517 df-reu 2518 df-rmo 2519 df-rab 2520 df-v 2805 df-sbc 3033 df-csb 3129 df-dif 3203 df-un 3205 df-in 3207 df-ss 3214 df-nul 3497 df-pw 3658 df-sn 3679 df-pr 3680 df-op 3682 df-uni 3899 df-int 3934 df-iun 3977 df-br 4094 df-opab 4156 df-mpt 4157 df-id 4396 df-xp 4737 df-rel 4738 df-cnv 4739 df-co 4740 df-dm 4741 df-rn 4742 df-res 4743 df-ima 4744 df-iota 5293 df-fun 5335 df-fn 5336 df-f 5337 df-f1 5338 df-fo 5339 df-f1o 5340 df-fv 5341 df-riota 5981 df-ov 6031 df-oprab 6032 df-mpo 6033 df-pnf 8258 df-mnf 8259 df-ltxr 8261 df-inn 9186 df-2 9244 df-3 9245 df-ndx 13148 df-slot 13149 df-base 13151 df-sets 13152 df-plusg 13236 df-mulr 13237 df-0g 13404 df-mgm 13502 df-sgrp 13548 df-mnd 13563 df-grp 13649 df-minusg 13650 df-mgp 13998 df-ur 14037 df-ring 14075 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |