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

Theorem hbcnv 3295
Description: Bound-variable hypothesis builder for converse.
Hypothesis
Ref Expression
hbcnv.1 |- (y e. A -> A.x y e. A)
Assertion
Ref Expression
hbcnv |- (y e. `'A -> A.x y e. `'A)
Distinct variable groups:   y,A   x,y

Proof of Theorem hbcnv
StepHypRef Expression
1 ax-17 971 . . . . 5 |- (y = <.z, w>. -> A.x y = <.z, w>.)
2 ax-17 971 . . . . . 6 |- (y e. w -> A.x y e. w)
3 hbcnv.1 . . . . . 6 |- (y e. A -> A.x y e. A)
4 ax-17 971 . . . . . 6 |- (y e. z -> A.x y e. z)
52, 3, 4hbbr 2658 . . . . 5 |- (wAz -> A.x wAz)
61, 5hban 1009 . . . 4 |- ((y = <.z, w>. /\ wAz) -> A.x(y = <.z, w>. /\ wAz))
76hbex 1006 . . 3 |- (E.w(y = <.z, w>. /\ wAz) -> A.xE.w(y = <.z, w>. /\ wAz))
87hbex 1006 . 2 |- (E.zE.w(y = <.z, w>. /\ wAz) -> A.xE.zE.w(y = <.z, w>. /\ wAz))
9 elcnv 3293 . 2 |- (y e. `'A <-> E.zE.w(y = <.z, w>. /\ wAz))
109albii 999 . 2 |- (A.x y e. `'A <-> A.xE.zE.w(y = <.z, w>. /\ wAz))
118, 9, 103imtr4 219 1 |- (y e. `'A -> A.x y e. `'A)
Colors of variables: wff set class
Syntax hints:   -> wi 3   /\ wa 223  A.wal 954   = wceq 956   e. wcel 958  E.wex 980  <.cop 2411   class class class wbr 2619  `'ccnv 3169
This theorem is referenced by:  hbdm 3352  hbfun 3536  hbf1 3663  cnvtr 10638
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 962  ax-gen 963  ax-8 964  ax-10 966  ax-11 967  ax-12 968  ax-13 969  ax-14 970  ax-17 971  ax-4 973  ax-5o 975  ax-6o 978  ax-9o 1123  ax-10o 1140  ax-16 1210  ax-11o 1218  ax-ext 1459  ax-sep 2703  ax-pow 2742  ax-pr 2779
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 981  df-sb 1172  df-eu 1382  df-mo 1383  df-clab 1464  df-cleq 1469  df-clel 1472  df-ne 1587  df-v 1812  df-dif 2049  df-un 2050  df-in 2051  df-ss 2053  df-nul 2281  df-pw 2402  df-sn 2412  df-pr 2413  df-op 2416  df-br 2620  df-opab 2667  df-cnv 3186
Copyright terms: Public domain