HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem vcid 9502
Description: Identity element for the scalar product of a complex vector space.
Hypotheses
Ref Expression
vci.1 |- G = (1st` W)
vci.2 |- S = (2nd` W)
vci.3 |- X = ran G
Assertion
Ref Expression
vcid |- ((W e. CVec /\ A e. X) -> (1SA) = A)

Proof of Theorem vcid
StepHypRef Expression
1 opreq2 4890 . . . 4 |- (x = A -> (1Sx) = (1SA))
2 id 73 . . . 4 |- (x = A -> x = A)
31, 2eqeq12d 1899 . . 3 |- (x = A -> ((1Sx) = x <-> (1SA) = A))
43rcla4cva 2379 . 2 |- ((A.x e. X (1Sx) = x /\ A e. X) -> (1SA) = A)
5 vci.1 . . . 4 |- G = (1st` W)
6 vci.2 . . . 4 |- S = (2nd` W)
7 vci.3 . . . 4 |- X = ran G
85, 6, 7vci 9499 . . 3 |- (W e. CVec -> (G e. Abel /\ S:(CC X. X)-->X /\ A.x e. X ((1Sx) = x /\ A.y e. CC (A.z e. X (yS(xGz)) = ((ySx)G(ySz)) /\ A.z e. CC (((y + z)Sx) = ((ySx)G(zSx)) /\ ((y x. z)Sx) = (yS(zSx)))))))
9 simpl 346 . . . . 5 |- (((1Sx) = x /\ A.y e. CC (A.z e. X (yS(xGz)) = ((ySx)G(ySz)) /\ A.z e. CC (((y + z)Sx) = ((ySx)G(zSx)) /\ ((y x. z)Sx) = (yS(zSx))))) -> (1Sx) = x)
109ralimi 2168 . . . 4 |- (A.x e. X ((1Sx) = x /\ A.y e. CC (A.z e. X (yS(xGz)) = ((ySx)G(ySz)) /\ A.z e. CC (((y + z)Sx) = ((ySx)G(zSx)) /\ ((y x. z)Sx) = (yS(zSx))))) -> A.x e. X (1Sx) = x)
11103ad2ant3 899 . . 3 |- ((G e. Abel /\ S:(CC X. X)-->X /\ A.x e. X ((1Sx) = x /\ A.y e. CC (A.z e. X (yS(xGz)) = ((ySx)G(ySz)) /\ A.z e. CC (((y + z)Sx) = ((ySx)G(zSx)) /\ ((y x. z)Sx) = (yS(zSx)))))) -> A.x e. X (1Sx) = x)
128, 11syl 12 . 2 |- (W e. CVec -> A.x e. X (1Sx) = x)
134, 12sylan 497 1 |- ((W e. CVec /\ A e. X) -> (1SA) = A)
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 240   /\ w3a 858   = wceq 1298   e. wcel 1300  A.wral 2105   X. cxp 3984  ran crn 3987  -->wf 3994  ` cfv 3998  (class class class)co 4884  1stc1st 5018  2ndc2nd 5019  CCcc 6384  1c1 6387   + caddc 6389   x. cmul 6391  Abelcabl 9407  CVeccvc 9496
This theorem is referenced by:  vc2 9506  vc0 9520  vcm 9522  vcnegneg 9525  vcoprne 9530  nvsid 9580
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-13 1311  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-sep 3438  ax-nul 3445  ax-pow 3481  ax-pr 3524  ax-un 3790
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-3an 860  df-ex 1327  df-sb 1536  df-eu 1775  df-mo 1776  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-ral 2109  df-rex 2110  df-v 2294  df-dif 2597  df-un 2600  df-in 2603  df-ss 2605  df-nul 2876  df-pw 3035  df-sn 3049  df-pr 3050  df-op 3053  df-uni 3178  df-br 3339  df-opab 3396  df-id 3586  df-xp 4000  df-rel 4001  df-cnv 4002  df-co 4003  df-dm 4004  df-rn 4005  df-res 4006  df-ima 4007  df-fun 4008  df-fn 4009  df-f 4010  df-fv 4014  df-opr 4886  df-1st 5020  df-2nd 5021  df-vc 9497
Copyright terms: Public domain