Metamath Proof Explorer


Theorem zlmodzxzsub

Description: The subtraction of the ZZ-module ZZ X. ZZ . (Contributed by AV, 22-May-2019) (Revised by AV, 10-Jun-2019)

Ref Expression
Hypotheses zlmodzxz.z ⊢ Z = ℤ ring freeLMod 0 1
zlmodzxzsub.m ⊢ - ˙ = - Z
Assertion zlmodzxzsub ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℤ ∧ D ∈ ℤ → 0 A 1 C - ˙ 0 B 1 D = 0 A − B 1 C − D

Proof

Step Hyp Ref Expression
1 zlmodzxz.z ⊢ Z = ℤ ring freeLMod 0 1
2 zlmodzxzsub.m ⊢ - ˙ = - Z
3 zsubcl ⊢ A ∈ ℤ ∧ B ∈ ℤ → A − B ∈ ℤ
4 simpr ⊢ A ∈ ℤ ∧ B ∈ ℤ → B ∈ ℤ
5 3 4 jca ⊢ A ∈ ℤ ∧ B ∈ ℤ → A − B ∈ ℤ ∧ B ∈ ℤ
6 zsubcl ⊢ C ∈ ℤ ∧ D ∈ ℤ → C − D ∈ ℤ
7 simpr ⊢ C ∈ ℤ ∧ D ∈ ℤ → D ∈ ℤ
8 6 7 jca ⊢ C ∈ ℤ ∧ D ∈ ℤ → C − D ∈ ℤ ∧ D ∈ ℤ
9 eqid ⊢ + Z = + Z
10 1 9 zlmodzxzadd ⊢ A − B ∈ ℤ ∧ B ∈ ℤ ∧ C − D ∈ ℤ ∧ D ∈ ℤ → 0 A − B 1 C − D + Z 0 B 1 D = 0 A - B + B 1 C - D + D
11 5 8 10 syl2an ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℤ ∧ D ∈ ℤ → 0 A − B 1 C − D + Z 0 B 1 D = 0 A - B + B 1 C - D + D
12 zcn ⊢ A ∈ ℤ → A ∈ ℂ
13 zcn ⊢ B ∈ ℤ → B ∈ ℂ
14 npcan ⊢ A ∈ ℂ ∧ B ∈ ℂ → A - B + B = A
15 12 13 14 syl2an ⊢ A ∈ ℤ ∧ B ∈ ℤ → A - B + B = A
16 15 adantr ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℤ ∧ D ∈ ℤ → A - B + B = A
17 16 opeq2d ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℤ ∧ D ∈ ℤ → 0 A - B + B = 0 A
18 zcn ⊢ C ∈ ℤ → C ∈ ℂ
19 zcn ⊢ D ∈ ℤ → D ∈ ℂ
20 npcan ⊢ C ∈ ℂ ∧ D ∈ ℂ → C - D + D = C
21 18 19 20 syl2an ⊢ C ∈ ℤ ∧ D ∈ ℤ → C - D + D = C
22 21 adantl ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℤ ∧ D ∈ ℤ → C - D + D = C
23 22 opeq2d ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℤ ∧ D ∈ ℤ → 1 C - D + D = 1 C
24 17 23 preq12d ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℤ ∧ D ∈ ℤ → 0 A - B + B 1 C - D + D = 0 A 1 C
25 11 24 eqtrd ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℤ ∧ D ∈ ℤ → 0 A − B 1 C − D + Z 0 B 1 D = 0 A 1 C
26 1 zlmodzxzlmod ⊢ Z ∈ LMod ∧ ℤ ring = Scalar ⁡ Z
27 lmodgrp ⊢ Z ∈ LMod → Z ∈ Grp
28 27 adantr ⊢ Z ∈ LMod ∧ ℤ ring = Scalar ⁡ Z → Z ∈ Grp
29 26 28 mp1i ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℤ ∧ D ∈ ℤ → Z ∈ Grp
30 1 zlmodzxzel ⊢ A ∈ ℤ ∧ C ∈ ℤ → 0 A 1 C ∈ Base Z
31 30 ad2ant2r ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℤ ∧ D ∈ ℤ → 0 A 1 C ∈ Base Z
32 1 zlmodzxzel ⊢ B ∈ ℤ ∧ D ∈ ℤ → 0 B 1 D ∈ Base Z
33 4 7 32 syl2an ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℤ ∧ D ∈ ℤ → 0 B 1 D ∈ Base Z
34 1 zlmodzxzel ⊢ A − B ∈ ℤ ∧ C − D ∈ ℤ → 0 A − B 1 C − D ∈ Base Z
35 3 6 34 syl2an ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℤ ∧ D ∈ ℤ → 0 A − B 1 C − D ∈ Base Z
36 eqid ⊢ Base Z = Base Z
37 36 9 2 grpsubadd ⊢ Z ∈ Grp ∧ 0 A 1 C ∈ Base Z ∧ 0 B 1 D ∈ Base Z ∧ 0 A − B 1 C − D ∈ Base Z → 0 A 1 C - ˙ 0 B 1 D = 0 A − B 1 C − D ↔ 0 A − B 1 C − D + Z 0 B 1 D = 0 A 1 C
38 29 31 33 35 37 syl13anc ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℤ ∧ D ∈ ℤ → 0 A 1 C - ˙ 0 B 1 D = 0 A − B 1 C − D ↔ 0 A − B 1 C − D + Z 0 B 1 D = 0 A 1 C
39 25 38 mpbird ⊢ A ∈ ℤ ∧ B ∈ ℤ ∧ C ∈ ℤ ∧ D ∈ ℤ → 0 A 1 C - ˙ 0 B 1 D = 0 A − B 1 C − D