Theorem assapropd 22050

Description: If two structures have the same components (properties), one is an associative algebra iff the other one is. (Contributed by Mario Carneiro, 8-Feb-2015.)

Hypotheses

Ref	Expression
assapropd.1	⊢ (𝜑 → 𝐵 = (Base‘𝐾))
assapropd.2	⊢ (𝜑 → 𝐵 = (Base‘𝐿))
assapropd.3	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
assapropd.4	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐾)𝑦) = (𝑥(.r‘𝐿)𝑦))
assapropd.5	⊢ (𝜑 → 𝐹 = (Scalar‘𝐾))
assapropd.6	⊢ (𝜑 → 𝐹 = (Scalar‘𝐿))
assapropd.7	⊢ 𝑃 = (Base‘𝐹)
assapropd.8	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑃 ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘𝐾)𝑦) = (𝑥( ·𝑠 ‘𝐿)𝑦))

Assertion

Ref	Expression
assapropd	⊢ (𝜑 → (𝐾 ∈ AssAlg ↔ 𝐿 ∈ AssAlg))

Distinct variable groups:   𝑥,𝑦,𝐾   𝑥,𝐿,𝑦   𝑥,𝑃,𝑦   𝜑,𝑥,𝑦   𝑥,𝐵,𝑦

Allowed substitution hints:   𝐹(𝑥, 𝑦)

Proof of Theorem assapropd

