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

Theorem ixpsnbasval 14395
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 6818 . . 3 (𝑋𝑊X𝑥 ∈ {𝑋} (Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)) = {𝑓 ∣ (𝑓 Fn {𝑋} ∧ (𝑓𝑋) ∈ 𝑋 / 𝑥(Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)))})
21adantl 277 . 2 ((𝑅𝑉𝑋𝑊) → X𝑥 ∈ {𝑋} (Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)) = {𝑓 ∣ (𝑓 Fn {𝑋} ∧ (𝑓𝑋) ∈ 𝑋 / 𝑥(Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)))})
3 rlmfn 14382 . . . . . . . . . . . 12 ringLMod Fn V
4 elex 2791 . . . . . . . . . . . 12 (𝑅𝑉𝑅 ∈ V)
5 funfvex 5620 . . . . . . . . . . . . 13 ((Fun ringLMod ∧ 𝑅 ∈ dom ringLMod) → (ringLMod‘𝑅) ∈ V)
65funfni 5399 . . . . . . . . . . . 12 ((ringLMod Fn V ∧ 𝑅 ∈ V) → (ringLMod‘𝑅) ∈ V)
73, 4, 6sylancr 414 . . . . . . . . . . 11 (𝑅𝑉 → (ringLMod‘𝑅) ∈ V)
87anim1ci 341 . . . . . . . . . 10 ((𝑅𝑉𝑋𝑊) → (𝑋𝑊 ∧ (ringLMod‘𝑅) ∈ V))
9 xpsng 5783 . . . . . . . . . 10 ((𝑋𝑊 ∧ (ringLMod‘𝑅) ∈ V) → ({𝑋} × {(ringLMod‘𝑅)}) = {⟨𝑋, (ringLMod‘𝑅)⟩})
108, 9syl 14 . . . . . . . . 9 ((𝑅𝑉𝑋𝑊) → ({𝑋} × {(ringLMod‘𝑅)}) = {⟨𝑋, (ringLMod‘𝑅)⟩})
1110fveq1d 5605 . . . . . . . 8 ((𝑅𝑉𝑋𝑊) → (({𝑋} × {(ringLMod‘𝑅)})‘𝑋) = ({⟨𝑋, (ringLMod‘𝑅)⟩}‘𝑋))
12 fvsng 5808 . . . . . . . . 9 ((𝑋𝑊 ∧ (ringLMod‘𝑅) ∈ V) → ({⟨𝑋, (ringLMod‘𝑅)⟩}‘𝑋) = (ringLMod‘𝑅))
138, 12syl 14 . . . . . . . 8 ((𝑅𝑉𝑋𝑊) → ({⟨𝑋, (ringLMod‘𝑅)⟩}‘𝑋) = (ringLMod‘𝑅))
1411, 13eqtrd 2242 . . . . . . 7 ((𝑅𝑉𝑋𝑊) → (({𝑋} × {(ringLMod‘𝑅)})‘𝑋) = (ringLMod‘𝑅))
1514fveq2d 5607 . . . . . 6 ((𝑅𝑉𝑋𝑊) → (Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑋)) = (Base‘(ringLMod‘𝑅)))
16 csbfv2g 5642 . . . . . . . 8 (𝑋𝑊𝑋 / 𝑥(Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)) = (Base‘𝑋 / 𝑥(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)))
17 csbfvg 5643 . . . . . . . . 9 (𝑋𝑊𝑋 / 𝑥(({𝑋} × {(ringLMod‘𝑅)})‘𝑥) = (({𝑋} × {(ringLMod‘𝑅)})‘𝑋))
1817fveq2d 5607 . . . . . . . 8 (𝑋𝑊 → (Base‘𝑋 / 𝑥(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)) = (Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑋)))
1916, 18eqtrd 2242 . . . . . . 7 (𝑋𝑊𝑋 / 𝑥(Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)) = (Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑋)))
2019adantl 277 . . . . . 6 ((𝑅𝑉𝑋𝑊) → 𝑋 / 𝑥(Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)) = (Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑋)))
21 rlmbasg 14384 . . . . . . 7 (𝑅𝑉 → (Base‘𝑅) = (Base‘(ringLMod‘𝑅)))
2221adantr 276 . . . . . 6 ((𝑅𝑉𝑋𝑊) → (Base‘𝑅) = (Base‘(ringLMod‘𝑅)))
2315, 20, 223eqtr4d 2252 . . . . 5 ((𝑅𝑉𝑋𝑊) → 𝑋 / 𝑥(Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)) = (Base‘𝑅))
2423eleq2d 2279 . . . 4 ((𝑅𝑉𝑋𝑊) → ((𝑓𝑋) ∈ 𝑋 / 𝑥(Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)) ↔ (𝑓𝑋) ∈ (Base‘𝑅)))
2524anbi2d 464 . . 3 ((𝑅𝑉𝑋𝑊) → ((𝑓 Fn {𝑋} ∧ (𝑓𝑋) ∈ 𝑋 / 𝑥(Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥))) ↔ (𝑓 Fn {𝑋} ∧ (𝑓𝑋) ∈ (Base‘𝑅))))
2625abbidv 2327 . 2 ((𝑅𝑉𝑋𝑊) → {𝑓 ∣ (𝑓 Fn {𝑋} ∧ (𝑓𝑋) ∈ 𝑋 / 𝑥(Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)))} = {𝑓 ∣ (𝑓 Fn {𝑋} ∧ (𝑓𝑋) ∈ (Base‘𝑅))})
272, 26eqtrd 2242 1 ((𝑅𝑉𝑋𝑊) → X𝑥 ∈ {𝑋} (Base‘(({𝑋} × {(ringLMod‘𝑅)})‘𝑥)) = {𝑓 ∣ (𝑓 Fn {𝑋} ∧ (𝑓𝑋) ∈ (Base‘𝑅))})
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1375  wcel 2180  {cab 2195  Vcvv 2779  csb 3104  {csn 3646  cop 3649   × cxp 4694   Fn wfn 5289  cfv 5294  Xcixp 6815  Basecbs 12998  ringLModcrglmod 14363
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 617  ax-in2 618  ax-io 713  ax-5 1473  ax-7 1474  ax-gen 1475  ax-ie1 1519  ax-ie2 1520  ax-8 1530  ax-10 1531  ax-11 1532  ax-i12 1533  ax-bndl 1535  ax-4 1536  ax-17 1552  ax-i9 1556  ax-ial 1560  ax-i5r 1561  ax-13 2182  ax-14 2183  ax-ext 2191  ax-coll 4178  ax-sep 4181  ax-pow 4237  ax-pr 4272  ax-un 4501  ax-setind 4606  ax-cnex 8058  ax-resscn 8059  ax-1cn 8060  ax-1re 8061  ax-icn 8062  ax-addcl 8063  ax-addrcl 8064  ax-mulcl 8065  ax-addcom 8067  ax-addass 8069  ax-i2m1 8072  ax-0lt1 8073  ax-0id 8075  ax-rnegex 8076  ax-pre-ltirr 8079  ax-pre-lttrn 8081  ax-pre-ltadd 8083
This theorem depends on definitions:  df-bi 117  df-3an 985  df-tru 1378  df-fal 1381  df-nf 1487  df-sb 1789  df-eu 2060  df-mo 2061  df-clab 2196  df-cleq 2202  df-clel 2205  df-nfc 2341  df-ne 2381  df-nel 2476  df-ral 2493  df-rex 2494  df-reu 2495  df-rab 2497  df-v 2781  df-sbc 3009  df-csb 3105  df-dif 3179  df-un 3181  df-in 3183  df-ss 3190  df-nul 3472  df-pw 3631  df-sn 3652  df-pr 3653  df-op 3655  df-uni 3868  df-int 3903  df-iun 3946  df-br 4063  df-opab 4125  df-mpt 4126  df-id 4361  df-xp 4702  df-rel 4703  df-cnv 4704  df-co 4705  df-dm 4706  df-rn 4707  df-res 4708  df-ima 4709  df-iota 5254  df-fun 5296  df-fn 5297  df-f 5298  df-f1 5299  df-fo 5300  df-f1o 5301  df-fv 5302  df-ov 5977  df-oprab 5978  df-mpo 5979  df-ixp 6816  df-pnf 8151  df-mnf 8152  df-ltxr 8154  df-inn 9079  df-2 9137  df-3 9138  df-4 9139  df-5 9140  df-6 9141  df-7 9142  df-8 9143  df-ndx 13001  df-slot 13002  df-base 13004  df-sets 13005  df-iress 13006  df-mulr 13090  df-sca 13092  df-vsca 13093  df-ip 13094  df-sra 14364  df-rgmod 14365
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator