| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rngm2neg | GIF version | ||
| Description: Double negation of a product in a non-unital ring (mul2neg 8470 analog). (Contributed by Mario Carneiro, 4-Dec-2014.) Generalization of ringm2neg 13817. (Revised by AV, 17-Feb-2025.) |
| Ref | Expression |
|---|---|
| rngneglmul.b | ⊢ 𝐵 = (Base‘𝑅) |
| rngneglmul.t | ⊢ · = (.r‘𝑅) |
| rngneglmul.n | ⊢ 𝑁 = (invg‘𝑅) |
| rngneglmul.r | ⊢ (𝜑 → 𝑅 ∈ Rng) |
| rngneglmul.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| rngneglmul.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| rngm2neg | ⊢ (𝜑 → ((𝑁‘𝑋) · (𝑁‘𝑌)) = (𝑋 · 𝑌)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rngneglmul.b | . . 3 ⊢ 𝐵 = (Base‘𝑅) | |
| 2 | rngneglmul.t | . . 3 ⊢ · = (.r‘𝑅) | |
| 3 | rngneglmul.n | . . 3 ⊢ 𝑁 = (invg‘𝑅) | |
| 4 | rngneglmul.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ Rng) | |
| 5 | rngneglmul.x | . . 3 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 6 | rnggrp 13700 | . . . . 5 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp) | |
| 7 | 4, 6 | syl 14 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ Grp) |
| 8 | rngneglmul.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 9 | 1, 3, 7, 8 | grpinvcld 13381 | . . 3 ⊢ (𝜑 → (𝑁‘𝑌) ∈ 𝐵) |
| 10 | 1, 2, 3, 4, 5, 9 | rngmneg1 13709 | . 2 ⊢ (𝜑 → ((𝑁‘𝑋) · (𝑁‘𝑌)) = (𝑁‘(𝑋 · (𝑁‘𝑌)))) |
| 11 | 1, 2, 3, 4, 5, 8 | rngmneg2 13710 | . . 3 ⊢ (𝜑 → (𝑋 · (𝑁‘𝑌)) = (𝑁‘(𝑋 · 𝑌))) |
| 12 | 11 | fveq2d 5580 | . 2 ⊢ (𝜑 → (𝑁‘(𝑋 · (𝑁‘𝑌))) = (𝑁‘(𝑁‘(𝑋 · 𝑌)))) |
| 13 | 1, 2 | rngcl 13706 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 𝑌) ∈ 𝐵) |
| 14 | 4, 5, 8, 13 | syl3anc 1250 | . . 3 ⊢ (𝜑 → (𝑋 · 𝑌) ∈ 𝐵) |
| 15 | 1, 3 | grpinvinv 13399 | . . 3 ⊢ ((𝑅 ∈ Grp ∧ (𝑋 · 𝑌) ∈ 𝐵) → (𝑁‘(𝑁‘(𝑋 · 𝑌))) = (𝑋 · 𝑌)) |
| 16 | 7, 14, 15 | syl2anc 411 | . 2 ⊢ (𝜑 → (𝑁‘(𝑁‘(𝑋 · 𝑌))) = (𝑋 · 𝑌)) |
| 17 | 10, 12, 16 | 3eqtrd 2242 | 1 ⊢ (𝜑 → ((𝑁‘𝑋) · (𝑁‘𝑌)) = (𝑋 · 𝑌)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1373 ∈ wcel 2176 ‘cfv 5271 (class class class)co 5944 Basecbs 12832 .rcmulr 12910 Grpcgrp 13332 invgcminusg 13333 Rngcrng 13694 |
| 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 615 ax-in2 616 ax-io 711 ax-5 1470 ax-7 1471 ax-gen 1472 ax-ie1 1516 ax-ie2 1517 ax-8 1527 ax-10 1528 ax-11 1529 ax-i12 1530 ax-bndl 1532 ax-4 1533 ax-17 1549 ax-i9 1553 ax-ial 1557 ax-i5r 1558 ax-13 2178 ax-14 2179 ax-ext 2187 ax-coll 4159 ax-sep 4162 ax-pow 4218 ax-pr 4253 ax-un 4480 ax-setind 4585 ax-cnex 8016 ax-resscn 8017 ax-1cn 8018 ax-1re 8019 ax-icn 8020 ax-addcl 8021 ax-addrcl 8022 ax-mulcl 8023 ax-addcom 8025 ax-addass 8027 ax-i2m1 8030 ax-0lt1 8031 ax-0id 8033 ax-rnegex 8034 ax-pre-ltirr 8037 ax-pre-ltadd 8041 |
| This theorem depends on definitions: df-bi 117 df-3an 983 df-tru 1376 df-fal 1379 df-nf 1484 df-sb 1786 df-eu 2057 df-mo 2058 df-clab 2192 df-cleq 2198 df-clel 2201 df-nfc 2337 df-ne 2377 df-nel 2472 df-ral 2489 df-rex 2490 df-reu 2491 df-rmo 2492 df-rab 2493 df-v 2774 df-sbc 2999 df-csb 3094 df-dif 3168 df-un 3170 df-in 3172 df-ss 3179 df-nul 3461 df-pw 3618 df-sn 3639 df-pr 3640 df-op 3642 df-uni 3851 df-int 3886 df-iun 3929 df-br 4045 df-opab 4106 df-mpt 4107 df-id 4340 df-xp 4681 df-rel 4682 df-cnv 4683 df-co 4684 df-dm 4685 df-rn 4686 df-res 4687 df-ima 4688 df-iota 5232 df-fun 5273 df-fn 5274 df-f 5275 df-f1 5276 df-fo 5277 df-f1o 5278 df-fv 5279 df-riota 5899 df-ov 5947 df-oprab 5948 df-mpo 5949 df-pnf 8109 df-mnf 8110 df-ltxr 8112 df-inn 9037 df-2 9095 df-3 9096 df-ndx 12835 df-slot 12836 df-base 12838 df-sets 12839 df-plusg 12922 df-mulr 12923 df-0g 13090 df-mgm 13188 df-sgrp 13234 df-mnd 13249 df-grp 13335 df-minusg 13336 df-abl 13623 df-mgp 13683 df-rng 13695 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |