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

Theorem mosubop 4613
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 1427 . 2  |-  A. y A. z E* x ph
3 mosubopt 4612 . 2  |-  ( A. y A. z E* x ph  ->  E* x E. y E. z ( A  =  <. y ,  z
>.  /\  ph ) )
42, 3ax-mp 5 1  |-  E* x E. y E. z ( A  =  <. y ,  z >.  /\  ph )
Colors of variables: wff set class
Syntax hints:    /\ wa 103   A.wal 1330    = wceq 1332   E.wex 1469   E*wmo 2001   <.cop 3535
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139
This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-v 2691  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541
This theorem is referenced by:  ovi3  5915  ov6g  5916  oprabex3  6035  axaddf  7700  axmulf  7701
  Copyright terms: Public domain W3C validator