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

Theorem hbop 2561
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 groups:   y,A   y,B   x,y

Proof of Theorem hbop
StepHypRef Expression
1 df-op 2474 . 2 |- <.A, B>. = {{A}, {A, B}}
2 hbop.1 . . . 4 |- (y e. A -> A.x y e. A)
32hbsn 2499 . . 3 |- (y e. {A} -> A.x y e. {A})
4 hbop.2 . . . 4 |- (y e. B -> A.x y e. B)
52, 4hbpr 2484 . . 3 |- (y e. {A, B} -> A.x y e. {A, B})
63, 5hbpr 2484 . 2 |- (y e. {{A}, {A, B}} -> A.x y e. {{A}, {A, B}})
71, 6hbxfr 1606 1 |- (y e. <.A, B>. -> A.x y e. <.A, B>.)
Colors of variables: wff set class
Syntax hints:   -> wi 3  A.wal 990   e. wcel 994  {csn 2467  {cpr 2468  <.cop 2469
This theorem is referenced by:  hbopd 2562  hbbr 2731  moop2 2878  hbima 3503  hbopr 4039  iunfoprab 4192  xpmapenlem1 4643  seq1lem1 6674
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 998  ax-gen 999  ax-8 1000  ax-10 1002  ax-12 1004  ax-17 1007  ax-4 1009  ax-5o 1011  ax-6o 1014  ax-9o 1159  ax-10o 1177  ax-16 1247  ax-11o 1255  ax-ext 1500
This theorem depends on definitions:  df-bi 145  df-or 222  df-an 223  df-ex 1017  df-sb 1209  df-clab 1506  df-cleq 1511  df-clel 1514  df-v 1858  df-un 2102  df-sn 2470  df-pr 2471  df-op 2474
Copyright terms: Public domain