| 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 8469 analog). (Contributed by Mario Carneiro, 4-Dec-2014.) Generalization of ringm2neg 13788. (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 13671 | . . . . 5 ⊢ (𝑅 ∈ Rng → 𝑅 ∈ Grp) | |
| 7 | 4, 6 | syl 14 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ Grp) |
| 8 | rngneglmul.y | . . . 4 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 9 | 1, 3, 7, 8 | grpinvcld 13352 | . . 3 ⊢ (𝜑 → (𝑁‘𝑌) ∈ 𝐵) |
| 10 | 1, 2, 3, 4, 5, 9 | rngmneg1 13680 | . 2 ⊢ (𝜑 → ((𝑁‘𝑋) · (𝑁‘𝑌)) = (𝑁‘(𝑋 · (𝑁‘𝑌)))) |
| 11 | 1, 2, 3, 4, 5, 8 | rngmneg2 13681 | . . 3 ⊢ (𝜑 → (𝑋 · (𝑁‘𝑌)) = (𝑁‘(𝑋 · 𝑌))) |
| 12 | 11 | fveq2d 5579 | . 2 ⊢ (𝜑 → (𝑁‘(𝑋 · (𝑁‘𝑌))) = (𝑁‘(𝑁‘(𝑋 · 𝑌)))) |
| 13 | 1, 2 | rngcl 13677 | . . . 4 ⊢ ((𝑅 ∈ Rng ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 · 𝑌) ∈ 𝐵) |
| 14 | 4, 5, 8, 13 | syl3anc 1249 | . . 3 ⊢ (𝜑 → (𝑋 · 𝑌) ∈ 𝐵) |
| 15 | 1, 3 | grpinvinv 13370 | . . 3 ⊢ ((𝑅 ∈ Grp ∧ (𝑋 · 𝑌) ∈ 𝐵) → (𝑁‘(𝑁‘(𝑋 · 𝑌))) = (𝑋 · 𝑌)) |
| 16 | 7, 14, 15 | syl2anc 411 | . 2 ⊢ (𝜑 → (𝑁‘(𝑁‘(𝑋 · 𝑌))) = (𝑋 · 𝑌)) |
| 17 | 10, 12, 16 | 3eqtrd 2241 | 1 ⊢ (𝜑 → ((𝑁‘𝑋) · (𝑁‘𝑌)) = (𝑋 · 𝑌)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1372 ∈ wcel 2175 ‘cfv 5270 (class class class)co 5943 Basecbs 12803 .rcmulr 12881 Grpcgrp 13303 invgcminusg 13304 Rngcrng 13665 |
| 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 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-13 2177 ax-14 2178 ax-ext 2186 ax-coll 4158 ax-sep 4161 ax-pow 4217 ax-pr 4252 ax-un 4479 ax-setind 4584 ax-cnex 8015 ax-resscn 8016 ax-1cn 8017 ax-1re 8018 ax-icn 8019 ax-addcl 8020 ax-addrcl 8021 ax-mulcl 8022 ax-addcom 8024 ax-addass 8026 ax-i2m1 8029 ax-0lt1 8030 ax-0id 8032 ax-rnegex 8033 ax-pre-ltirr 8036 ax-pre-ltadd 8040 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1375 df-fal 1378 df-nf 1483 df-sb 1785 df-eu 2056 df-mo 2057 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-ne 2376 df-nel 2471 df-ral 2488 df-rex 2489 df-reu 2490 df-rmo 2491 df-rab 2492 df-v 2773 df-sbc 2998 df-csb 3093 df-dif 3167 df-un 3169 df-in 3171 df-ss 3178 df-nul 3460 df-pw 3617 df-sn 3638 df-pr 3639 df-op 3641 df-uni 3850 df-int 3885 df-iun 3928 df-br 4044 df-opab 4105 df-mpt 4106 df-id 4339 df-xp 4680 df-rel 4681 df-cnv 4682 df-co 4683 df-dm 4684 df-rn 4685 df-res 4686 df-ima 4687 df-iota 5231 df-fun 5272 df-fn 5273 df-f 5274 df-f1 5275 df-fo 5276 df-f1o 5277 df-fv 5278 df-riota 5898 df-ov 5946 df-oprab 5947 df-mpo 5948 df-pnf 8108 df-mnf 8109 df-ltxr 8111 df-inn 9036 df-2 9094 df-3 9095 df-ndx 12806 df-slot 12807 df-base 12809 df-sets 12810 df-plusg 12893 df-mulr 12894 df-0g 13061 df-mgm 13159 df-sgrp 13205 df-mnd 13220 df-grp 13306 df-minusg 13307 df-abl 13594 df-mgp 13654 df-rng 13666 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |