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

Theorem ixpsnbasval 14601
Description: The value of an infinite Cartesian product of the base of a left module over a ring with a singleton. (Contributed by AV, 3-Dec-2018.)
Assertion
Ref Expression
ixpsnbasval ((𝑅𝑉𝑋𝑊) → X𝑥 ∈ {𝑋} (Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)) = {𝑓 ∣ (𝑓 Fn {𝑋} ∧ (𝑓𝑋) ∈ (Base‘𝑅))})
Distinct variable groups:   𝑅,𝑓,𝑥   𝑓,𝑉   𝑓,𝑊   𝑓,𝑋,𝑥
Allowed substitution hints:   𝑉(𝑥)   𝑊(𝑥)

Proof of Theorem ixpsnbasval
StepHypRef Expression
1 ixpsnval 6935 . . 3 (𝑋𝑊X𝑥 ∈ {𝑋} (Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)) = {𝑓 ∣ (𝑓 Fn {𝑋} ∧ (𝑓𝑋) ∈ 𝑋 / 𝑥(Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)))})
21adantl 277 . 2 ((𝑅𝑉𝑋𝑊) → X𝑥 ∈ {𝑋} (Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)) = {𝑓 ∣ (𝑓 Fn {𝑋} ∧ (𝑓𝑋) ∈ 𝑋 / 𝑥(Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)))})
3 rlmfn 14588 . . . . . . . . . . . 12 ringLMod Fn V
4 elex 2824 . . . . . . . . . . . 12 (𝑅𝑉𝑅 ∈ V)
5 funfvex 5686 . . . . . . . . . . . . 13 ((Fun ringLMod ∧ 𝑅 ∈ dom ringLMod) → (ringLMod‘𝑅) ∈ V)
65funfni 5457 . . . . . . . . . . . 12 ((ringLMod Fn V ∧ 𝑅 ∈ V) → (ringLMod‘𝑅) ∈ V)
73, 4, 6sylancr 414 . . . . . . . . . . 11 (𝑅𝑉 → (ringLMod‘𝑅) ∈ V)
87anim1ci 341 . . . . . . . . . 10 ((𝑅𝑉𝑋𝑊) → (𝑋𝑊 ∧ (ringLMod‘𝑅) ∈ V))
9 xpsng 5852 . . . . . . . . . 10 ((𝑋𝑊 ∧ (ringLMod‘𝑅) ∈ V) → ({𝑋} × {(ringLMod‘𝑅)}) = {⟨𝑋, (ringLMod‘𝑅)⟩})
108, 9syl 14 . . . . . . . . 9 ((𝑅𝑉𝑋𝑊) → ({𝑋} × {(ringLMod‘𝑅)}) = {⟨𝑋, (ringLMod‘𝑅)⟩})
1110fveq1d 5671 . . . . . . . 8 ((𝑅𝑉𝑋𝑊) → (({𝑋} × {(ringLMod‘𝑅)})‘𝑋) = ({⟨𝑋, (ringLMod‘𝑅)⟩}‘𝑋))
12 fvsng 5879 . . . . . . . . 9 ((𝑋𝑊 ∧ (ringLMod‘𝑅) ∈ V) → ({⟨𝑋, (ringLMod‘𝑅)⟩}‘𝑋) = (ringLMod‘𝑅))
138, 12syl 14 . . . . . . . 8 ((𝑅𝑉𝑋𝑊) → ({⟨𝑋, (ringLMod‘𝑅)⟩}‘𝑋) = (ringLMod‘𝑅))
1411, 13eqtrd 2265 . . . . . . 7 ((𝑅𝑉𝑋𝑊) → (({𝑋} × {(ringLMod‘𝑅)})‘𝑋) = (ringLMod‘𝑅))
1514fveq2d 5673 . . . . . 6 ((𝑅𝑉𝑋𝑊) → (Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑋)) = (Base‘(ringLMod‘𝑅)))
16 csbfv2g 5710 . . . . . . . 8 (𝑋𝑊𝑋 / 𝑥(Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)) = (Base‘𝑋 / 𝑥(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)))
17 csbfvg 5711 . . . . . . . . 9 (𝑋𝑊𝑋 / 𝑥(({𝑋} × {(ringLMod‘𝑅)})‘𝑥) = (({𝑋} × {(ringLMod‘𝑅)})‘𝑋))
1817fveq2d 5673 . . . . . . . 8 (𝑋𝑊 → (Base‘𝑋 / 𝑥(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)) = (Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑋)))
1916, 18eqtrd 2265 . . . . . . 7 (𝑋𝑊𝑋 / 𝑥(Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)) = (Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑋)))
2019adantl 277 . . . . . 6 ((𝑅𝑉𝑋𝑊) → 𝑋 / 𝑥(Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)) = (Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑋)))
21 rlmbasg 14590 . . . . . . 7 (𝑅𝑉 → (Base‘𝑅) = (Base‘(ringLMod‘𝑅)))
2221adantr 276 . . . . . 6 ((𝑅𝑉𝑋𝑊) → (Base‘𝑅) = (Base‘(ringLMod‘𝑅)))
2315, 20, 223eqtr4d 2275 . . . . 5 ((𝑅𝑉𝑋𝑊) → 𝑋 / 𝑥(Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)) = (Base‘𝑅))
2423eleq2d 2302 . . . 4 ((𝑅𝑉𝑋𝑊) → ((𝑓𝑋) ∈ 𝑋 / 𝑥(Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)) ↔ (𝑓𝑋) ∈ (Base‘𝑅)))
2524anbi2d 464 . . 3 ((𝑅𝑉𝑋𝑊) → ((𝑓 Fn {𝑋} ∧ (𝑓𝑋) ∈ 𝑋 / 𝑥(Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥))) ↔ (𝑓 Fn {𝑋} ∧ (𝑓𝑋) ∈ (Base‘𝑅))))
2625abbidv 2352 . 2 ((𝑅𝑉𝑋𝑊) → {𝑓 ∣ (𝑓 Fn {𝑋} ∧ (𝑓𝑋) ∈ 𝑋 / 𝑥(Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)))} = {𝑓 ∣ (𝑓 Fn {𝑋} ∧ (𝑓𝑋) ∈ (Base‘𝑅))})
272, 26eqtrd 2265 1 ((𝑅𝑉𝑋𝑊) → X𝑥 ∈ {𝑋} (Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)) = {𝑓 ∣ (𝑓 Fn {𝑋} ∧ (𝑓𝑋) ∈ (Base‘𝑅))})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2203  {cab 2218  Vcvv 2812  csb 3137  {csn 3688  cop 3691   × cxp 4746   Fn wfn 5346  cfv 5351  Xcixp 6932  Basecbs 13201  ringLModcrglmod 14569
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-ixp 6933  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-mulr 13293  df-sca 13295  df-vsca 13296  df-ip 13297  df-sra 14570  df-rgmod 14571
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator