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

Theorem opresOLD 4226
Description: Ordered pair membership in a restriction when the first member belongs to the restricting class.
Hypothesis
Ref Expression
opres.1 |- B e. _V
Assertion
Ref Expression
opresOLD |- (A e. D -> (<.A, B>. e. (C |` D) <-> <.A, B>. e. C))

Proof of Theorem opresOLD
StepHypRef Expression
1 opres.1 . . . 4 |- B e. _V
21opelres 4222 . . 3 |- (<.A, B>. e. (C |` D) <-> (<.A, B>. e. C /\ A e. D))
32simplbi 349 . 2 |- (<.A, B>. e. (C |` D) -> <.A, B>. e. C)
42biimpri 169 . . 3 |- ((<.A, B>. e. C /\ A e. D) -> <.A, B>. e. (C |` D))
54expcom 403 . 2 |- (A e. D -> (<.A, B>. e. C -> <.A, B>. e. (C |` D)))
63, 5impbid2 576 1 |- (A e. D -> (<.A, B>. e. (C |` D) <-> <.A, B>. e. C))
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 163   /\ wa 240   e. wcel 1300  _Vcvv 2292  <.cop 3046   |` cres 3988
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 1304  ax-gen 1305  ax-8 1306  ax-9 1307  ax-10 1308  ax-11 1309  ax-12 1310  ax-14 1312  ax-17 1317  ax-4 1319  ax-5o 1321  ax-6o 1324  ax-9o 1481  ax-10o 1500  ax-16 1580  ax-11o 1588  ax-ext 1865  ax-sep 3438  ax-nul 3445  ax-pow 3481  ax-pr 3524
This theorem depends on definitions:  df-bi 164  df-or 241  df-an 242  df-ex 1327  df-sb 1536  df-eu 1775  df-mo 1776  df-clab 1872  df-cleq 1877  df-clel 1880  df-ne 2019  df-v 2294  df-dif 2597  df-un 2600  df-in 2603  df-ss 2605  df-nul 2876  df-pw 3035  df-sn 3049  df-pr 3050  df-op 3053  df-opab 3396  df-xp 4000  df-res 4006
Copyright terms: Public domain