| 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 2737 | . . . . 5 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 3 | eqid 2737 | . . . . 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 19012 | . . . 4 ⊢ (𝜑 → ((𝑀‘𝐴)(+g‘𝑅)𝐴) = (0g‘𝑅)) |
| 8 | xpsinv.y | . . . . 5 ⊢ 𝑌 = (Base‘𝑆) | |
| 9 | eqid 2737 | . . . . 5 ⊢ (+g‘𝑆) = (+g‘𝑆) | |
| 10 | eqid 2737 | . . . . 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 19012 | . . . 4 ⊢ (𝜑 → ((𝑁‘𝐵)(+g‘𝑆)𝐵) = (0g‘𝑆)) |
| 15 | 7, 14 | opeq12d 4881 | . . 3 ⊢ (𝜑 → 〈((𝑀‘𝐴)(+g‘𝑅)𝐴), ((𝑁‘𝐵)(+g‘𝑆)𝐵)〉 = 〈(0g‘𝑅), (0g‘𝑆)〉) |
| 16 | xpsinv.t | . . . 4 ⊢ 𝑇 = (𝑅 ×s 𝑆) | |
| 17 | 1, 4, 5, 6 | grpinvcld 19006 | . . . 4 ⊢ (𝜑 → (𝑀‘𝐴) ∈ 𝑋) |
| 18 | 8, 11, 12, 13 | grpinvcld 19006 | . . . 4 ⊢ (𝜑 → (𝑁‘𝐵) ∈ 𝑌) |
| 19 | 1, 2, 5, 17, 6 | grpcld 18965 | . . . 4 ⊢ (𝜑 → ((𝑀‘𝐴)(+g‘𝑅)𝐴) ∈ 𝑋) |
| 20 | 8, 9, 12, 18, 13 | grpcld 18965 | . . . 4 ⊢ (𝜑 → ((𝑁‘𝐵)(+g‘𝑆)𝐵) ∈ 𝑌) |
| 21 | eqid 2737 | . . . 4 ⊢ (+g‘𝑇) = (+g‘𝑇) | |
| 22 | 16, 1, 8, 5, 12, 17, 18, 6, 13, 19, 20, 2, 9, 21 | xpsadd 17619 | . . 3 ⊢ (𝜑 → (〈(𝑀‘𝐴), (𝑁‘𝐵)〉(+g‘𝑇)〈𝐴, 𝐵〉) = 〈((𝑀‘𝐴)(+g‘𝑅)𝐴), ((𝑁‘𝐵)(+g‘𝑆)𝐵)〉) |
| 23 | 5 | grpmndd 18964 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ Mnd) |
| 24 | 12 | grpmndd 18964 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ Mnd) |
| 25 | 16 | xpsmnd0 18791 | . . . 4 ⊢ ((𝑅 ∈ Mnd ∧ 𝑆 ∈ Mnd) → (0g‘𝑇) = 〈(0g‘𝑅), (0g‘𝑆)〉) |
| 26 | 23, 24, 25 | syl2anc 584 | . . 3 ⊢ (𝜑 → (0g‘𝑇) = 〈(0g‘𝑅), (0g‘𝑆)〉) |
| 27 | 15, 22, 26 | 3eqtr4d 2787 | . 2 ⊢ (𝜑 → (〈(𝑀‘𝐴), (𝑁‘𝐵)〉(+g‘𝑇)〈𝐴, 𝐵〉) = (0g‘𝑇)) |
| 28 | 16 | xpsgrp 19077 | . . . 4 ⊢ ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) → 𝑇 ∈ Grp) |
| 29 | 5, 12, 28 | syl2anc 584 | . . 3 ⊢ (𝜑 → 𝑇 ∈ Grp) |
| 30 | 6, 13 | opelxpd 5724 | . . . 4 ⊢ (𝜑 → 〈𝐴, 𝐵〉 ∈ (𝑋 × 𝑌)) |
| 31 | 16, 1, 8, 5, 12 | xpsbas 17617 | . . . 4 ⊢ (𝜑 → (𝑋 × 𝑌) = (Base‘𝑇)) |
| 32 | 30, 31 | eleqtrd 2843 | . . 3 ⊢ (𝜑 → 〈𝐴, 𝐵〉 ∈ (Base‘𝑇)) |
| 33 | 17, 18 | opelxpd 5724 | . . . 4 ⊢ (𝜑 → 〈(𝑀‘𝐴), (𝑁‘𝐵)〉 ∈ (𝑋 × 𝑌)) |
| 34 | 33, 31 | eleqtrd 2843 | . . 3 ⊢ (𝜑 → 〈(𝑀‘𝐴), (𝑁‘𝐵)〉 ∈ (Base‘𝑇)) |
| 35 | eqid 2737 | . . . 4 ⊢ (Base‘𝑇) = (Base‘𝑇) | |
| 36 | eqid 2737 | . . . 4 ⊢ (0g‘𝑇) = (0g‘𝑇) | |
| 37 | xpsinv.i | . . . 4 ⊢ 𝐼 = (invg‘𝑇) | |
| 38 | 35, 21, 36, 37 | grpinvid2 19010 | . . 3 ⊢ ((𝑇 ∈ Grp ∧ 〈𝐴, 𝐵〉 ∈ (Base‘𝑇) ∧ 〈(𝑀‘𝐴), (𝑁‘𝐵)〉 ∈ (Base‘𝑇)) → ((𝐼‘〈𝐴, 𝐵〉) = 〈(𝑀‘𝐴), (𝑁‘𝐵)〉 ↔ (〈(𝑀‘𝐴), (𝑁‘𝐵)〉(+g‘𝑇)〈𝐴, 𝐵〉) = (0g‘𝑇))) |
| 39 | 29, 32, 34, 38 | syl3anc 1373 | . 2 ⊢ (𝜑 → ((𝐼‘〈𝐴, 𝐵〉) = 〈(𝑀‘𝐴), (𝑁‘𝐵)〉 ↔ (〈(𝑀‘𝐴), (𝑁‘𝐵)〉(+g‘𝑇)〈𝐴, 𝐵〉) = (0g‘𝑇))) |
| 40 | 27, 39 | mpbird 257 | 1 ⊢ (𝜑 → (𝐼‘〈𝐴, 𝐵〉) = 〈(𝑀‘𝐴), (𝑁‘𝐵)〉) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1540 ∈ wcel 2108 〈cop 4632 × cxp 5683 ‘cfv 6561 (class class class)co 7431 Basecbs 17247 +gcplusg 17297 0gc0g 17484 ×s cxps 17551 Mndcmnd 18747 Grpcgrp 18951 invgcminusg 18952 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755 ax-cnex 11211 ax-resscn 11212 ax-1cn 11213 ax-icn 11214 ax-addcl 11215 ax-addrcl 11216 ax-mulcl 11217 ax-mulrcl 11218 ax-mulcom 11219 ax-addass 11220 ax-mulass 11221 ax-distr 11222 ax-i2m1 11223 ax-1ne0 11224 ax-1rid 11225 ax-rnegex 11226 ax-rrecex 11227 ax-cnre 11228 ax-pre-lttri 11229 ax-pre-lttrn 11230 ax-pre-ltadd 11231 ax-pre-mulgt0 11232 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-nel 3047 df-ral 3062 df-rex 3071 df-rmo 3380 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-pss 3971 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-tp 4631 df-op 4633 df-uni 4908 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-tr 5260 df-id 5578 df-eprel 5584 df-po 5592 df-so 5593 df-fr 5637 df-we 5639 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-pred 6321 df-ord 6387 df-on 6388 df-lim 6389 df-suc 6390 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8014 df-2nd 8015 df-frecs 8306 df-wrecs 8337 df-recs 8411 df-rdg 8450 df-1o 8506 df-2o 8507 df-er 8745 df-map 8868 df-ixp 8938 df-en 8986 df-dom 8987 df-sdom 8988 df-fin 8989 df-sup 9482 df-inf 9483 df-pnf 11297 df-mnf 11298 df-xr 11299 df-ltxr 11300 df-le 11301 df-sub 11494 df-neg 11495 df-nn 12267 df-2 12329 df-3 12330 df-4 12331 df-5 12332 df-6 12333 df-7 12334 df-8 12335 df-9 12336 df-n0 12527 df-z 12614 df-dec 12734 df-uz 12879 df-fz 13548 df-struct 17184 df-slot 17219 df-ndx 17231 df-base 17248 df-plusg 17310 df-mulr 17311 df-sca 17313 df-vsca 17314 df-ip 17315 df-tset 17316 df-ple 17317 df-ds 17319 df-hom 17321 df-cco 17322 df-0g 17486 df-prds 17492 df-imas 17553 df-xps 17555 df-mgm 18653 df-sgrp 18732 df-mnd 18748 df-grp 18954 df-minusg 18955 |
| This theorem is referenced by: pzriprnglem4 21495 |
| Copyright terms: Public domain | W3C validator |