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

Theorem mosubop 5002
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 1763 . 2 𝑦𝑧∃*𝑥𝜑
3 mosubopt 5001 . 2 (∀𝑦𝑧∃*𝑥𝜑 → ∃*𝑥𝑦𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑))
42, 3ax-mp 5 1 ∃*𝑥𝑦𝑧(𝐴 = ⟨𝑦, 𝑧⟩ ∧ 𝜑)
Colors of variables: wff setvar class
Syntax hints:  wa 383  wal 1521   = wceq 1523  wex 1744  ∃*wmo 2499  cop 4216
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pr 4936
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-rab 2950  df-v 3233  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217
This theorem is referenced by:  ov3  6839  ov6g  6840  oprabex3  7199  axaddf  10004  axmulf  10005
  Copyright terms: Public domain W3C validator