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

Theorem hbop 1879
Description: Bound-variable hypothesis builder for ordered pairs.
Hypotheses
Ref Expression
hbop.1 |- (y e. A -> A.x y e. A)
hbop.2 |- (y e. B -> A.x y e. B)
Assertion
Ref Expression
hbop |- (y e. <.A, B>. -> A.x y e. <.A, B>.)
Distinct variable group(s):   y,A   y,B   x,y

Proof of Theorem hbop
StepHypRef Expression
1 hbop.1 . . . 4 |- (y e. A -> A.x y e. A)
21hbsn 1833 . . 3 |- (y e. {A} -> A.x y e. {A})
3 hbop.2 . . . 4 |- (y e. B -> A.x y e. B)
41, 3hbpr 1824 . . 3 |- (y e. {A, B} -> A.x y e. {A, B})
52, 4hbpr 1824 . 2 |- (y e. {{A}, {A, B}} -> A.x y e. {{A}, {A, B}})
6 df-op 1815 . . 3 |- <.A, B>. = {{A}, {A, B}}
76eleq2i 1153 . 2 |- (y e. <.A, B>. <-> y e. {{A}, {A, B}})
87bial 695 . 2 |- (A.x y e. <.A, B>. <-> A.x y e. {{A}, {A, B}})
95, 7, 83imtr4 192 1 |- (y e. <.A, B>. -> A.x y e. <.A, B>.)
Colors of variables: wff set class
Syntax hints:   -> wi 2  A.wal 672   e. wcel 1092  {csn 1808  {cpr 1809  <.cop 1810
This theorem is referenced by:  moop2 1910  hbbr 2095  hbima 2609  hbopr 3017  xpmapenlem1 3391  seqlem1 4662
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-or 197  df-an 198  df-ex 679  df-sb 853  df-clab 1093  df-cleq 1097  df-clel 1099  df-v 1349  df-un 1490  df-sn 1811  df-pr 1812  df-op 1815
metamath.org