Metamath Proof Explorer


Theorem rng1zrlem

Description: Lemma for rng1zr and srg1zr . (Contributed by FL, 13-Feb-2010) (Revised by AV, 18-Jun-2026)

Ref Expression
Hypotheses rng1zr.b B = Base R
rng1zr.p + ˙ = + R
rng1zr.t ˙ = R
Assertion rng1zrlem R Mgm mulGrp R Mgm + ˙ Fn B × B ˙ Fn B × B Z B B = Z + ˙ = Z Z Z ˙ = Z Z Z

Proof

Step Hyp Ref Expression
1 rng1zr.b B = Base R
2 rng1zr.p + ˙ = + R
3 rng1zr.t ˙ = R
4 pm4.24 B = Z B = Z B = Z
5 simp1l R Mgm mulGrp R Mgm + ˙ Fn B × B ˙ Fn B × B Z B R Mgm
6 simp3 R Mgm mulGrp R Mgm + ˙ Fn B × B ˙ Fn B × B Z B Z B
7 simpl + ˙ Fn B × B ˙ Fn B × B + ˙ Fn B × B
8 7 3ad2ant2 R Mgm mulGrp R Mgm + ˙ Fn B × B ˙ Fn B × B Z B + ˙ Fn B × B
9 1 2 mgmb1mgm1 R Mgm Z B + ˙ Fn B × B B = Z + ˙ = Z Z Z
10 5 6 8 9 syl3anc R Mgm mulGrp R Mgm + ˙ Fn B × B ˙ Fn B × B Z B B = Z + ˙ = Z Z Z
11 simp1r R Mgm mulGrp R Mgm + ˙ Fn B × B ˙ Fn B × B Z B mulGrp R Mgm
12 eqid mulGrp R = mulGrp R
13 12 3 mgpplusg ˙ = + mulGrp R
14 13 fneq1i ˙ Fn B × B + mulGrp R Fn B × B
15 14 biimpi ˙ Fn B × B + mulGrp R Fn B × B
16 15 adantl + ˙ Fn B × B ˙ Fn B × B + mulGrp R Fn B × B
17 16 3ad2ant2 R Mgm mulGrp R Mgm + ˙ Fn B × B ˙ Fn B × B Z B + mulGrp R Fn B × B
18 12 1 mgpbas B = Base mulGrp R
19 eqid + mulGrp R = + mulGrp R
20 18 19 mgmb1mgm1 mulGrp R Mgm Z B + mulGrp R Fn B × B B = Z + mulGrp R = Z Z Z
21 11 6 17 20 syl3anc R Mgm mulGrp R Mgm + ˙ Fn B × B ˙ Fn B × B Z B B = Z + mulGrp R = Z Z Z
22 13 eqcomi + mulGrp R = ˙
23 22 a1i R Mgm mulGrp R Mgm + ˙ Fn B × B ˙ Fn B × B Z B + mulGrp R = ˙
24 23 eqeq1d R Mgm mulGrp R Mgm + ˙ Fn B × B ˙ Fn B × B Z B + mulGrp R = Z Z Z ˙ = Z Z Z
25 21 24 bitrd R Mgm mulGrp R Mgm + ˙ Fn B × B ˙ Fn B × B Z B B = Z ˙ = Z Z Z
26 10 25 anbi12d R Mgm mulGrp R Mgm + ˙ Fn B × B ˙ Fn B × B Z B B = Z B = Z + ˙ = Z Z Z ˙ = Z Z Z
27 4 26 bitrid R Mgm mulGrp R Mgm + ˙ Fn B × B ˙ Fn B × B Z B B = Z + ˙ = Z Z Z ˙ = Z Z Z