Metamath Proof Explorer < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >  r19.43 Structured version   Unicode version

Theorem r19.43 2991
 Description: Restricted quantifier version of 19.43 1740. (Contributed by NM, 27-May-1998.) (Proof shortened by Andrew Salmon, 30-May-2011.)
Assertion
Ref Expression
r19.43

Proof of Theorem r19.43
StepHypRef Expression
1 r19.35 2982 . 2
2 df-or 371 . . 3
32rexbii 2934 . 2
4 df-or 371 . . 3
5 ralnex 2878 . . . 4
65imbi1i 326 . . 3
74, 6bitr4i 255 . 2
81, 3, 73bitr4i 280 1
 Colors of variables: wff setvar class Syntax hints:   wn 3   wi 4   wb 187   wo 369  wral 2782  wrex 2783 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1665  ax-4 1678 This theorem depends on definitions:  df-bi 188  df-or 371  df-an 372  df-ex 1660  df-ral 2787  df-rex 2788 This theorem is referenced by:  r19.44v  2992  r19.45v  2993  r19.45zv  3900  r19.44zv  3901  iunun  4386  wemapsolem  8065  pythagtriplem2  14730  pythagtrip  14747  dcubic  23637  legtrid  24496  axcontlem4  24843  erdszelem11  29712  soseq  30279  seglelin  30668  diophun  35324  rexzrexnn0  35355  usgvincvad  38473  usgvincvadALT  38476  ldepslinc  39061
 Copyright terms: Public domain W3C validator