| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > xpsinv | Structured version Visualization version GIF version | ||
| Description: Value of the negation operation in a binary structure product. (Contributed by AV, 18-Mar-2025.) |
| Ref | Expression |
|---|---|
| xpsinv.t | ⊢ 𝑇 = (𝑅 ×s 𝑆) |
| xpsinv.x | ⊢ 𝑋 = (Base‘𝑅) |
| xpsinv.y | ⊢ 𝑌 = (Base‘𝑆) |
| xpsinv.r | ⊢ (𝜑 → 𝑅 ∈ Grp) |
| xpsinv.s | ⊢ (𝜑 → 𝑆 ∈ Grp) |
| xpsinv.a | ⊢ (𝜑 → 𝐴 ∈ 𝑋) |
| xpsinv.b | ⊢ (𝜑 → 𝐵 ∈ 𝑌) |
| xpsinv.m | ⊢ 𝑀 = (invg‘𝑅) |
| xpsinv.n | ⊢ 𝑁 = (invg‘𝑆) |
| xpsinv.i | ⊢ 𝐼 = (invg‘𝑇) |
| Ref | Expression |
|---|---|
| xpsinv | ⊢ (𝜑 → (𝐼‘〈𝐴, 𝐵〉) = 〈(𝑀‘𝐴), (𝑁‘𝐵)〉) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | xpsinv.x | . . . . 5 ⊢ 𝑋 = (Base‘𝑅) | |
| 2 | eqid 2769 | . . . . 5 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 3 | eqid 2769 | . . . . 5 ⊢ (0g‘𝑅) = (0g‘𝑅) | |
| 4 | xpsinv.m | . . . . 5 ⊢ 𝑀 = (invg‘𝑅) | |
| 5 | xpsinv.r | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ Grp) | |
| 6 | xpsinv.a | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ 𝑋) | |
| 7 | 1, 2, 3, 4, 5, 6 | grplinvd 19060 | . . . 4 ⊢ (𝜑 → ((𝑀‘𝐴)(+g‘𝑅)𝐴) = (0g‘𝑅)) |
| 8 | xpsinv.y | . . . . 5 ⊢ 𝑌 = (Base‘𝑆) | |
| 9 | eqid 2769 | . . . . 5 ⊢ (+g‘𝑆) = (+g‘𝑆) | |
| 10 | eqid 2769 | . . . . 5 ⊢ (0g‘𝑆) = (0g‘𝑆) | |
| 11 | xpsinv.n | . . . . 5 ⊢ 𝑁 = (invg‘𝑆) | |
| 12 | xpsinv.s | . . . . 5 ⊢ (𝜑 → 𝑆 ∈ Grp) | |
| 13 | xpsinv.b | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ 𝑌) | |
| 14 | 8, 9, 10, 11, 12, 13 | grplinvd 19060 | . . . 4 ⊢ (𝜑 → ((𝑁‘𝐵)(+g‘𝑆)𝐵) = (0g‘𝑆)) |
| 15 | 7, 14 | opeq12d 4850 | . . 3 ⊢ (𝜑 → 〈((𝑀‘𝐴)(+g‘𝑅)𝐴), ((𝑁‘𝐵)(+g‘𝑆)𝐵)〉 = 〈(0g‘𝑅), (0g‘𝑆)〉) |
| 16 | xpsinv.t | . . . 4 ⊢ 𝑇 = (𝑅 ×s 𝑆) | |
| 17 | 1, 4, 5, 6 | grpinvcld 19054 | . . . 4 ⊢ (𝜑 → (𝑀‘𝐴) ∈ 𝑋) |
| 18 | 8, 11, 12, 13 | grpinvcld 19054 | . . . 4 ⊢ (𝜑 → (𝑁‘𝐵) ∈ 𝑌) |
| 19 | 1, 2, 5, 17, 6 | grpcld 19013 | . . . 4 ⊢ (𝜑 → ((𝑀‘𝐴)(+g‘𝑅)𝐴) ∈ 𝑋) |
| 20 | 8, 9, 12, 18, 13 | grpcld 19013 | . . . 4 ⊢ (𝜑 → ((𝑁‘𝐵)(+g‘𝑆)𝐵) ∈ 𝑌) |
| 21 | eqid 2769 | . . . 4 ⊢ (+g‘𝑇) = (+g‘𝑇) | |
| 22 | 16, 1, 8, 5, 12, 17, 18, 6, 13, 19, 20, 2, 9, 21 | xpsadd 17627 | . . 3 ⊢ (𝜑 → (〈(𝑀‘𝐴), (𝑁‘𝐵)〉(+g‘𝑇)〈𝐴, 𝐵〉) = 〈((𝑀‘𝐴)(+g‘𝑅)𝐴), ((𝑁‘𝐵)(+g‘𝑆)𝐵)〉) |
| 23 | 5 | grpmndd 19012 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ Mnd) |
| 24 | 12 | grpmndd 19012 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ Mnd) |
| 25 | 16 | xpsmnd0 18835 | . . . 4 ⊢ ((𝑅 ∈ Mnd ∧ 𝑆 ∈ Mnd) → (0g‘𝑇) = 〈(0g‘𝑅), (0g‘𝑆)〉) |
| 26 | 23, 24, 25 | syl2anc 595 | . . 3 ⊢ (𝜑 → (0g‘𝑇) = 〈(0g‘𝑅), (0g‘𝑆)〉) |
| 27 | 15, 22, 26 | 3eqtr4d 2814 | . 2 ⊢ (𝜑 → (〈(𝑀‘𝐴), (𝑁‘𝐵)〉(+g‘𝑇)〈𝐴, 𝐵〉) = (0g‘𝑇)) |
| 28 | 16 | xpsgrp 19124 | . . . 4 ⊢ ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) → 𝑇 ∈ Grp) |
| 29 | 5, 12, 28 | syl2anc 595 | . . 3 ⊢ (𝜑 → 𝑇 ∈ Grp) |
| 30 | 6, 13 | opelxpd 5701 | . . . 4 ⊢ (𝜑 → 〈𝐴, 𝐵〉 ∈ (𝑋 × 𝑌)) |
| 31 | 16, 1, 8, 5, 12 | xpsbas 17625 | . . . 4 ⊢ (𝜑 → (𝑋 × 𝑌) = (Base‘𝑇)) |
| 32 | 30, 31 | eleqtrd 2871 | . . 3 ⊢ (𝜑 → 〈𝐴, 𝐵〉 ∈ (Base‘𝑇)) |
| 33 | 17, 18 | opelxpd 5701 | . . . 4 ⊢ (𝜑 → 〈(𝑀‘𝐴), (𝑁‘𝐵)〉 ∈ (𝑋 × 𝑌)) |
| 34 | 33, 31 | eleqtrd 2871 | . . 3 ⊢ (𝜑 → 〈(𝑀‘𝐴), (𝑁‘𝐵)〉 ∈ (Base‘𝑇)) |
| 35 | eqid 2769 | . . . 4 ⊢ (Base‘𝑇) = (Base‘𝑇) | |
| 36 | eqid 2769 | . . . 4 ⊢ (0g‘𝑇) = (0g‘𝑇) | |
| 37 | xpsinv.i | . . . 4 ⊢ 𝐼 = (invg‘𝑇) | |
| 38 | 35, 21, 36, 37 | grpinvid2 19058 | . . 3 ⊢ ((𝑇 ∈ Grp ∧ 〈𝐴, 𝐵〉 ∈ (Base‘𝑇) ∧ 〈(𝑀‘𝐴), (𝑁‘𝐵)〉 ∈ (Base‘𝑇)) → ((𝐼‘〈𝐴, 𝐵〉) = 〈(𝑀‘𝐴), (𝑁‘𝐵)〉 ↔ (〈(𝑀‘𝐴), (𝑁‘𝐵)〉(+g‘𝑇)〈𝐴, 𝐵〉) = (0g‘𝑇))) |
| 39 | 29, 32, 34, 38 | syl3anc 1396 | . 2 ⊢ (𝜑 → ((𝐼‘〈𝐴, 𝐵〉) = 〈(𝑀‘𝐴), (𝑁‘𝐵)〉 ↔ (〈(𝑀‘𝐴), (𝑁‘𝐵)〉(+g‘𝑇)〈𝐴, 𝐵〉) = (0g‘𝑇))) |
| 40 | 27, 39 | mpbird 260 | 1 ⊢ (𝜑 → (𝐼‘〈𝐴, 𝐵〉) = 〈(𝑀‘𝐴), (𝑁‘𝐵)〉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 = wceq 1567 ∈ wcel 2149 〈cop 4600 × cxp 5660 ‘cfv 6537 (class class class)co 7411 Basecbs 17268 +gcplusg 17309 0gc0g 17491 ×s cxps 17559 Mndcmnd 18791 Grpcgrp 18999 invgcminusg 19000 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 ax-cnex 11155 ax-resscn 11156 ax-1cn 11157 ax-icn 11158 ax-addcl 11159 ax-addrcl 11160 ax-mulcl 11161 ax-mulrcl 11162 ax-mulcom 11163 ax-addass 11164 ax-mulass 11165 ax-distr 11166 ax-i2m1 11167 ax-1ne0 11168 ax-1rid 11169 ax-rnegex 11170 ax-rrecex 11171 ax-cnre 11172 ax-pre-lttri 11173 ax-pre-lttrn 11174 ax-pre-ltadd 11175 ax-pre-mulgt0 11176 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3or 1102 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-nel 3071 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-pss 3933 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-tp 4599 df-op 4601 df-uni 4877 df-iun 4962 df-br 5114 df-opab 5178 df-mpt 5197 df-tr 5223 df-id 5557 df-eprel 5562 df-po 5570 df-so 5571 df-fr 5615 df-we 5617 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-pred 6303 df-ord 6364 df-on 6365 df-lim 6366 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-mpo 7416 df-om 7862 df-1st 7985 df-2nd 7986 df-frecs 8277 df-wrecs 8308 df-recs 8357 df-rdg 8396 df-1o 8452 df-2o 8453 df-er 8693 df-map 8825 df-ixp 8895 df-en 8943 df-dom 8944 df-sdom 8945 df-fin 8946 df-sup 9401 df-inf 9402 df-pnf 11244 df-mnf 11245 df-xr 11246 df-ltxr 11247 df-le 11248 df-sub 11442 df-neg 11443 df-nn 12233 df-2 12302 df-3 12303 df-4 12304 df-5 12305 df-6 12306 df-7 12307 df-8 12308 df-9 12309 df-n0 12504 df-z 12591 df-dec 12711 df-uz 12862 df-fz 13535 df-struct 17206 df-slot 17241 df-ndx 17253 df-base 17269 df-plusg 17322 df-mulr 17323 df-sca 17325 df-vsca 17326 df-ip 17327 df-tset 17328 df-ple 17329 df-ds 17331 df-hom 17333 df-cco 17334 df-0g 17493 df-prds 17499 df-imas 17561 df-xps 17563 df-mgm 18697 df-sgrp 18776 df-mnd 18792 df-grp 19002 df-minusg 19003 |
| This theorem is referenced by: pzriprnglem4 21602 |
| Copyright terms: Public domain | W3C validator |