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

Theorem hbneg 5342
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 5338 . 2 |- -uA = (0 - A)
2 ax-17 969 . . 3 |- (y e. 0 -> A.x y e. 0)
3 ax-17 969 . . 3 |- (y e. - -> A.x y e. - )
4 hbneg.1 . . 3 |- (y e. A -> A.x y e. A)
52, 3, 4hbopr 3972 . 2 |- (y e. (0 - A) -> A.x y e. (0 - A))
61, 5hbxfr 1560 1 |- (y e. -uA -> A.x y e. -uA)
Colors of variables: wff set class
Syntax hints:   -> wi 3  A.wal 952   e. wcel 956  (class class class)co 3954  0cc0 5214   - cmin 5272  -ucneg 5273
This theorem is referenced by:  hbnegd 5343  csbnegg 5344  reuunineg 6021  infcvgaux1 7162
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-10 964  ax-11 965  ax-12 966  ax-13 967  ax-14 968  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457  ax-sep 2698  ax-pow 2737  ax-pr 2774
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 979  df-sb 1170  df-eu 1380  df-mo 1381  df-clab 1462  df-cleq 1467  df-clel 1470  df-ne 1584  df-rex 1647  df-v 1808  df-dif 2045  df-un 2046  df-in 2047  df-ss 2049  df-nul 2277  df-pw 2398  df-sn 2408  df-pr 2409  df-op 2412  df-uni 2499  df-br 2615  df-opab 2662  df-xp 3179  df-cnv 3181  df-dm 3183  df-rn 3184  df-res 3185  df-ima 3186  df-fv 3193  df-opr 3956  df-neg 5338
Copyright terms: Public domain