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

Theorem elimph 8475
Description: Hypothesis elimination lemma for complex inner product spaces to assist weak deduction theorem.
Hypotheses
Ref Expression
elimph.1 |- X = (Base` U)
elimph.5 |- Z = (0v` U)
elimph.6 |- U e. CPreHil
Assertion
Ref Expression
elimph |- if(A e. X, A, Z) e. X

Proof of Theorem elimph
StepHypRef Expression
1 elimph.1 . 2 |- X = (Base` U)
2 elimph.5 . 2 |- Z = (0v` U)
3 elimph.6 . . 3 |- U e. CPreHil
43phnvi 8471 . 2 |- U e. NrmCVec
51, 2, 4elimnv 8310 1 |- if(A e. X, A, Z) e. X
Colors of variables: wff set class
Syntax hints:   = wceq 958   e. wcel 960  ifcif 2365  ` cfv 3188  Basecba 8201  0vcn0v 8203  CPreHilcphl 8467
This theorem is referenced by:  ipdiri 8485  ipassi 8497  sii 8510
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 964  ax-gen 965  ax-8 966  ax-9 967  ax-10 968  ax-11 969  ax-12 970  ax-13 971  ax-14 972  ax-17 973  ax-4 975  ax-5o 977  ax-6o 980  ax-9o 1125  ax-10o 1142  ax-16 1212  ax-11o 1220  ax-ext 1462  ax-sep 2708  ax-nul 2715  ax-pow 2748  ax-pr 2785  ax-un 2872
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-3an 779  df-ex 983  df-sb 1174  df-eu 1384  df-mo 1385  df-clab 1467  df-cleq 1472  df-clel 1475  df-ne 1590  df-ral 1652  df-rex 1653  df-reu 1654  df-rab 1655  df-v 1815  df-sbc 1945  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-if 2366  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-uni 2508  df-br 2625  df-opab 2672  df-id 2841  df-xp 3190  df-rel 3191  df-cnv 3192  df-co 3193  df-dm 3194  df-rn 3195  df-res 3196  df-ima 3197  df-fun 3198  df-fn 3199  df-f 3200  df-fo 3202  df-fv 3204  df-opr 3971  df-oprab 3972  df-1st 4085  df-2nd 4086  df-grp 8034  df-gid 8035  df-abl 8096  df-vc 8161  df-nv 8207  df-va 8210  df-ba 8211  df-sm 8212  df-0v 8213  df-nm 8215  df-ph 8468
Copyright terms: Public domain