Theorem lidlrsppropdg 14834

Description: The left ideals and ring span of a ring depend only on the ring components. Here 𝑊 is expected to be either 𝐵 (when closure is available) or V (when strong equality is available). (Contributed by Mario Carneiro, 14-Jun-2015.)

Hypotheses

Ref	Expression
lidlpropd.1	⊢ (𝜑 → 𝐵 = (Base‘𝐾))
lidlpropd.2	⊢ (𝜑 → 𝐵 = (Base‘𝐿))
lidlpropd.3	⊢ (𝜑 → 𝐵 ⊆ 𝑊)
lidlpropd.4	⊢ ((𝜑 ∧ (𝑥 ∈ 𝑊 ∧ 𝑦 ∈ 𝑊)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
lidlpropd.5	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐾)𝑦) ∈ 𝑊)
lidlpropd.6	⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐾)𝑦) = (𝑥(.r‘𝐿)𝑦))
lidlpropdg.k	⊢ (𝜑 → 𝐾 ∈ 𝑋)
lidlpropdg.l	⊢ (𝜑 → 𝐿 ∈ 𝑌)

Assertion

Ref	Expression
lidlrsppropdg	⊢ (𝜑 → ((LIdeal‘𝐾) = (LIdeal‘𝐿) ∧ (RSpan‘𝐾) = (RSpan‘𝐿)))

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

Allowed substitution hints:   𝑋(𝑥, 𝑦)   𝑌(𝑥, 𝑦)

Proof of Theorem lidlrsppropdg

