ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  mosubop Unicode version

Theorem mosubop 4424
Description: "At most one" remains true inside ordered pair quantification. (Contributed by NM, 28-May-1995.)
Hypothesis
Ref Expression
mosubop.1  |-  E* x ph
Assertion
Ref Expression
mosubop  |-  E* x E. y E. z ( A  =  <. y ,  z >.  /\  ph )
Distinct variable group:    x, y, z, A
Allowed substitution hints:    ph( x, y, z)

Proof of Theorem mosubop
StepHypRef Expression
1 mosubop.1 . . 3  |-  E* x ph
21gen2 1379 . 2  |-  A. y A. z E* x ph
3 mosubopt 4423 . 2  |-  ( A. y A. z E* x ph  ->  E* x E. y E. z ( A  =  <. y ,  z
>.  /\  ph ) )
42, 3ax-mp 7 1  |-  E* x E. y E. z ( A  =  <. y ,  z >.  /\  ph )
Colors of variables: wff set class
Syntax hints:    /\ wa 102   A.wal 1282    = wceq 1284   E.wex 1421   E*wmo 1942   <.cop 3401
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-io 662  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-10 1436  ax-11 1437  ax-i12 1438  ax-bndl 1439  ax-4 1440  ax-14 1445  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063  ax-sep 3896  ax-pow 3948  ax-pr 3964
This theorem depends on definitions:  df-bi 115  df-3an 921  df-tru 1287  df-nf 1390  df-sb 1686  df-eu 1944  df-mo 1945  df-clab 2068  df-cleq 2074  df-clel 2077  df-nfc 2208  df-v 2603  df-un 2977  df-in 2979  df-ss 2986  df-pw 3384  df-sn 3404  df-pr 3405  df-op 3407
This theorem is referenced by:  ovi3  5657  ov6g  5658  oprabex3  5776
  Copyright terms: Public domain W3C validator