zlmodzxzsub - Mathbox for Alexander van der Vekens

	Mathbox for Alexander van der Vekens		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > zlmodzxzsub		Structured version Visualization version GIF version

Theorem zlmodzxzsub 41426

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

**Hypotheses**
Ref	Expression
zlmodzxz.z	⊢ 𝑍 = (ℤ_ring freeLMod {0, 1})
zlmodzxzsub.m	⊢ − = (-_g‘𝑍)

**Assertion**
Ref	Expression
zlmodzxzsub	⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ)) → ({⟨0, 𝐴⟩, ⟨1, 𝐶⟩} − {⟨0, 𝐵⟩, ⟨1, 𝐷⟩}) = {⟨0, (𝐴 − 𝐵)⟩, ⟨1, (𝐶 − 𝐷)⟩})

**Proof of Theorem zlmodzxzsub**
Step	Hyp	Ref	Expression
1		zsubcl 11363	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → (𝐴 − 𝐵) ∈ ℤ)
2		simpr 477	. . . . 5 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → 𝐵 ∈ ℤ)
3	1, 2	jca 554	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴 − 𝐵) ∈ ℤ ∧ 𝐵 ∈ ℤ))
4		zsubcl 11363	. . . . 5 ⊢ ((𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) → (𝐶 − 𝐷) ∈ ℤ)
5		simpr 477	. . . . 5 ⊢ ((𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) → 𝐷 ∈ ℤ)
6	4, 5	jca 554	. . . 4 ⊢ ((𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) → ((𝐶 − 𝐷) ∈ ℤ ∧ 𝐷 ∈ ℤ))
7		zlmodzxz.z	. . . . 5 ⊢ 𝑍 = (ℤ_ring freeLMod {0, 1})
8		eqid 2621	. . . . 5 ⊢ (+_g‘𝑍) = (+_g‘𝑍)
9	7, 8	zlmodzxzadd 41424	. . . 4 ⊢ ((((𝐴 − 𝐵) ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ ((𝐶 − 𝐷) ∈ ℤ ∧ 𝐷 ∈ ℤ)) → ({⟨0, (𝐴 − 𝐵)⟩, ⟨1, (𝐶 − 𝐷)⟩} (+_g‘𝑍){⟨0, 𝐵⟩, ⟨1, 𝐷⟩}) = {⟨0, ((𝐴 − 𝐵) + 𝐵)⟩, ⟨1, ((𝐶 − 𝐷) + 𝐷)⟩})
10	3, 6, 9	syl2an 494	. . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ)) → ({⟨0, (𝐴 − 𝐵)⟩, ⟨1, (𝐶 − 𝐷)⟩} (+_g‘𝑍){⟨0, 𝐵⟩, ⟨1, 𝐷⟩}) = {⟨0, ((𝐴 − 𝐵) + 𝐵)⟩, ⟨1, ((𝐶 − 𝐷) + 𝐷)⟩})
11		zcn 11326	. . . . . . 7 ⊢ (𝐴 ∈ ℤ → 𝐴 ∈ ℂ)
12		zcn 11326	. . . . . . 7 ⊢ (𝐵 ∈ ℤ → 𝐵 ∈ ℂ)
13		npcan 10234	. . . . . . 7 ⊢ ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((𝐴 − 𝐵) + 𝐵) = 𝐴)
14	11, 12, 13	syl2an 494	. . . . . 6 ⊢ ((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) → ((𝐴 − 𝐵) + 𝐵) = 𝐴)
15	14	adantr 481	. . . . 5 ⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ)) → ((𝐴 − 𝐵) + 𝐵) = 𝐴)
16	15	opeq2d 4377	. . . 4 ⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ)) → ⟨0, ((𝐴 − 𝐵) + 𝐵)⟩ = ⟨0, 𝐴⟩)
17		zcn 11326	. . . . . . 7 ⊢ (𝐶 ∈ ℤ → 𝐶 ∈ ℂ)
18		zcn 11326	. . . . . . 7 ⊢ (𝐷 ∈ ℤ → 𝐷 ∈ ℂ)
19		npcan 10234	. . . . . . 7 ⊢ ((𝐶 ∈ ℂ ∧ 𝐷 ∈ ℂ) → ((𝐶 − 𝐷) + 𝐷) = 𝐶)
20	17, 18, 19	syl2an 494	. . . . . 6 ⊢ ((𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ) → ((𝐶 − 𝐷) + 𝐷) = 𝐶)
21	20	adantl 482	. . . . 5 ⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ)) → ((𝐶 − 𝐷) + 𝐷) = 𝐶)
22	21	opeq2d 4377	. . . 4 ⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ)) → ⟨1, ((𝐶 − 𝐷) + 𝐷)⟩ = ⟨1, 𝐶⟩)
23	16, 22	preq12d 4246	. . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ)) → {⟨0, ((𝐴 − 𝐵) + 𝐵)⟩, ⟨1, ((𝐶 − 𝐷) + 𝐷)⟩} = {⟨0, 𝐴⟩, ⟨1, 𝐶⟩})
24	10, 23	eqtrd 2655	. 2 ⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ)) → ({⟨0, (𝐴 − 𝐵)⟩, ⟨1, (𝐶 − 𝐷)⟩} (+_g‘𝑍){⟨0, 𝐵⟩, ⟨1, 𝐷⟩}) = {⟨0, 𝐴⟩, ⟨1, 𝐶⟩})
25	7	zlmodzxzlmod 41420	. . . 4 ⊢ (𝑍 ∈ LMod ∧ ℤ_ring = (Scalar‘𝑍))
26		lmodgrp 18791	. . . . 5 ⊢ (𝑍 ∈ LMod → 𝑍 ∈ Grp)
27	26	adantr 481	. . . 4 ⊢ ((𝑍 ∈ LMod ∧ ℤ_ring = (Scalar‘𝑍)) → 𝑍 ∈ Grp)
28	25, 27	mp1i 13	. . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ)) → 𝑍 ∈ Grp)
29	7	zlmodzxzel 41421	. . . 4 ⊢ ((𝐴 ∈ ℤ ∧ 𝐶 ∈ ℤ) → {⟨0, 𝐴⟩, ⟨1, 𝐶⟩} ∈ (Base‘𝑍))
30	29	ad2ant2r 782	. . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ)) → {⟨0, 𝐴⟩, ⟨1, 𝐶⟩} ∈ (Base‘𝑍))
31	7	zlmodzxzel 41421	. . . 4 ⊢ ((𝐵 ∈ ℤ ∧ 𝐷 ∈ ℤ) → {⟨0, 𝐵⟩, ⟨1, 𝐷⟩} ∈ (Base‘𝑍))
32	2, 5, 31	syl2an 494	. . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ)) → {⟨0, 𝐵⟩, ⟨1, 𝐷⟩} ∈ (Base‘𝑍))
33	7	zlmodzxzel 41421	. . . 4 ⊢ (((𝐴 − 𝐵) ∈ ℤ ∧ (𝐶 − 𝐷) ∈ ℤ) → {⟨0, (𝐴 − 𝐵)⟩, ⟨1, (𝐶 − 𝐷)⟩} ∈ (Base‘𝑍))
34	1, 4, 33	syl2an 494	. . 3 ⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ)) → {⟨0, (𝐴 − 𝐵)⟩, ⟨1, (𝐶 − 𝐷)⟩} ∈ (Base‘𝑍))
35		eqid 2621	. . . 4 ⊢ (Base‘𝑍) = (Base‘𝑍)
36		zlmodzxzsub.m	. . . 4 ⊢ − = (-_g‘𝑍)
37	35, 8, 36	grpsubadd 17424	. . 3 ⊢ ((𝑍 ∈ Grp ∧ ({⟨0, 𝐴⟩, ⟨1, 𝐶⟩} ∈ (Base‘𝑍) ∧ {⟨0, 𝐵⟩, ⟨1, 𝐷⟩} ∈ (Base‘𝑍) ∧ {⟨0, (𝐴 − 𝐵)⟩, ⟨1, (𝐶 − 𝐷)⟩} ∈ (Base‘𝑍))) → (({⟨0, 𝐴⟩, ⟨1, 𝐶⟩} − {⟨0, 𝐵⟩, ⟨1, 𝐷⟩}) = {⟨0, (𝐴 − 𝐵)⟩, ⟨1, (𝐶 − 𝐷)⟩} ↔ ({⟨0, (𝐴 − 𝐵)⟩, ⟨1, (𝐶 − 𝐷)⟩} (+_g‘𝑍){⟨0, 𝐵⟩, ⟨1, 𝐷⟩}) = {⟨0, 𝐴⟩, ⟨1, 𝐶⟩}))
38	28, 30, 32, 34, 37	syl13anc 1325	. 2 ⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ)) → (({⟨0, 𝐴⟩, ⟨1, 𝐶⟩} − {⟨0, 𝐵⟩, ⟨1, 𝐷⟩}) = {⟨0, (𝐴 − 𝐵)⟩, ⟨1, (𝐶 − 𝐷)⟩} ↔ ({⟨0, (𝐴 − 𝐵)⟩, ⟨1, (𝐶 − 𝐷)⟩} (+_g‘𝑍){⟨0, 𝐵⟩, ⟨1, 𝐷⟩}) = {⟨0, 𝐴⟩, ⟨1, 𝐶⟩}))
39	24, 38	mpbird 247	1 ⊢ (((𝐴 ∈ ℤ ∧ 𝐵 ∈ ℤ) ∧ (𝐶 ∈ ℤ ∧ 𝐷 ∈ ℤ)) → ({⟨0, 𝐴⟩, ⟨1, 𝐶⟩} − {⟨0, 𝐵⟩, ⟨1, 𝐷⟩}) = {⟨0, (𝐴 − 𝐵)⟩, ⟨1, (𝐶 − 𝐷)⟩})

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 196 ∧ wa 384 = wceq 1480 ∈ wcel 1987 {cpr 4150 ⟨cop 4154 ‘cfv 5847 (class class class)co 6604 ℂcc 9878 0cc0 9880 1c1 9881 + caddc 9883 − cmin 10210 ℤcz 11321 Basecbs 15781 +_gcplusg 15862 Scalarcsca 15865 Grpcgrp 17343 -_gcsg 17345 LModclmod 18784 ℤ_ringzring 19737 freeLMod cfrlm 20009

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1719 ax-4 1734 ax-5 1836 ax-6 1885 ax-7 1932 ax-8 1989 ax-9 1996 ax-10 2016 ax-11 2031 ax-12 2044 ax-13 2245 ax-ext 2601 ax-rep 4731 ax-sep 4741 ax-nul 4749 ax-pow 4803 ax-pr 4867 ax-un 6902 ax-cnex 9936 ax-resscn 9937 ax-1cn 9938 ax-icn 9939 ax-addcl 9940 ax-addrcl 9941 ax-mulcl 9942 ax-mulrcl 9943 ax-mulcom 9944 ax-addass 9945 ax-mulass 9946 ax-distr 9947 ax-i2m1 9948 ax-1ne0 9949 ax-1rid 9950 ax-rnegex 9951 ax-rrecex 9952 ax-cnre 9953 ax-pre-lttri 9954 ax-pre-lttrn 9955 ax-pre-ltadd 9956 ax-pre-mulgt0 9957 ax-addf 9959 ax-mulf 9960

This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1037 df-3an 1038 df-tru 1483 df-ex 1702 df-nf 1707 df-sb 1878 df-eu 2473 df-mo 2474 df-clab 2608 df-cleq 2614 df-clel 2617 df-nfc 2750 df-ne 2791 df-nel 2894 df-ral 2912 df-rex 2913 df-reu 2914 df-rmo 2915 df-rab 2916 df-v 3188 df-sbc 3418 df-csb 3515 df-dif 3558 df-un 3560 df-in 3562 df-ss 3569 df-pss 3571 df-nul 3892 df-if 4059 df-pw 4132 df-sn 4149 df-pr 4151 df-tp 4153 df-op 4155 df-uni 4403 df-int 4441 df-iun 4487 df-br 4614 df-opab 4674 df-mpt 4675 df-tr 4713 df-eprel 4985 df-id 4989 df-po 4995 df-so 4996 df-fr 5033 df-we 5035 df-xp 5080 df-rel 5081 df-cnv 5082 df-co 5083 df-dm 5084 df-rn 5085 df-res 5086 df-ima 5087 df-pred 5639 df-ord 5685 df-on 5686 df-lim 5687 df-suc 5688 df-iota 5810 df-fun 5849 df-fn 5850 df-f 5851 df-f1 5852 df-fo 5853 df-f1o 5854 df-fv 5855 df-riota 6565 df-ov 6607 df-oprab 6608 df-mpt2 6609 df-of 6850 df-om 7013 df-1st 7113 df-2nd 7114 df-supp 7241 df-wrecs 7352 df-recs 7413 df-rdg 7451 df-1o 7505 df-oadd 7509 df-er 7687 df-map 7804 df-ixp 7853 df-en 7900 df-dom 7901 df-sdom 7902 df-fin 7903 df-fsupp 8220 df-sup 8292 df-pnf 10020 df-mnf 10021 df-xr 10022 df-ltxr 10023 df-le 10024 df-sub 10212 df-neg 10213 df-nn 10965 df-2 11023 df-3 11024 df-4 11025 df-5 11026 df-6 11027 df-7 11028 df-8 11029 df-9 11030 df-n0 11237 df-z 11322 df-dec 11438 df-uz 11632 df-fz 12269 df-struct 15783 df-ndx 15784 df-slot 15785 df-base 15786 df-sets 15787 df-ress 15788 df-plusg 15875 df-mulr 15876 df-starv 15877 df-sca 15878 df-vsca 15879 df-ip 15880 df-tset 15881 df-ple 15882 df-ds 15885 df-unif 15886 df-hom 15887 df-cco 15888 df-0g 16023 df-prds 16029 df-pws 16031 df-mgm 17163 df-sgrp 17205 df-mnd 17216 df-grp 17346 df-minusg 17347 df-sbg 17348 df-subg 17512 df-cmn 18116 df-mgp 18411 df-ur 18423 df-ring 18470 df-cring 18471 df-subrg 18699 df-lmod 18786 df-lss 18852 df-sra 19091 df-rgmod 19092 df-cnfld 19666 df-zring 19738 df-dsmm 19995 df-frlm 20010

This theorem is referenced by: zlmodzxzequa 41573

W3C validator