Step	Hyp	Ref	Expression
1		lidlpropd.1	. . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐾))
2		lidlpropdg.k	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ 𝑋)
3		rlmbasg 14794	. . . . . 6 ⊢ (𝐾 ∈ 𝑋 → (Base‘𝐾) = (Base‘(ringLMod‘𝐾)))
4	2, 3	syl 14	. . . . 5 ⊢ (𝜑 → (Base‘𝐾) = (Base‘(ringLMod‘𝐾)))
5	1, 4	eqtrd 2271	. . . 4 ⊢ (𝜑 → 𝐵 = (Base‘(ringLMod‘𝐾)))
6		lidlpropd.2	. . . . 5 ⊢ (𝜑 → 𝐵 = (Base‘𝐿))
7		lidlpropdg.l	. . . . . 6 ⊢ (𝜑 → 𝐿 ∈ 𝑌)
8		rlmbasg 14794	. . . . . 6 ⊢ (𝐿 ∈ 𝑌 → (Base‘𝐿) = (Base‘(ringLMod‘𝐿)))
9	7, 8	syl 14	. . . . 5 ⊢ (𝜑 → (Base‘𝐿) = (Base‘(ringLMod‘𝐿)))
10	6, 9	eqtrd 2271	. . . 4 ⊢ (𝜑 → 𝐵 = (Base‘(ringLMod‘𝐿)))
11		lidlpropd.3	. . . 4 ⊢ (𝜑 → 𝐵 ⊆ 𝑊)
12		lidlpropd.4	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑊 ∧ 𝑦 ∈ 𝑊)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘𝐿)𝑦))
13		rlmplusgg 14795	. . . . . . 7 ⊢ (𝐾 ∈ 𝑋 → (+g‘𝐾) = (+g‘(ringLMod‘𝐾)))
14	2, 13	syl 14	. . . . . 6 ⊢ (𝜑 → (+g‘𝐾) = (+g‘(ringLMod‘𝐾)))
15	14	oveqdr 6113	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑊 ∧ 𝑦 ∈ 𝑊)) → (𝑥(+g‘𝐾)𝑦) = (𝑥(+g‘(ringLMod‘𝐾))𝑦))
16		rlmplusgg 14795	. . . . . . 7 ⊢ (𝐿 ∈ 𝑌 → (+g‘𝐿) = (+g‘(ringLMod‘𝐿)))
17	7, 16	syl 14	. . . . . 6 ⊢ (𝜑 → (+g‘𝐿) = (+g‘(ringLMod‘𝐿)))
18	17	oveqdr 6113	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑊 ∧ 𝑦 ∈ 𝑊)) → (𝑥(+g‘𝐿)𝑦) = (𝑥(+g‘(ringLMod‘𝐿))𝑦))
19	12, 15, 18	3eqtr3d 2279	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝑊 ∧ 𝑦 ∈ 𝑊)) → (𝑥(+g‘(ringLMod‘𝐾))𝑦) = (𝑥(+g‘(ringLMod‘𝐿))𝑦))
20		rlmvscag 14800	. . . . . . 7 ⊢ (𝐾 ∈ 𝑋 → (.r‘𝐾) = ( ·𝑠 ‘(ringLMod‘𝐾)))
21	2, 20	syl 14	. . . . . 6 ⊢ (𝜑 → (.r‘𝐾) = ( ·𝑠 ‘(ringLMod‘𝐾)))
22	21	oveqdr 6113	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐾)𝑦) = (𝑥( ·𝑠 ‘(ringLMod‘𝐾))𝑦))
23		lidlpropd.5	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐾)𝑦) ∈ 𝑊)
24	22, 23	eqeltrrd 2316	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘(ringLMod‘𝐾))𝑦) ∈ 𝑊)
25		lidlpropd.6	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐾)𝑦) = (𝑥(.r‘𝐿)𝑦))
26		rlmvscag 14800	. . . . . . 7 ⊢ (𝐿 ∈ 𝑌 → (.r‘𝐿) = ( ·𝑠 ‘(ringLMod‘𝐿)))
27	7, 26	syl 14	. . . . . 6 ⊢ (𝜑 → (.r‘𝐿) = ( ·𝑠 ‘(ringLMod‘𝐿)))
28	27	oveqdr 6113	. . . . 5 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥(.r‘𝐿)𝑦) = (𝑥( ·𝑠 ‘(ringLMod‘𝐿))𝑦))
29	25, 22, 28	3eqtr3d 2279	. . . 4 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵)) → (𝑥( ·𝑠 ‘(ringLMod‘𝐾))𝑦) = (𝑥( ·𝑠 ‘(ringLMod‘𝐿))𝑦))
30		rlmscabas 14799	. . . . . 6 ⊢ (𝐾 ∈ 𝑋 → (Base‘𝐾) = (Base‘(Scalar‘(ringLMod‘𝐾))))
31	2, 30	syl 14	. . . . 5 ⊢ (𝜑 → (Base‘𝐾) = (Base‘(Scalar‘(ringLMod‘𝐾))))
32	1, 31	eqtrd 2271	. . . 4 ⊢ (𝜑 → 𝐵 = (Base‘(Scalar‘(ringLMod‘𝐾))))
33		rlmscabas 14799	. . . . . 6 ⊢ (𝐿 ∈ 𝑌 → (Base‘𝐿) = (Base‘(Scalar‘(ringLMod‘𝐿))))
34	7, 33	syl 14	. . . . 5 ⊢ (𝜑 → (Base‘𝐿) = (Base‘(Scalar‘(ringLMod‘𝐿))))
35	6, 34	eqtrd 2271	. . . 4 ⊢ (𝜑 → 𝐵 = (Base‘(Scalar‘(ringLMod‘𝐿))))
36		rlmfn 14792	. . . . 5 ⊢ ringLMod Fn V
37	2	elexd 2835	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ V)
38		funfvex 5712	. . . . . 6 ⊢ ((Fun ringLMod ∧ 𝐾 ∈ dom ringLMod) → (ringLMod‘𝐾) ∈ V)
39	38	funfni 5483	. . . . 5 ⊢ ((ringLMod Fn V ∧ 𝐾 ∈ V) → (ringLMod‘𝐾) ∈ V)
40	36, 37, 39	sylancr 418	. . . 4 ⊢ (𝜑 → (ringLMod‘𝐾) ∈ V)
41	7	elexd 2835	. . . . 5 ⊢ (𝜑 → 𝐿 ∈ V)
42		funfvex 5712	. . . . . 6 ⊢ ((Fun ringLMod ∧ 𝐿 ∈ dom ringLMod) → (ringLMod‘𝐿) ∈ V)
43	42	funfni 5483	. . . . 5 ⊢ ((ringLMod Fn V ∧ 𝐿 ∈ V) → (ringLMod‘𝐿) ∈ V)
44	36, 41, 43	sylancr 418	. . . 4 ⊢ (𝜑 → (ringLMod‘𝐿) ∈ V)
45	5, 10, 11, 19, 24, 29, 32, 35, 40, 44	lsspropdg 14770	. . 3 ⊢ (𝜑 → (LSubSp‘(ringLMod‘𝐾)) = (LSubSp‘(ringLMod‘𝐿)))
46		lidlvalg 14810	. . . 4 ⊢ (𝐾 ∈ 𝑋 → (LIdeal‘𝐾) = (LSubSp‘(ringLMod‘𝐾)))
47	2, 46	syl 14	. . 3 ⊢ (𝜑 → (LIdeal‘𝐾) = (LSubSp‘(ringLMod‘𝐾)))
48		lidlvalg 14810	. . . 4 ⊢ (𝐿 ∈ 𝑌 → (LIdeal‘𝐿) = (LSubSp‘(ringLMod‘𝐿)))
49	7, 48	syl 14	. . 3 ⊢ (𝜑 → (LIdeal‘𝐿) = (LSubSp‘(ringLMod‘𝐿)))
50	45, 47, 49	3eqtr4d 2281	. 2 ⊢ (𝜑 → (LIdeal‘𝐾) = (LIdeal‘𝐿))
51	5, 10, 11, 19, 24, 29, 32, 35, 40, 44	lsppropd 14771	. . 3 ⊢ (𝜑 → (LSpan‘(ringLMod‘𝐾)) = (LSpan‘(ringLMod‘𝐿)))
52		rspvalg 14811	. . . 4 ⊢ (𝐾 ∈ 𝑋 → (RSpan‘𝐾) = (LSpan‘(ringLMod‘𝐾)))
53	2, 52	syl 14	. . 3 ⊢ (𝜑 → (RSpan‘𝐾) = (LSpan‘(ringLMod‘𝐾)))
54		rspvalg 14811	. . . 4 ⊢ (𝐿 ∈ 𝑌 → (RSpan‘𝐿) = (LSpan‘(ringLMod‘𝐿)))
55	7, 54	syl 14	. . 3 ⊢ (𝜑 → (RSpan‘𝐿) = (LSpan‘(ringLMod‘𝐿)))
56	51, 53, 55	3eqtr4d 2281	. 2 ⊢ (𝜑 → (RSpan‘𝐾) = (RSpan‘𝐿))
57	50, 56	jca 306	1 ⊢ (𝜑 → ((LIdeal‘𝐾) = (LIdeal‘𝐿) ∧ (RSpan‘𝐾) = (RSpan‘𝐿)))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   = wceq 1402   ∈ wcel 2209  Vcvv 2821   ⊆ wss 3220   Fn wfn 5372  ‘cfv 5377  (class class class)co 6085  Basecbs 13354  +_gcplusg 13433  ._rcmulr 13434  Scalarcsca 13436   ·_𝑠 cvsca 13437  LSubSpclss 14691  LSpanclspn 14725  ringLModcrglmod 14773  LIdealclidl 14806  RSpancrsp 14807

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  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-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-addcom 8279  ax-addass 8281  ax-i2m1 8284  ax-0lt1 8285  ax-0id 8287  ax-rnegex 8288  ax-pre-ltirr 8291  ax-pre-lttrn 8293  ax-pre-ltadd 8295

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  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-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  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-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8362  df-mnf 8363  df-ltxr 8365  df-inn 9306  df-2 9364  df-3 9365  df-4 9366  df-5 9367  df-6 9368  df-7 9369  df-8 9370  df-ndx 13357  df-slot 13358  df-base 13360  df-sets 13361  df-iress 13362  df-plusg 13446  df-mulr 13447  df-sca 13449  df-vsca 13450  df-ip 13451  df-lssm 14692  df-lsp 14726  df-sra 14774  df-rgmod 14775  df-lidl 14808  df-rsp 14809

This theorem is used by:  crngridl  14869