erngdvlem1 - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > erngdvlem1		Structured version Visualization version GIF version

Theorem erngdvlem1 41422

Description: Lemma for eringring 41426. (Contributed by NM, 4-Aug-2013.)

**Hypotheses**
Ref	Expression
ernggrp.h	⊢ 𝐻 = (LHyp‘𝐾)
ernggrp.d	⊢ 𝐷 = ((EDRing‘𝐾)‘𝑊)
erngdv.b	⊢ 𝐵 = (Base‘𝐾)
erngdv.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
erngdv.e	⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
erngdv.p	⊢ 𝑃 = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ((𝑎‘𝑓) ∘ (𝑏‘𝑓))))
erngdv.o	⊢ 0 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵))
erngdv.i	⊢ 𝐼 = (𝑎 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ^◡(𝑎‘𝑓)))

**Assertion**
Ref	Expression
erngdvlem1	⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐷 ∈ Grp)

Distinct variable groups: 𝐵,𝑓 𝑎,𝑏,𝐸 𝑓,𝑎,𝐾,𝑏 𝑓,𝐻 𝑇,𝑎,𝑏,𝑓 𝑊,𝑎,𝑏,𝑓 Allowed substitution hints: 𝐵(𝑎,𝑏) 𝐷(𝑓,𝑎,𝑏) 𝑃(𝑓,𝑎,𝑏) 𝐸(𝑓) 𝐻(𝑎,𝑏) 𝐼(𝑓,𝑎,𝑏) 0 (𝑓,𝑎,𝑏)

Proof of Theorem erngdvlem1 Dummy variables 𝑡 𝑠 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ernggrp.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
2		erngdv.t	. . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
3		erngdv.e	. . . 4 ⊢ 𝐸 = ((TEndo‘𝐾)‘𝑊)
4		ernggrp.d	. . . 4 ⊢ 𝐷 = ((EDRing‘𝐾)‘𝑊)
5		eqid 2735	. . . 4 ⊢ (Base‘𝐷) = (Base‘𝐷)
6	1, 2, 3, 4, 5	erngbase 41235	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (Base‘𝐷) = 𝐸)
7	6	eqcomd 2741	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐸 = (Base‘𝐷))
8		erngdv.p	. . 3 ⊢ 𝑃 = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ((𝑎‘𝑓) ∘ (𝑏‘𝑓))))
9		eqid 2735	. . . 4 ⊢ (+_g‘𝐷) = (+_g‘𝐷)
10	1, 2, 3, 4, 9	erngfplus 41236	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → (+_g‘𝐷) = (𝑎 ∈ 𝐸, 𝑏 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ((𝑎‘𝑓) ∘ (𝑏‘𝑓)))))
11	8, 10	eqtr4id 2789	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝑃 = (+_g‘𝐷))
12	1, 2, 3, 8	tendoplcl 41215	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑠 ∈ 𝐸 ∧ 𝑡 ∈ 𝐸) → (𝑠𝑃𝑡) ∈ 𝐸)
13	1, 2, 3, 8	tendoplass 41217	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑠 ∈ 𝐸 ∧ 𝑡 ∈ 𝐸 ∧ 𝑢 ∈ 𝐸)) → ((𝑠𝑃𝑡)𝑃𝑢) = (𝑠𝑃(𝑡𝑃𝑢)))
14		erngdv.b	. . 3 ⊢ 𝐵 = (Base‘𝐾)
15		erngdv.o	. . 3 ⊢ 0 = (𝑓 ∈ 𝑇 ↦ ( I ↾ 𝐵))
16	14, 1, 2, 3, 15	tendo0cl 41224	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 0 ∈ 𝐸)
17	14, 1, 2, 3, 15, 8	tendo0pl 41225	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑠 ∈ 𝐸) → ( 0 𝑃𝑠) = 𝑠)
18		erngdv.i	. . 3 ⊢ 𝐼 = (𝑎 ∈ 𝐸 ↦ (𝑓 ∈ 𝑇 ↦ ^◡(𝑎‘𝑓)))
19	1, 2, 3, 18	tendoicl 41230	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑠 ∈ 𝐸) → (𝐼‘𝑠) ∈ 𝐸)
20	1, 2, 3, 18, 14, 8, 15	tendoipl 41231	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝑠 ∈ 𝐸) → ((𝐼‘𝑠)𝑃𝑠) = 0 )
21	7, 11, 12, 13, 16, 17, 19, 20	isgrpd 18923	1 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝐷 ∈ Grp)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ↦ cmpt 5155 I cid 5514 ^◡ccnv 5619 ↾ cres 5622 ∘ ccom 5624 ‘cfv 6487 ∈ cmpo 7358 Basecbs 17168 +_gcplusg 17209 Grpcgrp 18898 HLchlt 39784 LHypclh 40418 LTrncltrn 40535 TEndoctendo 41186 EDRingcedring 41187

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2184 ax-ext 2707 ax-rep 5201 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7678 ax-cnex 11083 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103 ax-pre-mulgt0 11104 ax-riotaBAD 39387

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2538 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2810 df-nfc 2884 df-ne 2931 df-nel 3035 df-ral 3050 df-rex 3060 df-rmo 3340 df-reu 3341 df-rab 3388 df-v 3429 df-sbc 3726 df-csb 3834 df-dif 3888 df-un 3890 df-in 3892 df-ss 3902 df-pss 3905 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4841 df-iun 4925 df-iin 4926 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6254 df-ord 6315 df-on 6316 df-lim 6317 df-suc 6318 df-iota 6443 df-fun 6489 df-fn 6490 df-f 6491 df-f1 6492 df-fo 6493 df-f1o 6494 df-fv 6495 df-riota 7313 df-ov 7359 df-oprab 7360 df-mpo 7361 df-om 7807 df-1st 7931 df-2nd 7932 df-undef 8212 df-frecs 8220 df-wrecs 8251 df-recs 8300 df-rdg 8338 df-1o 8394 df-er 8632 df-map 8764 df-en 8883 df-dom 8884 df-sdom 8885 df-fin 8886 df-pnf 11170 df-mnf 11171 df-xr 11172 df-ltxr 11173 df-le 11174 df-sub 11368 df-neg 11369 df-nn 12164 df-2 12233 df-3 12234 df-n0 12427 df-z 12514 df-uz 12778 df-fz 13451 df-struct 17106 df-slot 17141 df-ndx 17153 df-base 17169 df-plusg 17222 df-mulr 17223 df-0g 17393 df-proset 18249 df-poset 18268 df-plt 18283 df-lub 18299 df-glb 18300 df-join 18301 df-meet 18302 df-p0 18378 df-p1 18379 df-lat 18387 df-clat 18454 df-mgm 18597 df-sgrp 18676 df-mnd 18692 df-grp 18901 df-oposet 39610 df-ol 39612 df-oml 39613 df-covers 39700 df-ats 39701 df-atl 39732 df-cvlat 39756 df-hlat 39785 df-llines 39932 df-lplanes 39933 df-lvols 39934 df-lines 39935 df-psubsp 39937 df-pmap 39938 df-padd 40230 df-lhyp 40422 df-laut 40423 df-ldil 40538 df-ltrn 40539 df-trl 40593 df-tendo 41189 df-edring 41191

This theorem is referenced by: erngdvlem2N 41423 erngdvlem3 41424 erngdvlem4 41425

W3C validator