| 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 2760 | . . . . 5 ⊢ (+g‘𝑅) = (+g‘𝑅) | |
| 3 | eqid 2760 | . . . . 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 19214 | . . . 4 ⊢ (𝜑 → ((𝑀‘𝐴)(+g‘𝑅)𝐴) = (0g‘𝑅)) |
| 8 | xpsinv.y | . . . . 5 ⊢ 𝑌 = (Base‘𝑆) | |
| 9 | eqid 2760 | . . . . 5 ⊢ (+g‘𝑆) = (+g‘𝑆) | |
| 10 | eqid 2760 | . . . . 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 19214 | . . . 4 ⊢ (𝜑 → ((𝑁‘𝐵)(+g‘𝑆)𝐵) = (0g‘𝑆)) |
| 15 | 7, 14 | opeq12d 4847 | . . 3 ⊢ (𝜑 → 〈((𝑀‘𝐴)(+g‘𝑅)𝐴), ((𝑁‘𝐵)(+g‘𝑆)𝐵)〉 = 〈(0g‘𝑅), (0g‘𝑆)〉) |
| 16 | xpsinv.t | . . . 4 ⊢ 𝑇 = (𝑅 ×s 𝑆) | |
| 17 | 1, 4, 5, 6 | grpinvcld 19208 | . . . 4 ⊢ (𝜑 → (𝑀‘𝐴) ∈ 𝑋) |
| 18 | 8, 11, 12, 13 | grpinvcld 19208 | . . . 4 ⊢ (𝜑 → (𝑁‘𝐵) ∈ 𝑌) |
| 19 | 1, 2, 5, 17, 6 | grpcld 19167 | . . . 4 ⊢ (𝜑 → ((𝑀‘𝐴)(+g‘𝑅)𝐴) ∈ 𝑋) |
| 20 | 8, 9, 12, 18, 13 | grpcld 19167 | . . . 4 ⊢ (𝜑 → ((𝑁‘𝐵)(+g‘𝑆)𝐵) ∈ 𝑌) |
| 21 | eqid 2760 | . . . 4 ⊢ (+g‘𝑇) = (+g‘𝑇) | |
| 22 | 16, 1, 8, 5, 12, 17, 18, 6, 13, 19, 20, 2, 9, 21 | xpsadd 17755 | . . 3 ⊢ (𝜑 → (〈(𝑀‘𝐴), (𝑁‘𝐵)〉(+g‘𝑇)〈𝐴, 𝐵〉) = 〈((𝑀‘𝐴)(+g‘𝑅)𝐴), ((𝑁‘𝐵)(+g‘𝑆)𝐵)〉) |
| 23 | 5 | grpmndd 19166 | . . . 4 ⊢ (𝜑 → 𝑅 ∈ Mnd) |
| 24 | 12 | grpmndd 19166 | . . . 4 ⊢ (𝜑 → 𝑆 ∈ Mnd) |
| 25 | 16 | xpsmnd0 18981 | . . . 4 ⊢ ((𝑅 ∈ Mnd ∧ 𝑆 ∈ Mnd) → (0g‘𝑇) = 〈(0g‘𝑅), (0g‘𝑆)〉) |
| 26 | 23, 24, 25 | syl2anc 596 | . . 3 ⊢ (𝜑 → (0g‘𝑇) = 〈(0g‘𝑅), (0g‘𝑆)〉) |
| 27 | 15, 22, 26 | 3eqtr4d 2805 | . 2 ⊢ (𝜑 → (〈(𝑀‘𝐴), (𝑁‘𝐵)〉(+g‘𝑇)〈𝐴, 𝐵〉) = (0g‘𝑇)) |
| 28 | 16 | xpsgrp 19278 | . . . 4 ⊢ ((𝑅 ∈ Grp ∧ 𝑆 ∈ Grp) → 𝑇 ∈ Grp) |
| 29 | 5, 12, 28 | syl2anc 596 | . . 3 ⊢ (𝜑 → 𝑇 ∈ Grp) |
| 30 | 6, 13 | opelxpd 5690 | . . . 4 ⊢ (𝜑 → 〈𝐴, 𝐵〉 ∈ (𝑋 × 𝑌)) |
| 31 | 16, 1, 8, 5, 12 | xpsbas 17753 | . . . 4 ⊢ (𝜑 → (𝑋 × 𝑌) = (Base‘𝑇)) |
| 32 | 30, 31 | eleqtrd 2862 | . . 3 ⊢ (𝜑 → 〈𝐴, 𝐵〉 ∈ (Base‘𝑇)) |
| 33 | 17, 18 | opelxpd 5690 | . . . 4 ⊢ (𝜑 → 〈(𝑀‘𝐴), (𝑁‘𝐵)〉 ∈ (𝑋 × 𝑌)) |
| 34 | 33, 31 | eleqtrd 2862 | . . 3 ⊢ (𝜑 → 〈(𝑀‘𝐴), (𝑁‘𝐵)〉 ∈ (Base‘𝑇)) |
| 35 | eqid 2760 | . . . 4 ⊢ (Base‘𝑇) = (Base‘𝑇) | |
| 36 | eqid 2760 | . . . 4 ⊢ (0g‘𝑇) = (0g‘𝑇) | |
| 37 | xpsinv.i | . . . 4 ⊢ 𝐼 = (invg‘𝑇) | |
| 38 | 35, 21, 36, 37 | grpinvid2 19212 | . . 3 ⊢ ((𝑇 ∈ Grp ∧ 〈𝐴, 𝐵〉 ∈ (Base‘𝑇) ∧ 〈(𝑀‘𝐴), (𝑁‘𝐵)〉 ∈ (Base‘𝑇)) → ((𝐼‘〈𝐴, 𝐵〉) = 〈(𝑀‘𝐴), (𝑁‘𝐵)〉 ↔ (〈(𝑀‘𝐴), (𝑁‘𝐵)〉(+g‘𝑇)〈𝐴, 𝐵〉) = (0g‘𝑇))) |
| 39 | 29, 32, 34, 38 | syl3anc 1398 | . 2 ⊢ (𝜑 → ((𝐼‘〈𝐴, 𝐵〉) = 〈(𝑀‘𝐴), (𝑁‘𝐵)〉 ↔ (〈(𝑀‘𝐴), (𝑁‘𝐵)〉(+g‘𝑇)〈𝐴, 𝐵〉) = (0g‘𝑇))) |
| 40 | 27, 39 | mpbird 260 | 1 ⊢ (𝜑 → (𝐼‘〈𝐴, 𝐵〉) = 〈(𝑀‘𝐴), (𝑁‘𝐵)〉) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 = wceq 1569 ∈ wcel 2144 〈cop 4834 × cxp 5649 ‘cfv 6543 (class class class)co 7424 Basecbs 17396 +gcplusg 17437 0gc0g 17619 ×s cxps 17687 Mndcmnd 18932 Grpcgrp 19153 invgcminusg 19154 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-1st 8005 df-2nd 8006 df-frecs 8307 df-wrecs 8338 df-recs 8387 df-rdg 8426 df-1o 8484 df-2o 8485 df-er 8725 df-map 8857 df-ixp 8934 df-en 8982 df-dom 8983 df-sdom 8984 df-fin 8985 df-sup 9441 df-inf 9442 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-nn 12343 df-2 12412 df-3 12413 df-4 12414 df-5 12415 df-6 12416 df-7 12417 df-8 12418 df-9 12419 df-n0 12614 df-z 12701 df-dec 12822 df-uz 12973 df-fz 13647 df-struct 17334 df-slot 17369 df-ndx 17381 df-base 17397 df-plusg 17450 df-mulr 17451 df-sca 17453 df-vsca 17454 df-ip 17455 df-tset 17456 df-ple 17457 df-ds 17459 df-hom 17461 df-cco 17462 df-0g 17621 df-prds 17627 df-imas 17689 df-xps 17691 df-mgm 18825 df-sgrp 18917 df-mnd 18933 df-grp 19156 df-minusg 19157 |
| This theorem is used by: pzriprnglem4 21799 |
| Copyright terms: Public domain | W3C validator |