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

Theorem hbint 2543
Description: Bound-variable hypothesis builder for intersection.
Hypothesis
Ref Expression
hbint.1 |- (y e. A -> A.x y e. A)
Assertion
Ref Expression
hbint |- (y e. |^|A -> A.x y e. |^|A)
Distinct variable groups:   y,A   x,y

Proof of Theorem hbint
StepHypRef Expression
1 ax-17 971 . . . . 5 |- (y e. z -> A.x y e. z)
2 hbint.1 . . . . 5 |- (y e. A -> A.x y e. A)
31, 2hbel 1566 . . . 4 |- (z e. A -> A.x z e. A)
43, 1hbim 1007 . . 3 |- ((z e. A -> y e. z) -> A.x(z e. A -> y e. z))
54hbal 1005 . 2 |- (A.z(z e. A -> y e. z) -> A.xA.z(z e. A -> y e. z))
6 visset 1813 . . 3 |- y e. V
76elint 2539 . 2 |- (y e. |^|A <-> A.z(z e. A -> y e. z))
87albii 999 . 2 |- (A.x y e. |^|A <-> A.xA.z(z e. A -> y e. z))
95, 7, 83imtr4 219 1 |- (y e. |^|A -> A.x y e. |^|A)
Colors of variables: wff set class
Syntax hints:   -> wi 3  A.wal 954   e. wcel 958  |^|cint 2533
This theorem is referenced by:  intab 2560  onminsb 3009  onminex 3020  oawordeulem 4188  unblem2 4541  unblem3 4542  tz9.12lem3 4661  rankid 4672  cardmin 4860  alephordlem1 4872  cardaleph 4885
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-12 968  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
This theorem depends on definitions:  df-bi 147  df-an 225  df-ex 981  df-sb 1172  df-clab 1464  df-cleq 1469  df-clel 1472  df-v 1812  df-int 2534
Copyright terms: Public domain