ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  hbxfreq Unicode version

Theorem hbxfreq 2313
Description: A utility lemma to transfer a bound-variable hypothesis builder into a definition. See hbxfrbi 1496 for equivalence version. (Contributed by NM, 21-Aug-2007.)
Hypotheses
Ref Expression
hbxfr.1  |-  A  =  B
hbxfr.2  |-  ( y  e.  B  ->  A. x  y  e.  B )
Assertion
Ref Expression
hbxfreq  |-  ( y  e.  A  ->  A. x  y  e.  A )

Proof of Theorem hbxfreq
StepHypRef Expression
1 hbxfr.1 . . 3  |-  A  =  B
21eleq2i 2273 . 2  |-  ( y  e.  A  <->  y  e.  B )
3 hbxfr.2 . 2  |-  ( y  e.  B  ->  A. x  y  e.  B )
42, 3hbxfrbi 1496 1  |-  ( y  e.  A  ->  A. x  y  e.  A )
Colors of variables: wff set class
Syntax hints:    -> wi 4   A.wal 1371    = wceq 1373    e. wcel 2177
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-5 1471  ax-gen 1473  ax-ie1 1517  ax-ie2 1518  ax-4 1534  ax-17 1550  ax-ial 1558  ax-ext 2188
This theorem depends on definitions:  df-bi 117  df-cleq 2199  df-clel 2202
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator