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

Theorem mosubop 5257
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:   𝑥,𝑦,𝑧,𝐴
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)

Proof of Theorem mosubop
StepHypRef Expression
1 mosubop.1 . . 3 ∃*𝑥𝜑
21gen2 1759 . 2 𝑦𝑧∃*𝑥𝜑
3 mosubopt 5256 . 2 (∀𝑦𝑧∃*𝑥𝜑 → ∃*𝑥𝑦𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑))
42, 3ax-mp 5 1 ∃*𝑥𝑦𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)
Colors of variables: wff setvar class
Syntax hints:  wa 387  wal 1505   = wceq 1507  wex 1742  ∃*wmo 2545  cop 4447
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1758  ax-4 1772  ax-5 1869  ax-6 1928  ax-7 1965  ax-8 2052  ax-9 2059  ax-10 2079  ax-11 2093  ax-12 2106  ax-13 2301  ax-ext 2751  ax-sep 5060  ax-nul 5067  ax-pr 5186
This theorem depends on definitions:  df-bi 199  df-an 388  df-or 834  df-3an 1070  df-tru 1510  df-ex 1743  df-nf 1747  df-sb 2016  df-mo 2547  df-eu 2584  df-clab 2760  df-cleq 2772  df-clel 2847  df-nfc 2919  df-rab 3098  df-v 3418  df-dif 3833  df-un 3835  df-in 3837  df-ss 3844  df-nul 4180  df-if 4351  df-sn 4442  df-pr 4444  df-op 4448
This theorem is referenced by:  ov3  7127  ov6g  7128  oprabex3  7490  axaddf  10365  axmulf  10366
  Copyright terms: Public domain W3C validator