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

Theorem scafeqg 13403
Description: If the scalar multiplication operation is already a function, the functionalization of it is equal to the original operation. (Contributed by Mario Carneiro, 5-Oct-2015.)
Hypotheses
Ref Expression
scaffval.b 𝐡 = (Baseβ€˜π‘Š)
scaffval.f 𝐹 = (Scalarβ€˜π‘Š)
scaffval.k 𝐾 = (Baseβ€˜πΉ)
scaffval.a βˆ™ = ( Β·sf β€˜π‘Š)
scaffval.s Β· = ( ·𝑠 β€˜π‘Š)
Assertion
Ref Expression
scafeqg ((π‘Š ∈ 𝑉 ∧ Β· Fn (𝐾 Γ— 𝐡)) β†’ βˆ™ = Β· )

Proof of Theorem scafeqg
Dummy variables π‘₯ 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 scaffval.b . . . 4 𝐡 = (Baseβ€˜π‘Š)
2 scaffval.f . . . 4 𝐹 = (Scalarβ€˜π‘Š)
3 scaffval.k . . . 4 𝐾 = (Baseβ€˜πΉ)
4 scaffval.a . . . 4 βˆ™ = ( Β·sf β€˜π‘Š)
5 scaffval.s . . . 4 Β· = ( ·𝑠 β€˜π‘Š)
61, 2, 3, 4, 5scaffvalg 13401 . . 3 (π‘Š ∈ 𝑉 β†’ βˆ™ = (π‘₯ ∈ 𝐾, 𝑦 ∈ 𝐡 ↦ (π‘₯ Β· 𝑦)))
76adantr 276 . 2 ((π‘Š ∈ 𝑉 ∧ Β· Fn (𝐾 Γ— 𝐡)) β†’ βˆ™ = (π‘₯ ∈ 𝐾, 𝑦 ∈ 𝐡 ↦ (π‘₯ Β· 𝑦)))
8 fnovim 5985 . . 3 ( Β· Fn (𝐾 Γ— 𝐡) β†’ Β· = (π‘₯ ∈ 𝐾, 𝑦 ∈ 𝐡 ↦ (π‘₯ Β· 𝑦)))
98adantl 277 . 2 ((π‘Š ∈ 𝑉 ∧ Β· Fn (𝐾 Γ— 𝐡)) β†’ Β· = (π‘₯ ∈ 𝐾, 𝑦 ∈ 𝐡 ↦ (π‘₯ Β· 𝑦)))
107, 9eqtr4d 2213 1 ((π‘Š ∈ 𝑉 ∧ Β· Fn (𝐾 Γ— 𝐡)) β†’ βˆ™ = Β· )
Colors of variables: wff set class
Syntax hints:   β†’ wi 4   ∧ wa 104   = wceq 1353   ∈ wcel 2148   Γ— cxp 4626   Fn wfn 5213  β€˜cfv 5218  (class class class)co 5877   ∈ cmpo 5879  Basecbs 12464  Scalarcsca 12541   ·𝑠 cvsca 12542   Β·sf cscaf 13383
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-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535  ax-13 2150  ax-14 2151  ax-ext 2159  ax-coll 4120  ax-sep 4123  ax-pow 4176  ax-pr 4211  ax-un 4435  ax-cnex 7904  ax-resscn 7905  ax-1re 7907  ax-addrcl 7910
This theorem depends on definitions:  df-bi 117  df-3an 980  df-tru 1356  df-nf 1461  df-sb 1763  df-eu 2029  df-mo 2030  df-clab 2164  df-cleq 2170  df-clel 2173  df-nfc 2308  df-ral 2460  df-rex 2461  df-reu 2462  df-rab 2464  df-v 2741  df-sbc 2965  df-csb 3060  df-un 3135  df-in 3137  df-ss 3144  df-pw 3579  df-sn 3600  df-pr 3601  df-op 3603  df-uni 3812  df-int 3847  df-iun 3890  df-br 4006  df-opab 4067  df-mpt 4068  df-id 4295  df-xp 4634  df-rel 4635  df-cnv 4636  df-co 4637  df-dm 4638  df-rn 4639  df-res 4640  df-ima 4641  df-iota 5180  df-fun 5220  df-fn 5221  df-f 5222  df-f1 5223  df-fo 5224  df-f1o 5225  df-fv 5226  df-ov 5880  df-oprab 5881  df-mpo 5882  df-1st 6143  df-2nd 6144  df-inn 8922  df-2 8980  df-3 8981  df-4 8982  df-5 8983  df-ndx 12467  df-slot 12468  df-base 12470  df-sca 12554  df-scaf 13385
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator