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

Theorem mosubop 4751
 Description: "At most one" remains true inside ordered pair quantification. (Contributed by NM, 28-May-1995.)
Hypothesis
Ref Expression
mosubop.1
Assertion
Ref Expression
mosubop
Distinct variable group:   ,,,

Proof of Theorem mosubop
StepHypRef Expression
1 mosubop.1 . . 3
21gen2 1619 . 2
3 mosubopt 4750 . 2
42, 3ax-mp 5 1
 Colors of variables: wff setvar class Syntax hints:  /\wa 369  A.wal 1393  =wceq 1395  E.wex 1612  E*wmo 2283  <.cop 4035 This theorem is referenced by:  ov3  6439  ov6g  6440  oprabex3  6789  axaddf  9543  axmulf  9544 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1618  ax-4 1631  ax-5 1704  ax-6 1747  ax-7 1790  ax-9 1822  ax-10 1837  ax-11 1842  ax-12 1854  ax-13 1999  ax-ext 2435  ax-sep 4573  ax-nul 4581  ax-pr 4691 This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3an 975  df-tru 1398  df-ex 1613  df-nf 1617  df-sb 1740  df-eu 2286  df-mo 2287  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ne 2654  df-rab 2816  df-v 3111  df-dif 3478  df-un 3480  df-in 3482  df-ss 3489  df-nul 3785  df-if 3942  df-sn 4030  df-pr 4032  df-op 4036
 Copyright terms: Public domain W3C validator