Metamath Proof Explorer


Theorem scmatscmiddistr

Description: Distributive law for scalar and ring multiplication for scalar matrices expressed as multiplications of a scalar with the identity matrix. (Contributed by AV, 19-Dec-2019)

Ref Expression
Hypotheses scmatscmide.a ⊢ A = N Mat R
scmatscmide.b ⊢ B = Base R
scmatscmide.0 ⊢ 0 ˙ = 0 R
scmatscmide.1 ⊢ 1 ˙ = 1 A
scmatscmide.m ⊢ ∗ ˙ = ⋅ A
scmatscmiddistr.t ⊢ · ˙ = ⋅ R
scmatscmiddistr.m ⊢ × ˙ = ⋅ A
Assertion scmatscmiddistr ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → S ∗ ˙ 1 ˙ × ˙ T ∗ ˙ 1 ˙ = S · ˙ T ∗ ˙ 1 ˙

Proof

Step Hyp Ref Expression
1 scmatscmide.a ⊢ A = N Mat R
2 scmatscmide.b ⊢ B = Base R
3 scmatscmide.0 ⊢ 0 ˙ = 0 R
4 scmatscmide.1 ⊢ 1 ˙ = 1 A
5 scmatscmide.m ⊢ ∗ ˙ = ⋅ A
6 scmatscmiddistr.t ⊢ · ˙ = ⋅ R
7 scmatscmiddistr.m ⊢ × ˙ = ⋅ A
8 simprl ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → S ∈ B
9 eqid ⊢ Base A = Base A
10 eqid ⊢ N DMat R = N DMat R
11 1 9 3 10 dmatid ⊢ N ∈ Fin ∧ R ∈ Ring → 1 A ∈ N DMat R
12 4 11 eqeltrid ⊢ N ∈ Fin ∧ R ∈ Ring → 1 ˙ ∈ N DMat R
13 12 adantr ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → 1 ˙ ∈ N DMat R
14 8 13 jca ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → S ∈ B ∧ 1 ˙ ∈ N DMat R
15 2 1 9 5 10 dmatscmcl ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ 1 ˙ ∈ N DMat R → S ∗ ˙ 1 ˙ ∈ N DMat R
16 14 15 syldan ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → S ∗ ˙ 1 ˙ ∈ N DMat R
17 simprr ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → T ∈ B
18 17 13 jca ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → T ∈ B ∧ 1 ˙ ∈ N DMat R
19 2 1 9 5 10 dmatscmcl ⊢ N ∈ Fin ∧ R ∈ Ring ∧ T ∈ B ∧ 1 ˙ ∈ N DMat R → T ∗ ˙ 1 ˙ ∈ N DMat R
20 18 19 syldan ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → T ∗ ˙ 1 ˙ ∈ N DMat R
21 16 20 jca ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → S ∗ ˙ 1 ˙ ∈ N DMat R ∧ T ∗ ˙ 1 ˙ ∈ N DMat R
22 7 oveqi ⊢ S ∗ ˙ 1 ˙ × ˙ T ∗ ˙ 1 ˙ = S ∗ ˙ 1 ˙ ⋅ A T ∗ ˙ 1 ˙
23 1 9 3 10 dmatmul ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∗ ˙ 1 ˙ ∈ N DMat R ∧ T ∗ ˙ 1 ˙ ∈ N DMat R → S ∗ ˙ 1 ˙ ⋅ A T ∗ ˙ 1 ˙ = i ∈ N , j ∈ N ⟼ if i = j i S ∗ ˙ 1 ˙ j ⋅ R i T ∗ ˙ 1 ˙ j 0 ˙
24 22 23 eqtrid ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∗ ˙ 1 ˙ ∈ N DMat R ∧ T ∗ ˙ 1 ˙ ∈ N DMat R → S ∗ ˙ 1 ˙ × ˙ T ∗ ˙ 1 ˙ = i ∈ N , j ∈ N ⟼ if i = j i S ∗ ˙ 1 ˙ j ⋅ R i T ∗ ˙ 1 ˙ j 0 ˙
25 21 24 syldan ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → S ∗ ˙ 1 ˙ × ˙ T ∗ ˙ 1 ˙ = i ∈ N , j ∈ N ⟼ if i = j i S ∗ ˙ 1 ˙ j ⋅ R i T ∗ ˙ 1 ˙ j 0 ˙
26 simpll ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → N ∈ Fin
27 simplr ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → R ∈ Ring
28 26 27 8 3jca ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B
29 28 3ad2ant1 ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B ∧ i ∈ N ∧ j ∈ N → N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B
30 3simpc ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B ∧ i ∈ N ∧ j ∈ N → i ∈ N ∧ j ∈ N
31 1 2 3 4 5 scmatscmide ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ i ∈ N ∧ j ∈ N → i S ∗ ˙ 1 ˙ j = if i = j S 0 ˙
32 29 30 31 syl2anc ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B ∧ i ∈ N ∧ j ∈ N → i S ∗ ˙ 1 ˙ j = if i = j S 0 ˙
33 26 27 17 3jca ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → N ∈ Fin ∧ R ∈ Ring ∧ T ∈ B
34 33 3ad2ant1 ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B ∧ i ∈ N ∧ j ∈ N → N ∈ Fin ∧ R ∈ Ring ∧ T ∈ B
35 1 2 3 4 5 scmatscmide ⊢ N ∈ Fin ∧ R ∈ Ring ∧ T ∈ B ∧ i ∈ N ∧ j ∈ N → i T ∗ ˙ 1 ˙ j = if i = j T 0 ˙
36 34 30 35 syl2anc ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B ∧ i ∈ N ∧ j ∈ N → i T ∗ ˙ 1 ˙ j = if i = j T 0 ˙
37 32 36 oveq12d ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B ∧ i ∈ N ∧ j ∈ N → i S ∗ ˙ 1 ˙ j ⋅ R i T ∗ ˙ 1 ˙ j = if i = j S 0 ˙ ⋅ R if i = j T 0 ˙
38 37 ifeq1d ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B ∧ i ∈ N ∧ j ∈ N → if i = j i S ∗ ˙ 1 ˙ j ⋅ R i T ∗ ˙ 1 ˙ j 0 ˙ = if i = j if i = j S 0 ˙ ⋅ R if i = j T 0 ˙ 0 ˙
39 38 mpoeq3dva ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → i ∈ N , j ∈ N ⟼ if i = j i S ∗ ˙ 1 ˙ j ⋅ R i T ∗ ˙ 1 ˙ j 0 ˙ = i ∈ N , j ∈ N ⟼ if i = j if i = j S 0 ˙ ⋅ R if i = j T 0 ˙ 0 ˙
40 iftrue ⊢ i = j → if i = j S 0 ˙ = S
41 iftrue ⊢ i = j → if i = j T 0 ˙ = T
42 40 41 oveq12d ⊢ i = j → if i = j S 0 ˙ ⋅ R if i = j T 0 ˙ = S ⋅ R T
43 42 adantl ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B ∧ i ∈ N ∧ j ∈ N ∧ i = j → if i = j S 0 ˙ ⋅ R if i = j T 0 ˙ = S ⋅ R T
44 43 ifeq1da ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B ∧ i ∈ N ∧ j ∈ N → if i = j if i = j S 0 ˙ ⋅ R if i = j T 0 ˙ 0 ˙ = if i = j S ⋅ R T 0 ˙
45 44 mpoeq3dva ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → i ∈ N , j ∈ N ⟼ if i = j if i = j S 0 ˙ ⋅ R if i = j T 0 ˙ 0 ˙ = i ∈ N , j ∈ N ⟼ if i = j S ⋅ R T 0 ˙
46 eqidd ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B ∧ x ∈ N ∧ y ∈ N → i ∈ N , j ∈ N ⟼ if i = j S ⋅ R T 0 ˙ = i ∈ N , j ∈ N ⟼ if i = j S ⋅ R T 0 ˙
47 eqeq12 ⊢ i = x ∧ j = y → i = j ↔ x = y
48 6 eqcomi ⊢ ⋅ R = · ˙
49 48 oveqi ⊢ S ⋅ R T = S · ˙ T
50 49 a1i ⊢ i = x ∧ j = y → S ⋅ R T = S · ˙ T
51 47 50 ifbieq1d ⊢ i = x ∧ j = y → if i = j S ⋅ R T 0 ˙ = if x = y S · ˙ T 0 ˙
52 51 adantl ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B ∧ x ∈ N ∧ y ∈ N ∧ i = x ∧ j = y → if i = j S ⋅ R T 0 ˙ = if x = y S · ˙ T 0 ˙
53 simprl ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B ∧ x ∈ N ∧ y ∈ N → x ∈ N
54 simprr ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B ∧ x ∈ N ∧ y ∈ N → y ∈ N
55 ovex ⊢ S · ˙ T ∈ V
56 3 fvexi ⊢ 0 ˙ ∈ V
57 55 56 ifex ⊢ if x = y S · ˙ T 0 ˙ ∈ V
58 57 a1i ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B ∧ x ∈ N ∧ y ∈ N → if x = y S · ˙ T 0 ˙ ∈ V
59 46 52 53 54 58 ovmpod ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B ∧ x ∈ N ∧ y ∈ N → x i ∈ N , j ∈ N ⟼ if i = j S ⋅ R T 0 ˙ y = if x = y S · ˙ T 0 ˙
60 27 8 17 3jca ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → R ∈ Ring ∧ S ∈ B ∧ T ∈ B
61 2 6 ringcl ⊢ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → S · ˙ T ∈ B
62 60 61 syl ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → S · ˙ T ∈ B
63 26 27 62 3jca ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → N ∈ Fin ∧ R ∈ Ring ∧ S · ˙ T ∈ B
64 1 2 3 4 5 scmatscmide ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S · ˙ T ∈ B ∧ x ∈ N ∧ y ∈ N → x S · ˙ T ∗ ˙ 1 ˙ y = if x = y S · ˙ T 0 ˙
65 63 64 sylan ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B ∧ x ∈ N ∧ y ∈ N → x S · ˙ T ∗ ˙ 1 ˙ y = if x = y S · ˙ T 0 ˙
66 59 65 eqtr4d ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B ∧ x ∈ N ∧ y ∈ N → x i ∈ N , j ∈ N ⟼ if i = j S ⋅ R T 0 ˙ y = x S · ˙ T ∗ ˙ 1 ˙ y
67 66 ralrimivva ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → ∀ x ∈ N ∀ y ∈ N x i ∈ N , j ∈ N ⟼ if i = j S ⋅ R T 0 ˙ y = x S · ˙ T ∗ ˙ 1 ˙ y
68 eqid ⊢ ⋅ R = ⋅ R
69 2 68 ringcl ⊢ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → S ⋅ R T ∈ B
70 60 69 syl ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → S ⋅ R T ∈ B
71 2 3 ring0cl ⊢ R ∈ Ring → 0 ˙ ∈ B
72 71 adantl ⊢ N ∈ Fin ∧ R ∈ Ring → 0 ˙ ∈ B
73 72 adantr ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → 0 ˙ ∈ B
74 70 73 ifcld ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → if i = j S ⋅ R T 0 ˙ ∈ B
75 74 3ad2ant1 ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B ∧ i ∈ N ∧ j ∈ N → if i = j S ⋅ R T 0 ˙ ∈ B
76 1 2 9 26 27 75 matbas2d ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → i ∈ N , j ∈ N ⟼ if i = j S ⋅ R T 0 ˙ ∈ Base A
77 1 matring ⊢ N ∈ Fin ∧ R ∈ Ring → A ∈ Ring
78 9 4 ringidcl ⊢ A ∈ Ring → 1 ˙ ∈ Base A
79 77 78 syl ⊢ N ∈ Fin ∧ R ∈ Ring → 1 ˙ ∈ Base A
80 79 adantr ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → 1 ˙ ∈ Base A
81 62 80 jca ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → S · ˙ T ∈ B ∧ 1 ˙ ∈ Base A
82 2 1 9 5 matvscl ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S · ˙ T ∈ B ∧ 1 ˙ ∈ Base A → S · ˙ T ∗ ˙ 1 ˙ ∈ Base A
83 81 82 syldan ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → S · ˙ T ∗ ˙ 1 ˙ ∈ Base A
84 1 9 eqmat ⊢ i ∈ N , j ∈ N ⟼ if i = j S ⋅ R T 0 ˙ ∈ Base A ∧ S · ˙ T ∗ ˙ 1 ˙ ∈ Base A → i ∈ N , j ∈ N ⟼ if i = j S ⋅ R T 0 ˙ = S · ˙ T ∗ ˙ 1 ˙ ↔ ∀ x ∈ N ∀ y ∈ N x i ∈ N , j ∈ N ⟼ if i = j S ⋅ R T 0 ˙ y = x S · ˙ T ∗ ˙ 1 ˙ y
85 76 83 84 syl2anc ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → i ∈ N , j ∈ N ⟼ if i = j S ⋅ R T 0 ˙ = S · ˙ T ∗ ˙ 1 ˙ ↔ ∀ x ∈ N ∀ y ∈ N x i ∈ N , j ∈ N ⟼ if i = j S ⋅ R T 0 ˙ y = x S · ˙ T ∗ ˙ 1 ˙ y
86 67 85 mpbird ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → i ∈ N , j ∈ N ⟼ if i = j S ⋅ R T 0 ˙ = S · ˙ T ∗ ˙ 1 ˙
87 45 86 eqtrd ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → i ∈ N , j ∈ N ⟼ if i = j if i = j S 0 ˙ ⋅ R if i = j T 0 ˙ 0 ˙ = S · ˙ T ∗ ˙ 1 ˙
88 39 87 eqtrd ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → i ∈ N , j ∈ N ⟼ if i = j i S ∗ ˙ 1 ˙ j ⋅ R i T ∗ ˙ 1 ˙ j 0 ˙ = S · ˙ T ∗ ˙ 1 ˙
89 25 88 eqtrd ⊢ N ∈ Fin ∧ R ∈ Ring ∧ S ∈ B ∧ T ∈ B → S ∗ ˙ 1 ˙ × ˙ T ∗ ˙ 1 ˙ = S · ˙ T ∗ ˙ 1 ˙