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

Theorem lidlrsppropdg 14630
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
StepHypRef Expression
1 lidlpropd.1 . . . . 5 (𝜑𝐵 = (Base‘𝐾))
2 lidlpropdg.k . . . . . 6 (𝜑𝐾𝑋)
3 rlmbasg 14590 . . . . . 6 (𝐾𝑋 → (Base‘𝐾) = (Base‘(ringLMod‘𝐾)))
42, 3syl 14 . . . . 5 (𝜑 → (Base‘𝐾) = (Base‘(ringLMod‘𝐾)))
51, 4eqtrd 2265 . . . 4 (𝜑𝐵 = (Base‘(ringLMod‘𝐾)))
6 lidlpropd.2 . . . . 5 (𝜑𝐵 = (Base‘𝐿))
7 lidlpropdg.l . . . . . 6 (𝜑𝐿𝑌)
8 rlmbasg 14590 . . . . . 6 (𝐿𝑌 → (Base‘𝐿) = (Base‘(ringLMod‘𝐿)))
97, 8syl 14 . . . . 5 (𝜑 → (Base‘𝐿) = (Base‘(ringLMod‘𝐿)))
106, 9eqtrd 2265 . . . 4 (𝜑𝐵 = (Base‘(ringLMod‘𝐿)))
11 lidlpropd.3 . . . 4 (𝜑𝐵𝑊)
12 lidlpropd.4 . . . . 5 ((𝜑 ∧ (𝑥𝑊𝑦𝑊)) → (𝑥(+g𝐾)𝑦) = (𝑥(+g𝐿)𝑦))
13 rlmplusgg 14591 . . . . . . 7 (𝐾𝑋 → (+g𝐾) = (+g‘(ringLMod‘𝐾)))
142, 13syl 14 . . . . . 6 (𝜑 → (+g𝐾) = (+g‘(ringLMod‘𝐾)))
1514oveqdr 6077 . . . . 5 ((𝜑 ∧ (𝑥𝑊𝑦𝑊)) → (𝑥(+g𝐾)𝑦) = (𝑥(+g‘(ringLMod‘𝐾))𝑦))
16 rlmplusgg 14591 . . . . . . 7 (𝐿𝑌 → (+g𝐿) = (+g‘(ringLMod‘𝐿)))
177, 16syl 14 . . . . . 6 (𝜑 → (+g𝐿) = (+g‘(ringLMod‘𝐿)))
1817oveqdr 6077 . . . . 5 ((𝜑 ∧ (𝑥𝑊𝑦𝑊)) → (𝑥(+g𝐿)𝑦) = (𝑥(+g‘(ringLMod‘𝐿))𝑦))
1912, 15, 183eqtr3d 2273 . . . 4 ((𝜑 ∧ (𝑥𝑊𝑦𝑊)) → (𝑥(+g‘(ringLMod‘𝐾))𝑦) = (𝑥(+g‘(ringLMod‘𝐿))𝑦))
20 rlmvscag 14596 . . . . . . 7 (𝐾𝑋 → (.r𝐾) = ( ·𝑠 ‘(ringLMod‘𝐾)))
212, 20syl 14 . . . . . 6 (𝜑 → (.r𝐾) = ( ·𝑠 ‘(ringLMod‘𝐾)))
2221oveqdr 6077 . . . . 5 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(.r𝐾)𝑦) = (𝑥( ·𝑠 ‘(ringLMod‘𝐾))𝑦))
23 lidlpropd.5 . . . . 5 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(.r𝐾)𝑦) ∈ 𝑊)
2422, 23eqeltrrd 2310 . . . 4 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥( ·𝑠 ‘(ringLMod‘𝐾))𝑦) ∈ 𝑊)
25 lidlpropd.6 . . . . 5 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(.r𝐾)𝑦) = (𝑥(.r𝐿)𝑦))
26 rlmvscag 14596 . . . . . . 7 (𝐿𝑌 → (.r𝐿) = ( ·𝑠 ‘(ringLMod‘𝐿)))
277, 26syl 14 . . . . . 6 (𝜑 → (.r𝐿) = ( ·𝑠 ‘(ringLMod‘𝐿)))
2827oveqdr 6077 . . . . 5 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥(.r𝐿)𝑦) = (𝑥( ·𝑠 ‘(ringLMod‘𝐿))𝑦))
2925, 22, 283eqtr3d 2273 . . . 4 ((𝜑 ∧ (𝑥𝐵𝑦𝐵)) → (𝑥( ·𝑠 ‘(ringLMod‘𝐾))𝑦) = (𝑥( ·𝑠 ‘(ringLMod‘𝐿))𝑦))
30 rlmscabas 14595 . . . . . 6 (𝐾𝑋 → (Base‘𝐾) = (Base‘(Scalar‘(ringLMod‘𝐾))))
312, 30syl 14 . . . . 5 (𝜑 → (Base‘𝐾) = (Base‘(Scalar‘(ringLMod‘𝐾))))
321, 31eqtrd 2265 . . . 4 (𝜑𝐵 = (Base‘(Scalar‘(ringLMod‘𝐾))))
33 rlmscabas 14595 . . . . . 6 (𝐿𝑌 → (Base‘𝐿) = (Base‘(Scalar‘(ringLMod‘𝐿))))
347, 33syl 14 . . . . 5 (𝜑 → (Base‘𝐿) = (Base‘(Scalar‘(ringLMod‘𝐿))))
356, 34eqtrd 2265 . . . 4 (𝜑𝐵 = (Base‘(Scalar‘(ringLMod‘𝐿))))
36 rlmfn 14588 . . . . 5 ringLMod Fn V
372elexd 2826 . . . . 5 (𝜑𝐾 ∈ V)
38 funfvex 5686 . . . . . 6 ((Fun ringLMod ∧ 𝐾 ∈ dom ringLMod) → (ringLMod‘𝐾) ∈ V)
3938funfni 5457 . . . . 5 ((ringLMod Fn V ∧ 𝐾 ∈ V) → (ringLMod‘𝐾) ∈ V)
4036, 37, 39sylancr 414 . . . 4 (𝜑 → (ringLMod‘𝐾) ∈ V)
417elexd 2826 . . . . 5 (𝜑𝐿 ∈ V)
42 funfvex 5686 . . . . . 6 ((Fun ringLMod ∧ 𝐿 ∈ dom ringLMod) → (ringLMod‘𝐿) ∈ V)
4342funfni 5457 . . . . 5 ((ringLMod Fn V ∧ 𝐿 ∈ V) → (ringLMod‘𝐿) ∈ V)
4436, 41, 43sylancr 414 . . . 4 (𝜑 → (ringLMod‘𝐿) ∈ V)
455, 10, 11, 19, 24, 29, 32, 35, 40, 44lsspropdg 14566 . . 3 (𝜑 → (LSubSp‘(ringLMod‘𝐾)) = (LSubSp‘(ringLMod‘𝐿)))
46 lidlvalg 14606 . . . 4 (𝐾𝑋 → (LIdeal‘𝐾) = (LSubSp‘(ringLMod‘𝐾)))
472, 46syl 14 . . 3 (𝜑 → (LIdeal‘𝐾) = (LSubSp‘(ringLMod‘𝐾)))
48 lidlvalg 14606 . . . 4 (𝐿𝑌 → (LIdeal‘𝐿) = (LSubSp‘(ringLMod‘𝐿)))
497, 48syl 14 . . 3 (𝜑 → (LIdeal‘𝐿) = (LSubSp‘(ringLMod‘𝐿)))
5045, 47, 493eqtr4d 2275 . 2 (𝜑 → (LIdeal‘𝐾) = (LIdeal‘𝐿))
515, 10, 11, 19, 24, 29, 32, 35, 40, 44lsppropd 14567 . . 3 (𝜑 → (LSpan‘(ringLMod‘𝐾)) = (LSpan‘(ringLMod‘𝐿)))
52 rspvalg 14607 . . . 4 (𝐾𝑋 → (RSpan‘𝐾) = (LSpan‘(ringLMod‘𝐾)))
532, 52syl 14 . . 3 (𝜑 → (RSpan‘𝐾) = (LSpan‘(ringLMod‘𝐾)))
54 rspvalg 14607 . . . 4 (𝐿𝑌 → (RSpan‘𝐿) = (LSpan‘(ringLMod‘𝐿)))
557, 54syl 14 . . 3 (𝜑 → (RSpan‘𝐿) = (LSpan‘(ringLMod‘𝐿)))
5651, 53, 553eqtr4d 2275 . 2 (𝜑 → (RSpan‘𝐾) = (RSpan‘𝐿))
5750, 56jca 306 1 (𝜑 → ((LIdeal‘𝐾) = (LIdeal‘𝐿) ∧ (RSpan‘𝐾) = (RSpan‘𝐿)))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2203  Vcvv 2812  wss 3210   Fn wfn 5346  cfv 5351  (class class class)co 6049  Basecbs 13201  +gcplusg 13279  .rcmulr 13280  Scalarcsca 13282   ·𝑠 cvsca 13283  LSubSpclss 14487  LSpanclspn 14521  ringLModcrglmod 14569  LIdealclidl 14602  RSpancrsp 14603
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-cnex 8214  ax-resscn 8215  ax-1cn 8216  ax-1re 8217  ax-icn 8218  ax-addcl 8219  ax-addrcl 8220  ax-mulcl 8221  ax-addcom 8223  ax-addass 8225  ax-i2m1 8228  ax-0lt1 8229  ax-0id 8231  ax-rnegex 8232  ax-pre-ltirr 8235  ax-pre-lttrn 8237  ax-pre-ltadd 8239
This theorem depends on definitions:  df-bi 117  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-nel 2508  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-id 4413  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-ov 6052  df-oprab 6053  df-mpo 6054  df-pnf 8306  df-mnf 8307  df-ltxr 8309  df-inn 9234  df-2 9292  df-3 9293  df-4 9294  df-5 9295  df-6 9296  df-7 9297  df-8 9298  df-ndx 13204  df-slot 13205  df-base 13207  df-sets 13208  df-iress 13209  df-plusg 13292  df-mulr 13293  df-sca 13295  df-vsca 13296  df-ip 13297  df-lssm 14488  df-lsp 14522  df-sra 14570  df-rgmod 14571  df-lidl 14604  df-rsp 14605
This theorem is referenced by:  crngridl  14665
  Copyright terms: Public domain W3C validator