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

Theorem hbneg 5374
Description: Bound-variable hypothesis builder for the negative of a complex number.
Hypothesis
Ref Expression
hbneg.1 |- (y e. A -> A.x y e. A)
Assertion
Ref Expression
hbneg |- (y e. -uA -> A.x y e. -uA)
Distinct variable groups:   y,A   x,y

Proof of Theorem hbneg
StepHypRef Expression
1 df-neg 5370 . 2 |- -uA = (0 - A)
2 ax-17 973 . . 3 |- (y e. 0 -> A.x y e. 0)
3 ax-17 973 . . 3 |- (y e. - -> A.x y e. - )
4 hbneg.1 . . 3 |- (y e. A -> A.x y e. A)
52, 3, 4hbopr 3987 . 2 |- (y e. (0 - A) -> A.x y e. (0 - A))
61, 5hbxfr 1566 1 |- (y e. -uA -> A.x y e. -uA)
Colors of variables: wff set class
Syntax hints:   -> wi 3  A.wal 956   e. wcel 960  (class class class)co 3969  0cc0 5246   - cmin 5304  -ucneg 5305
This theorem is referenced by:  hbnegd 5375  csbnegg 5376  reuunineg 6068  infcvgaux1 7219
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-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-pow 2748  ax-pr 2785
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  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-rex 1653  df-v 1815  df-dif 2052  df-un 2053  df-in 2054  df-ss 2056  df-nul 2284  df-pw 2406  df-sn 2416  df-pr 2417  df-op 2420  df-uni 2508  df-br 2625  df-opab 2672  df-xp 3190  df-cnv 3192  df-dm 3194  df-rn 3195  df-res 3196  df-ima 3197  df-fv 3204  df-opr 3971  df-neg 5370
Copyright terms: Public domain