Dummy variables 𝑤 𝑟 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		assalmod 22039	. . . 4 ⊢ (𝐾 ∈ AssAlg → 𝐾 ∈ LMod)
2		assaring 22040	. . . 4 ⊢ (𝐾 ∈ AssAlg → 𝐾 ∈ Ring)
3	1, 2	jca 521	. . 3 ⊢ (𝐾 ∈ AssAlg → (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring))
4	3	a1i 11	. 2 ⊢ (𝜑 → (𝐾 ∈ AssAlg → (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)))
5		assalmod 22039	. . . 4 ⊢ (𝐿 ∈ AssAlg → 𝐿 ∈ LMod)
6		assapropd.1	. . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐾))
7		assapropd.2	. . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐿))
8		assapropd.3	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
9		assapropd.5	. . . . 5 ⊢ (𝜑 → 𝐹 = (Scalar‘𝐾))
10		assapropd.6	. . . . 5 ⊢ (𝜑 → 𝐹 = (Scalar‘𝐿))
11		assapropd.7	. . . . 5 ⊢ 𝑃 = (Base‘𝐹)
12		assapropd.8	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑃 ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘𝐾)𝑦) = (𝑥( ·𝑠 ‘𝐿)𝑦))
13	6, 7, 8, 9, 10, 11, 12	lmodpropd 21075	. . . 4 ⊢ (𝜑 → (𝐾 ∈ LMod ↔ 𝐿 ∈ LMod))
14	5, 13	imbitrrid 249	. . 3 ⊢ (𝜑 → (𝐿 ∈ AssAlg → 𝐾 ∈ LMod))
15		assaring 22040	. . . 4 ⊢ (𝐿 ∈ AssAlg → 𝐿 ∈ Ring)
16		assapropd.4	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐾)𝑦) = (𝑥(.r‘𝐿)𝑦))
17	6, 7, 8, 16	ringpropd 20396	. . . 4 ⊢ (𝜑 → (𝐾 ∈ Ring ↔ 𝐿 ∈ Ring))
18	15, 17	imbitrrid 249	. . 3 ⊢ (𝜑 → (𝐿 ∈ AssAlg → 𝐾 ∈ Ring))
19	14, 18	jcad 522	. 2 ⊢ (𝜑 → (𝐿 ∈ AssAlg → (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)))
20	13, 17	anbi12d 644	. . . . . 6 ⊢ (𝜑 → ((𝐾 ∈ LMod ∧ 𝐾 ∈ Ring) ↔ (𝐿 ∈ LMod ∧ 𝐿 ∈ Ring)))
21	20	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) → ((𝐾 ∈ LMod ∧ 𝐾 ∈ Ring) ↔ (𝐿 ∈ LMod ∧ 𝐿 ∈ Ring)))
22		simpll 779	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → 𝜑)
23		simplrl 789	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → 𝐾 ∈ LMod)
24		simprl 783	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → 𝑟 ∈ 𝑃)
25	9	fveq2d 6889	. . . . . . . . . . . . . . . . . 18 ⊢ (𝜑 → (Base‘𝐹) = (Base‘(Scalar‘𝐾)))
26	11, 25	eqtrid 2812	. . . . . . . . . . . . . . . . 17 ⊢ (𝜑 → 𝑃 = (Base‘(Scalar‘𝐾)))
27	22, 26	syl 18	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → 𝑃 = (Base‘(Scalar‘𝐾)))
28	24, 27	eleqtrd 2867	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → 𝑟 ∈ (Base‘(Scalar‘𝐾)))
29		simprrl 793	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → 𝑧 ∈ 𝐵)
30	22, 6	syl 18	. . . . . . . . . . . . . . . 16 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → 𝐵 = (Base‘𝐾))
31	29, 30	eleqtrd 2867	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → 𝑧 ∈ (Base‘𝐾))
32		eqid 2765	. . . . . . . . . . . . . . . 16 ⊢ (Base‘𝐾) = (Base‘𝐾)
33		eqid 2765	. . . . . . . . . . . . . . . 16 ⊢ (Scalar‘𝐾) = (Scalar‘𝐾)
34		eqid 2765	. . . . . . . . . . . . . . . 16 ⊢ ( ·𝑠 ‘𝐾) = ( ·𝑠 ‘𝐾)
35		eqid 2765	. . . . . . . . . . . . . . . 16 ⊢ (Base‘(Scalar‘𝐾)) = (Base‘(Scalar‘𝐾))
36	32, 33, 34, 35	lmodvscl 21028	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ LMod ∧ 𝑟 ∈ (Base‘(Scalar‘𝐾)) ∧ 𝑧 ∈ (Base‘𝐾)) → (𝑟( ·𝑠 ‘𝐾)𝑧) ∈ (Base‘𝐾))
37	23, 28, 31, 36	syl3anc 1398	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → (𝑟( ·𝑠 ‘𝐾)𝑧) ∈ (Base‘𝐾))
38	37, 30	eleqtrrd 2868	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → (𝑟( ·𝑠 ‘𝐾)𝑧) ∈ 𝐵)
39		simprrr 794	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → 𝑤 ∈ 𝐵)
40	16	oveqrspc2v 7443	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ ((𝑟( ·𝑠 ‘𝐾)𝑧) ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → ((𝑟( ·𝑠 ‘𝐾)𝑧)(.r‘𝐾)𝑤) = ((𝑟( ·𝑠 ‘𝐾)𝑧)(.r‘𝐿)𝑤))
41	22, 38, 39, 40	syl12anc 850	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → ((𝑟( ·𝑠 ‘𝐾)𝑧)(.r‘𝐾)𝑤) = ((𝑟( ·𝑠 ‘𝐾)𝑧)(.r‘𝐿)𝑤))
42	12	oveqrspc2v 7443	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑃 ∧ 𝑧 ∈ 𝐵)) → (𝑟( ·𝑠 ‘𝐾)𝑧) = (𝑟( ·𝑠 ‘𝐿)𝑧))
43	22, 24, 29, 42	syl12anc 850	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → (𝑟( ·𝑠 ‘𝐾)𝑧) = (𝑟( ·𝑠 ‘𝐿)𝑧))
44	43	oveq1d 7431	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → ((𝑟( ·𝑠 ‘𝐾)𝑧)(.r‘𝐿)𝑤) = ((𝑟( ·𝑠 ‘𝐿)𝑧)(.r‘𝐿)𝑤))
45	41, 44	eqtrd 2800	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → ((𝑟( ·𝑠 ‘𝐾)𝑧)(.r‘𝐾)𝑤) = ((𝑟( ·𝑠 ‘𝐿)𝑧)(.r‘𝐿)𝑤))
46		eqid 2765	. . . . . . . . . . . . . . 15 ⊢ (.r‘𝐾) = (.r‘𝐾)
47		simplrr 790	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → 𝐾 ∈ Ring)
48	39, 30	eleqtrd 2867	. . . . . . . . . . . . . . 15 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → 𝑤 ∈ (Base‘𝐾))
49	32, 46, 47, 31, 48	ringcld 20362	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → (𝑧(.r‘𝐾)𝑤) ∈ (Base‘𝐾))
50	49, 30	eleqtrrd 2868	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → (𝑧(.r‘𝐾)𝑤) ∈ 𝐵)
51	12	oveqrspc2v 7443	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑃 ∧ (𝑧(.r‘𝐾)𝑤) ∈ 𝐵)) → (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐾)𝑤)))
52	22, 24, 50, 51	syl12anc 850	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐾)𝑤)))
53	16	oveqrspc2v 7443	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → (𝑧(.r‘𝐾)𝑤) = (𝑧(.r‘𝐿)𝑤))
54	22, 29, 39, 53	syl12anc 850	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → (𝑧(.r‘𝐾)𝑤) = (𝑧(.r‘𝐿)𝑤))
55	54	oveq2d 7432	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐾)𝑤)) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)))
56	52, 55	eqtrd 2800	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)))
57	45, 56	eqeq12d 2781	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → (((𝑟( ·𝑠 ‘𝐾)𝑧)(.r‘𝐾)𝑤) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)) ↔ ((𝑟( ·𝑠 ‘𝐿)𝑧)(.r‘𝐿)𝑤) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤))))
58	32, 33, 34, 35	lmodvscl 21028	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ LMod ∧ 𝑟 ∈ (Base‘(Scalar‘𝐾)) ∧ 𝑤 ∈ (Base‘𝐾)) → (𝑟( ·𝑠 ‘𝐾)𝑤) ∈ (Base‘𝐾))
59	23, 28, 48, 58	syl3anc 1398	. . . . . . . . . . . . . 14 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → (𝑟( ·𝑠 ‘𝐾)𝑤) ∈ (Base‘𝐾))
60	59, 30	eleqtrrd 2868	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → (𝑟( ·𝑠 ‘𝐾)𝑤) ∈ 𝐵)
61	16	oveqrspc2v 7443	. . . . . . . . . . . . 13 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝐵 ∧ (𝑟( ·𝑠 ‘𝐾)𝑤) ∈ 𝐵)) → (𝑧(.r‘𝐾)(𝑟( ·𝑠 ‘𝐾)𝑤)) = (𝑧(.r‘𝐿)(𝑟( ·𝑠 ‘𝐾)𝑤)))
62	22, 29, 60, 61	syl12anc 850	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → (𝑧(.r‘𝐾)(𝑟( ·𝑠 ‘𝐾)𝑤)) = (𝑧(.r‘𝐿)(𝑟( ·𝑠 ‘𝐾)𝑤)))
63	12	oveqrspc2v 7443	. . . . . . . . . . . . . 14 ⊢ ((𝜑 ∧ (𝑟 ∈ 𝑃 ∧ 𝑤 ∈ 𝐵)) → (𝑟( ·𝑠 ‘𝐾)𝑤) = (𝑟( ·𝑠 ‘𝐿)𝑤))
64	22, 24, 39, 63	syl12anc 850	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → (𝑟( ·𝑠 ‘𝐾)𝑤) = (𝑟( ·𝑠 ‘𝐿)𝑤))
65	64	oveq2d 7432	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → (𝑧(.r‘𝐿)(𝑟( ·𝑠 ‘𝐾)𝑤)) = (𝑧(.r‘𝐿)(𝑟( ·𝑠 ‘𝐿)𝑤)))
66	62, 65	eqtrd 2800	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → (𝑧(.r‘𝐾)(𝑟( ·𝑠 ‘𝐾)𝑤)) = (𝑧(.r‘𝐿)(𝑟( ·𝑠 ‘𝐿)𝑤)))
67	66, 56	eqeq12d 2781	. . . . . . . . . 10 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → ((𝑧(.r‘𝐾)(𝑟( ·𝑠 ‘𝐾)𝑤)) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)) ↔ (𝑧(.r‘𝐿)(𝑟( ·𝑠 ‘𝐿)𝑤)) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤))))
68	57, 67	anbi12d 644	. . . . . . . . 9 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ (𝑟 ∈ 𝑃 ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵))) → ((((𝑟( ·𝑠 ‘𝐾)𝑧)(.r‘𝐾)𝑤) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)) ∧ (𝑧(.r‘𝐾)(𝑟( ·𝑠 ‘𝐾)𝑤)) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤))) ↔ (((𝑟( ·𝑠 ‘𝐿)𝑧)(.r‘𝐿)𝑤) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)) ∧ (𝑧(.r‘𝐿)(𝑟( ·𝑠 ‘𝐿)𝑤)) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)))))
69	68	anassrs 473	. . . . . . . 8 ⊢ ((((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ 𝑟 ∈ 𝑃) ∧ (𝑧 ∈ 𝐵 ∧ 𝑤 ∈ 𝐵)) → ((((𝑟( ·𝑠 ‘𝐾)𝑧)(.r‘𝐾)𝑤) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)) ∧ (𝑧(.r‘𝐾)(𝑟( ·𝑠 ‘𝐾)𝑤)) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤))) ↔ (((𝑟( ·𝑠 ‘𝐿)𝑧)(.r‘𝐿)𝑤) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)) ∧ (𝑧(.r‘𝐿)(𝑟( ·𝑠 ‘𝐿)𝑤)) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)))))
70	69	2ralbidva 3229	. . . . . . 7 ⊢ (((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) ∧ 𝑟 ∈ 𝑃) → (∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 (((𝑟( ·𝑠 ‘𝐾)𝑧)(.r‘𝐾)𝑤) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)) ∧ (𝑧(.r‘𝐾)(𝑟( ·𝑠 ‘𝐾)𝑤)) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤))) ↔ ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 (((𝑟( ·𝑠 ‘𝐿)𝑧)(.r‘𝐿)𝑤) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)) ∧ (𝑧(.r‘𝐿)(𝑟( ·𝑠 ‘𝐿)𝑤)) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)))))
71	70	ralbidva 3188	. . . . . 6 ⊢ ((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) → (∀𝑟 ∈ 𝑃 ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 (((𝑟( ·𝑠 ‘𝐾)𝑧)(.r‘𝐾)𝑤) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)) ∧ (𝑧(.r‘𝐾)(𝑟( ·𝑠 ‘𝐾)𝑤)) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤))) ↔ ∀𝑟 ∈ 𝑃 ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 (((𝑟( ·𝑠 ‘𝐿)𝑧)(.r‘𝐿)𝑤) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)) ∧ (𝑧(.r‘𝐿)(𝑟( ·𝑠 ‘𝐿)𝑤)) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)))))
72	26	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) → 𝑃 = (Base‘(Scalar‘𝐾)))
73	6	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) → 𝐵 = (Base‘𝐾))
74	73	raleqdv 3325	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) → (∀𝑤 ∈ 𝐵 (((𝑟( ·𝑠 ‘𝐾)𝑧)(.r‘𝐾)𝑤) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)) ∧ (𝑧(.r‘𝐾)(𝑟( ·𝑠 ‘𝐾)𝑤)) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤))) ↔ ∀𝑤 ∈ (Base‘𝐾)(((𝑟( ·𝑠 ‘𝐾)𝑧)(.r‘𝐾)𝑤) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)) ∧ (𝑧(.r‘𝐾)(𝑟( ·𝑠 ‘𝐾)𝑤)) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)))))
75	73, 74	raleqbidv 3340	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) → (∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 (((𝑟( ·𝑠 ‘𝐾)𝑧)(.r‘𝐾)𝑤) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)) ∧ (𝑧(.r‘𝐾)(𝑟( ·𝑠 ‘𝐾)𝑤)) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤))) ↔ ∀𝑧 ∈ (Base‘𝐾)∀𝑤 ∈ (Base‘𝐾)(((𝑟( ·𝑠 ‘𝐾)𝑧)(.r‘𝐾)𝑤) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)) ∧ (𝑧(.r‘𝐾)(𝑟( ·𝑠 ‘𝐾)𝑤)) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)))))
76	72, 75	raleqbidv 3340	. . . . . 6 ⊢ ((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) → (∀𝑟 ∈ 𝑃 ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 (((𝑟( ·𝑠 ‘𝐾)𝑧)(.r‘𝐾)𝑤) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)) ∧ (𝑧(.r‘𝐾)(𝑟( ·𝑠 ‘𝐾)𝑤)) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤))) ↔ ∀𝑟 ∈ (Base‘(Scalar‘𝐾))∀𝑧 ∈ (Base‘𝐾)∀𝑤 ∈ (Base‘𝐾)(((𝑟( ·𝑠 ‘𝐾)𝑧)(.r‘𝐾)𝑤) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)) ∧ (𝑧(.r‘𝐾)(𝑟( ·𝑠 ‘𝐾)𝑤)) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)))))
77	10	fveq2d 6889	. . . . . . . . 9 ⊢ (𝜑 → (Base‘𝐹) = (Base‘(Scalar‘𝐿)))
78	11, 77	eqtrid 2812	. . . . . . . 8 ⊢ (𝜑 → 𝑃 = (Base‘(Scalar‘𝐿)))
79	78	adantr 486	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) → 𝑃 = (Base‘(Scalar‘𝐿)))
80	7	adantr 486	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) → 𝐵 = (Base‘𝐿))
81	80	raleqdv 3325	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) → (∀𝑤 ∈ 𝐵 (((𝑟( ·𝑠 ‘𝐿)𝑧)(.r‘𝐿)𝑤) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)) ∧ (𝑧(.r‘𝐿)(𝑟( ·𝑠 ‘𝐿)𝑤)) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤))) ↔ ∀𝑤 ∈ (Base‘𝐿)(((𝑟( ·𝑠 ‘𝐿)𝑧)(.r‘𝐿)𝑤) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)) ∧ (𝑧(.r‘𝐿)(𝑟( ·𝑠 ‘𝐿)𝑤)) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)))))
82	80, 81	raleqbidv 3340	. . . . . . 7 ⊢ ((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) → (∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 (((𝑟( ·𝑠 ‘𝐿)𝑧)(.r‘𝐿)𝑤) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)) ∧ (𝑧(.r‘𝐿)(𝑟( ·𝑠 ‘𝐿)𝑤)) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤))) ↔ ∀𝑧 ∈ (Base‘𝐿)∀𝑤 ∈ (Base‘𝐿)(((𝑟( ·𝑠 ‘𝐿)𝑧)(.r‘𝐿)𝑤) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)) ∧ (𝑧(.r‘𝐿)(𝑟( ·𝑠 ‘𝐿)𝑤)) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)))))
83	79, 82	raleqbidv 3340	. . . . . 6 ⊢ ((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) → (∀𝑟 ∈ 𝑃 ∀𝑧 ∈ 𝐵 ∀𝑤 ∈ 𝐵 (((𝑟( ·𝑠 ‘𝐿)𝑧)(.r‘𝐿)𝑤) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)) ∧ (𝑧(.r‘𝐿)(𝑟( ·𝑠 ‘𝐿)𝑤)) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤))) ↔ ∀𝑟 ∈ (Base‘(Scalar‘𝐿))∀𝑧 ∈ (Base‘𝐿)∀𝑤 ∈ (Base‘𝐿)(((𝑟( ·𝑠 ‘𝐿)𝑧)(.r‘𝐿)𝑤) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)) ∧ (𝑧(.r‘𝐿)(𝑟( ·𝑠 ‘𝐿)𝑤)) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)))))
84	71, 76, 83	3bitr3d 312	. . . . 5 ⊢ ((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) → (∀𝑟 ∈ (Base‘(Scalar‘𝐾))∀𝑧 ∈ (Base‘𝐾)∀𝑤 ∈ (Base‘𝐾)(((𝑟( ·𝑠 ‘𝐾)𝑧)(.r‘𝐾)𝑤) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)) ∧ (𝑧(.r‘𝐾)(𝑟( ·𝑠 ‘𝐾)𝑤)) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤))) ↔ ∀𝑟 ∈ (Base‘(Scalar‘𝐿))∀𝑧 ∈ (Base‘𝐿)∀𝑤 ∈ (Base‘𝐿)(((𝑟( ·𝑠 ‘𝐿)𝑧)(.r‘𝐿)𝑤) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)) ∧ (𝑧(.r‘𝐿)(𝑟( ·𝑠 ‘𝐿)𝑤)) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)))))
85	21, 84	anbi12d 644	. . . 4 ⊢ ((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) → (((𝐾 ∈ LMod ∧ 𝐾 ∈ Ring) ∧ ∀𝑟 ∈ (Base‘(Scalar‘𝐾))∀𝑧 ∈ (Base‘𝐾)∀𝑤 ∈ (Base‘𝐾)(((𝑟( ·𝑠 ‘𝐾)𝑧)(.r‘𝐾)𝑤) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)) ∧ (𝑧(.r‘𝐾)(𝑟( ·𝑠 ‘𝐾)𝑤)) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)))) ↔ ((𝐿 ∈ LMod ∧ 𝐿 ∈ Ring) ∧ ∀𝑟 ∈ (Base‘(Scalar‘𝐿))∀𝑧 ∈ (Base‘𝐿)∀𝑤 ∈ (Base‘𝐿)(((𝑟( ·𝑠 ‘𝐿)𝑧)(.r‘𝐿)𝑤) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)) ∧ (𝑧(.r‘𝐿)(𝑟( ·𝑠 ‘𝐿)𝑤)) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤))))))
86	32, 33, 35, 34, 46	isassa 22035	. . . 4 ⊢ (𝐾 ∈ AssAlg ↔ ((𝐾 ∈ LMod ∧ 𝐾 ∈ Ring) ∧ ∀𝑟 ∈ (Base‘(Scalar‘𝐾))∀𝑧 ∈ (Base‘𝐾)∀𝑤 ∈ (Base‘𝐾)(((𝑟( ·𝑠 ‘𝐾)𝑧)(.r‘𝐾)𝑤) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)) ∧ (𝑧(.r‘𝐾)(𝑟( ·𝑠 ‘𝐾)𝑤)) = (𝑟( ·𝑠 ‘𝐾)(𝑧(.r‘𝐾)𝑤)))))
87		eqid 2765	. . . . 5 ⊢ (Base‘𝐿) = (Base‘𝐿)
88		eqid 2765	. . . . 5 ⊢ (Scalar‘𝐿) = (Scalar‘𝐿)
89		eqid 2765	. . . . 5 ⊢ (Base‘(Scalar‘𝐿)) = (Base‘(Scalar‘𝐿))
90		eqid 2765	. . . . 5 ⊢ ( ·𝑠 ‘𝐿) = ( ·𝑠 ‘𝐿)
91		eqid 2765	. . . . 5 ⊢ (.r‘𝐿) = (.r‘𝐿)
92	87, 88, 89, 90, 91	isassa 22035	. . . 4 ⊢ (𝐿 ∈ AssAlg ↔ ((𝐿 ∈ LMod ∧ 𝐿 ∈ Ring) ∧ ∀𝑟 ∈ (Base‘(Scalar‘𝐿))∀𝑧 ∈ (Base‘𝐿)∀𝑤 ∈ (Base‘𝐿)(((𝑟( ·𝑠 ‘𝐿)𝑧)(.r‘𝐿)𝑤) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)) ∧ (𝑧(.r‘𝐿)(𝑟( ·𝑠 ‘𝐿)𝑤)) = (𝑟( ·𝑠 ‘𝐿)(𝑧(.r‘𝐿)𝑤)))))
93	85, 86, 92	3bitr4g 317	. . 3 ⊢ ((𝜑 ∧ (𝐾 ∈ LMod ∧ 𝐾 ∈ Ring)) → (𝐾 ∈ AssAlg ↔ 𝐿 ∈ AssAlg))
94	93	ex 418	. 2 ⊢ (𝜑 → ((𝐾 ∈ LMod ∧ 𝐾 ∈ Ring) → (𝐾 ∈ AssAlg ↔ 𝐿 ∈ AssAlg)))
95	4, 19, 94	pm5.21ndd 382	1 ⊢ (𝜑 → (𝐾 ∈ AssAlg ↔ 𝐿 ∈ AssAlg))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∀wral 3081  ‘cfv 6540  (class class class)co 7416  Basecbs 17286  +_gcplusg 17327  ._rcmulr 17328  Scalarcsca 17330   ·_𝑠 cvsca 17331  Ringcrg 20338  LModclmod 21010  AssAlgcasa 22029

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738  ax-cnex 11167  ax-resscn 11168  ax-1cn 11169  ax-icn 11170  ax-addcl 11171  ax-addrcl 11172  ax-mulcl 11173  ax-mulrcl 11174  ax-mulcom 11175  ax-addass 11176  ax-mulass 11177  ax-distr 11178  ax-i2m1 11179  ax-1ne0 11180  ax-1rid 11181  ax-rnegex 11182  ax-rrecex 11183  ax-cnre 11184  ax-pre-lttri 11185  ax-pre-lttrn 11186  ax-pre-ltadd 11187  ax-pre-mulgt0 11188

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-om 7865  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-er 8696  df-en 8946  df-dom 8947  df-sdom 8948  df-pnf 11256  df-mnf 11257  df-xr 11258  df-ltxr 11259  df-le 11260  df-sub 11454  df-neg 11455  df-nn 12245  df-2 12314  df-sets 17241  df-slot 17259  df-ndx 17271  df-base 17287  df-plusg 17340  df-0g 17511  df-mgm 18715  df-sgrp 18798  df-mnd 18814  df-grp 19026  df-mgp 20240  df-ur 20287  df-ring 20340  df-lmod 21012  df-assa 22032

This theorem is used by:  opsrassa  22240