ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  assalem GIF version

Theorem assalem 15087
Description: The properties of an associative algebra. (Contributed by Mario Carneiro, 29-Dec-2014.)
Hypotheses
Ref Expression
isassa.v 𝑉 = (Base‘𝑊)
isassa.f 𝐹 = (Scalar‘𝑊)
isassa.b 𝐵 = (Base‘𝐹)
isassa.s · = ( ·𝑠 ‘𝑊)
isassa.t × = (.r‘𝑊)
Assertion
Ref Expression
assalem ((𝑊 ∈ AssAlg ∧ (𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (((𝐴 · 𝑋) × 𝑌) = (𝐴 · (𝑋 × 𝑌)) ∧ (𝑋 × (𝐴 · 𝑌)) = (𝐴 · (𝑋 × 𝑌))))

Proof of Theorem assalem
Dummy variables 𝑥 𝑟 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 isassa.v . . . 4 𝑉 = (Base‘𝑊)
2 isassa.f . . . 4 𝐹 = (Scalar‘𝑊)
3 isassa.b . . . 4 𝐵 = (Base‘𝐹)
4 isassa.s . . . 4 · = ( ·𝑠 ‘𝑊)
5 isassa.t . . . 4 × = (.r‘𝑊)
61, 2, 3, 4, 5isassa 15086 . . 3 (𝑊 ∈ AssAlg ↔ ((𝑊 ∈ LMod ∧ 𝑊 ∈ Ring) ∧ ∀𝑟 ∈ 𝐵 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦)))))
76simprbi 275 . 2 (𝑊 ∈ AssAlg → ∀𝑟 ∈ 𝐵 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))))
8 oveq1 6092 . . . . . 6 (𝑟 = 𝐴 → (𝑟 · 𝑥) = (𝐴 · 𝑥))
98oveq1d 6100 . . . . 5 (𝑟 = 𝐴 → ((𝑟 · 𝑥) × 𝑦) = ((𝐴 · 𝑥) × 𝑦))
10 oveq1 6092 . . . . 5 (𝑟 = 𝐴 → (𝑟 · (𝑥 × 𝑦)) = (𝐴 · (𝑥 × 𝑦)))
119, 10eqeq12d 2253 . . . 4 (𝑟 = 𝐴 → (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ↔ ((𝐴 · 𝑥) × 𝑦) = (𝐴 · (𝑥 × 𝑦))))
12 oveq1 6092 . . . . . 6 (𝑟 = 𝐴 → (𝑟 · 𝑦) = (𝐴 · 𝑦))
1312oveq2d 6101 . . . . 5 (𝑟 = 𝐴 → (𝑥 × (𝑟 · 𝑦)) = (𝑥 × (𝐴 · 𝑦)))
1413, 10eqeq12d 2253 . . . 4 (𝑟 = 𝐴 → ((𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦)) ↔ (𝑥 × (𝐴 · 𝑦)) = (𝐴 · (𝑥 × 𝑦))))
1511, 14anbi12d 477 . . 3 (𝑟 = 𝐴 → ((((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))) ↔ (((𝐴 · 𝑥) × 𝑦) = (𝐴 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝐴 · 𝑦)) = (𝐴 · (𝑥 × 𝑦)))))
16 oveq2 6093 . . . . . 6 (𝑥 = 𝑋 → (𝐴 · 𝑥) = (𝐴 · 𝑋))
1716oveq1d 6100 . . . . 5 (𝑥 = 𝑋 → ((𝐴 · 𝑥) × 𝑦) = ((𝐴 · 𝑋) × 𝑦))
18 oveq1 6092 . . . . . 6 (𝑥 = 𝑋 → (𝑥 × 𝑦) = (𝑋 × 𝑦))
1918oveq2d 6101 . . . . 5 (𝑥 = 𝑋 → (𝐴 · (𝑥 × 𝑦)) = (𝐴 · (𝑋 × 𝑦)))
2017, 19eqeq12d 2253 . . . 4 (𝑥 = 𝑋 → (((𝐴 · 𝑥) × 𝑦) = (𝐴 · (𝑥 × 𝑦)) ↔ ((𝐴 · 𝑋) × 𝑦) = (𝐴 · (𝑋 × 𝑦))))
21 oveq1 6092 . . . . 5 (𝑥 = 𝑋 → (𝑥 × (𝐴 · 𝑦)) = (𝑋 × (𝐴 · 𝑦)))
2221, 19eqeq12d 2253 . . . 4 (𝑥 = 𝑋 → ((𝑥 × (𝐴 · 𝑦)) = (𝐴 · (𝑥 × 𝑦)) ↔ (𝑋 × (𝐴 · 𝑦)) = (𝐴 · (𝑋 × 𝑦))))
2320, 22anbi12d 477 . . 3 (𝑥 = 𝑋 → ((((𝐴 · 𝑥) × 𝑦) = (𝐴 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝐴 · 𝑦)) = (𝐴 · (𝑥 × 𝑦))) ↔ (((𝐴 · 𝑋) × 𝑦) = (𝐴 · (𝑋 × 𝑦)) ∧ (𝑋 × (𝐴 · 𝑦)) = (𝐴 · (𝑋 × 𝑦)))))
24 oveq2 6093 . . . . 5 (𝑦 = 𝑌 → ((𝐴 · 𝑋) × 𝑦) = ((𝐴 · 𝑋) × 𝑌))
25 oveq2 6093 . . . . . 6 (𝑦 = 𝑌 → (𝑋 × 𝑦) = (𝑋 × 𝑌))
2625oveq2d 6101 . . . . 5 (𝑦 = 𝑌 → (𝐴 · (𝑋 × 𝑦)) = (𝐴 · (𝑋 × 𝑌)))
2724, 26eqeq12d 2253 . . . 4 (𝑦 = 𝑌 → (((𝐴 · 𝑋) × 𝑦) = (𝐴 · (𝑋 × 𝑦)) ↔ ((𝐴 · 𝑋) × 𝑌) = (𝐴 · (𝑋 × 𝑌))))
28 oveq2 6093 . . . . . 6 (𝑦 = 𝑌 → (𝐴 · 𝑦) = (𝐴 · 𝑌))
2928oveq2d 6101 . . . . 5 (𝑦 = 𝑌 → (𝑋 × (𝐴 · 𝑦)) = (𝑋 × (𝐴 · 𝑌)))
3029, 26eqeq12d 2253 . . . 4 (𝑦 = 𝑌 → ((𝑋 × (𝐴 · 𝑦)) = (𝐴 · (𝑋 × 𝑦)) ↔ (𝑋 × (𝐴 · 𝑌)) = (𝐴 · (𝑋 × 𝑌))))
3127, 30anbi12d 477 . . 3 (𝑦 = 𝑌 → ((((𝐴 · 𝑋) × 𝑦) = (𝐴 · (𝑋 × 𝑦)) ∧ (𝑋 × (𝐴 · 𝑦)) = (𝐴 · (𝑋 × 𝑦))) ↔ (((𝐴 · 𝑋) × 𝑌) = (𝐴 · (𝑋 × 𝑌)) ∧ (𝑋 × (𝐴 · 𝑌)) = (𝐴 · (𝑋 × 𝑌)))))
3215, 23, 31rspc3v 2946 . 2 ((𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉) → (∀𝑟 ∈ 𝐵 ∀𝑥 ∈ 𝑉 ∀𝑦 ∈ 𝑉 (((𝑟 · 𝑥) × 𝑦) = (𝑟 · (𝑥 × 𝑦)) ∧ (𝑥 × (𝑟 · 𝑦)) = (𝑟 · (𝑥 × 𝑦))) → (((𝐴 · 𝑋) × 𝑌) = (𝐴 · (𝑋 × 𝑌)) ∧ (𝑋 × (𝐴 · 𝑌)) = (𝐴 · (𝑋 × 𝑌)))))
337, 32mpan9 281 1 ((𝑊 ∈ AssAlg ∧ (𝐴 ∈ 𝐵 ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑉)) → (((𝐴 · 𝑋) × 𝑌) = (𝐴 · (𝑋 × 𝑌)) ∧ (𝑋 × (𝐴 · 𝑌)) = (𝐴 · (𝑋 × 𝑌))))
Colors of variables:    wff set class
This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ∀wral 2528  ‘cfv 5377  (class class class)co 6085  Basecbs 13404  .rcmulr 13485  Scalarcsca 13487   ·𝑠 cvsca 13488  Ringcrg 14384  LModclmod 14707  AssAlgcasa 15080
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-cnex 8271  ax-resscn 8272  ax-1re 8274  ax-addrcl 8277
This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-rab 2537  df-v 2823  df-sbc 3052  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-ov 6088  df-inn 9308  df-2 9366  df-3 9367  df-4 9368  df-5 9369  df-6 9370  df-ndx 13407  df-slot 13408  df-mulr 13498  df-sca 13500  df-vsca 13501  df-assa 15083
This theorem is used by:  assaass  15088  assaassr  15089
  Copyright terms: Public domain W3C validator