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

Theorem hbint 1975
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 group(s):   y,A   x,y

Proof of Theorem hbint
StepHypRef Expression
1 ax-17 925 . . . . 5 |- (y e. z -> A.x y e. z)
2 hbint.1 . . . . 5 |- (y e. A -> A.x y e. A)
31, 2hbel 1172 . . . 4 |- (z e. A -> A.x z e. A)
43, 1hbim 702 . . 3 |- ((z e. A -> y e. z) -> A.x(z e. A -> y e. z))
54hbal 700 . 2 |- (A.z(z e. A -> y e. z) -> A.xA.z(z e. A -> y e. z))
6 visset 1350 . . 3 |- y e. V
76elint 1971 . 2 |- (y e. |^|A <-> A.z(z e. A -> y e. z))
87bial 695 . 2 |- (A.x y e. |^|A <-> A.xA.z(z e. A -> y e. z))
95, 7, 83imtr4 192 1 |- (y e. |^|A -> A.x y e. |^|A)
Colors of variables: wff set class
Syntax hints:   -> wi 2  A.wal 672   e. wel 803   e. wcel 1092  |^|cint 1965
This theorem is referenced by:  onminsb 2264  onminex 2275  oawordeulem 3156  unblem2 3432  unblem3 3433  tz9.12lem3 3505  rankid 3516  cardmin 3666  alephordlem1 3677  cardaleph 3690
This theorem was proved from axioms:  ax-1 3  ax-2 4  ax-3 5  ax-mp 6  ax-4 673  ax-5 674  ax-6 675  ax-7 676  ax-gen 677  ax-8 798  ax-9 799  ax-10 800  ax-11 801  ax-12 802  ax-16 922  ax-17 925  ax-ext 1074
This theorem depends on definitions:  df-bi 128  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-int 1966
metamath.org