Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > prdsinvgd | Structured version Visualization version GIF version |
Description: Negation in a product of groups. (Contributed by Stefan O'Rear, 10-Jan-2015.) |
Ref | Expression |
---|---|
prdsgrpd.y | ⊢ 𝑌 = (𝑆Xs𝑅) |
prdsgrpd.i | ⊢ (𝜑 → 𝐼 ∈ 𝑊) |
prdsgrpd.s | ⊢ (𝜑 → 𝑆 ∈ 𝑉) |
prdsgrpd.r | ⊢ (𝜑 → 𝑅:𝐼⟶Grp) |
prdsinvgd.b | ⊢ 𝐵 = (Base‘𝑌) |
prdsinvgd.n | ⊢ 𝑁 = (invg‘𝑌) |
prdsinvgd.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
Ref | Expression |
---|---|
prdsinvgd | ⊢ (𝜑 → (𝑁‘𝑋) = (𝑥 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑥))‘(𝑋‘𝑥)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | prdsgrpd.y | . . . . 5 ⊢ 𝑌 = (𝑆Xs𝑅) | |
2 | prdsinvgd.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑌) | |
3 | eqid 2823 | . . . . 5 ⊢ (+g‘𝑌) = (+g‘𝑌) | |
4 | prdsgrpd.s | . . . . . 6 ⊢ (𝜑 → 𝑆 ∈ 𝑉) | |
5 | 4 | elexd 3516 | . . . . 5 ⊢ (𝜑 → 𝑆 ∈ V) |
6 | prdsgrpd.i | . . . . . 6 ⊢ (𝜑 → 𝐼 ∈ 𝑊) | |
7 | 6 | elexd 3516 | . . . . 5 ⊢ (𝜑 → 𝐼 ∈ V) |
8 | prdsgrpd.r | . . . . 5 ⊢ (𝜑 → 𝑅:𝐼⟶Grp) | |
9 | prdsinvgd.x | . . . . 5 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
10 | eqid 2823 | . . . . 5 ⊢ (0g ∘ 𝑅) = (0g ∘ 𝑅) | |
11 | eqid 2823 | . . . . 5 ⊢ (𝑥 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑥))‘(𝑋‘𝑥))) = (𝑥 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑥))‘(𝑋‘𝑥))) | |
12 | 1, 2, 3, 5, 7, 8, 9, 10, 11 | prdsinvlem 18210 | . . . 4 ⊢ (𝜑 → ((𝑥 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑥))‘(𝑋‘𝑥))) ∈ 𝐵 ∧ ((𝑥 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑥))‘(𝑋‘𝑥)))(+g‘𝑌)𝑋) = (0g ∘ 𝑅))) |
13 | 12 | simprd 498 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑥))‘(𝑋‘𝑥)))(+g‘𝑌)𝑋) = (0g ∘ 𝑅)) |
14 | grpmnd 18112 | . . . . . 6 ⊢ (𝑎 ∈ Grp → 𝑎 ∈ Mnd) | |
15 | 14 | ssriv 3973 | . . . . 5 ⊢ Grp ⊆ Mnd |
16 | fss 6529 | . . . . 5 ⊢ ((𝑅:𝐼⟶Grp ∧ Grp ⊆ Mnd) → 𝑅:𝐼⟶Mnd) | |
17 | 8, 15, 16 | sylancl 588 | . . . 4 ⊢ (𝜑 → 𝑅:𝐼⟶Mnd) |
18 | 1, 6, 4, 17 | prds0g 17947 | . . 3 ⊢ (𝜑 → (0g ∘ 𝑅) = (0g‘𝑌)) |
19 | 13, 18 | eqtrd 2858 | . 2 ⊢ (𝜑 → ((𝑥 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑥))‘(𝑋‘𝑥)))(+g‘𝑌)𝑋) = (0g‘𝑌)) |
20 | 1, 6, 4, 8 | prdsgrpd 18211 | . . 3 ⊢ (𝜑 → 𝑌 ∈ Grp) |
21 | 12 | simpld 497 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑥))‘(𝑋‘𝑥))) ∈ 𝐵) |
22 | eqid 2823 | . . . 4 ⊢ (0g‘𝑌) = (0g‘𝑌) | |
23 | prdsinvgd.n | . . . 4 ⊢ 𝑁 = (invg‘𝑌) | |
24 | 2, 3, 22, 23 | grpinvid2 18157 | . . 3 ⊢ ((𝑌 ∈ Grp ∧ 𝑋 ∈ 𝐵 ∧ (𝑥 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑥))‘(𝑋‘𝑥))) ∈ 𝐵) → ((𝑁‘𝑋) = (𝑥 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑥))‘(𝑋‘𝑥))) ↔ ((𝑥 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑥))‘(𝑋‘𝑥)))(+g‘𝑌)𝑋) = (0g‘𝑌))) |
25 | 20, 9, 21, 24 | syl3anc 1367 | . 2 ⊢ (𝜑 → ((𝑁‘𝑋) = (𝑥 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑥))‘(𝑋‘𝑥))) ↔ ((𝑥 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑥))‘(𝑋‘𝑥)))(+g‘𝑌)𝑋) = (0g‘𝑌))) |
26 | 19, 25 | mpbird 259 | 1 ⊢ (𝜑 → (𝑁‘𝑋) = (𝑥 ∈ 𝐼 ↦ ((invg‘(𝑅‘𝑥))‘(𝑋‘𝑥)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 = wceq 1537 ∈ wcel 2114 Vcvv 3496 ⊆ wss 3938 ↦ cmpt 5148 ∘ ccom 5561 ⟶wf 6353 ‘cfv 6357 (class class class)co 7158 Basecbs 16485 +gcplusg 16567 0gc0g 16715 Xscprds 16721 Mndcmnd 17913 Grpcgrp 18105 invgcminusg 18106 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-rep 5192 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 ax-cnex 10595 ax-resscn 10596 ax-1cn 10597 ax-icn 10598 ax-addcl 10599 ax-addrcl 10600 ax-mulcl 10601 ax-mulrcl 10602 ax-mulcom 10603 ax-addass 10604 ax-mulass 10605 ax-distr 10606 ax-i2m1 10607 ax-1ne0 10608 ax-1rid 10609 ax-rnegex 10610 ax-rrecex 10611 ax-cnre 10612 ax-pre-lttri 10613 ax-pre-lttrn 10614 ax-pre-ltadd 10615 ax-pre-mulgt0 10616 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-nel 3126 df-ral 3145 df-rex 3146 df-reu 3147 df-rmo 3148 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-riota 7116 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-1st 7691 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-1o 8104 df-oadd 8108 df-er 8291 df-map 8410 df-ixp 8464 df-en 8512 df-dom 8513 df-sdom 8514 df-fin 8515 df-sup 8908 df-pnf 10679 df-mnf 10680 df-xr 10681 df-ltxr 10682 df-le 10683 df-sub 10874 df-neg 10875 df-nn 11641 df-2 11703 df-3 11704 df-4 11705 df-5 11706 df-6 11707 df-7 11708 df-8 11709 df-9 11710 df-n0 11901 df-z 11985 df-dec 12102 df-uz 12247 df-fz 12896 df-struct 16487 df-ndx 16488 df-slot 16489 df-base 16491 df-plusg 16580 df-mulr 16581 df-sca 16583 df-vsca 16584 df-ip 16585 df-tset 16586 df-ple 16587 df-ds 16589 df-hom 16591 df-cco 16592 df-0g 16717 df-prds 16723 df-mgm 17854 df-sgrp 17903 df-mnd 17914 df-grp 18108 df-minusg 18109 |
This theorem is referenced by: pwsinvg 18214 prdsinvgd2 20888 prdstgpd 22735 |
Copyright terms: Public domain | W3C validator |