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

Theorem axpr 5319
Description: Unabbreviated version of the Axiom of Pairing of ZF set theory, derived as a theorem from the other axioms.

This theorem should not be referenced by any proof. Instead, use ax-pr 5320 below so that the uses of the Axiom of Pairing can be more easily identified.

For a shorter proof using ax-ext 2790, see axprALT 5313. (Contributed by NM, 14-Nov-2006.) Remove dependency on ax-ext 2790. (Revised by Rohan Ridenour, 10-Aug-2023.) (Proof shortened by BJ, 13-Aug-2023.) Use ax-pr 5320 instead. (New usage is discouraged.)

Assertion
Ref Expression
axpr 𝑧𝑤((𝑤 = 𝑥𝑤 = 𝑦) → 𝑤𝑧)
Distinct variable groups:   𝑥,𝑧,𝑤   𝑦,𝑧,𝑤

Proof of Theorem axpr
Dummy variables 𝑠 𝑝 𝑡 𝑛 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 axprlem3 5316 . . . 4 𝑧𝑤(𝑤𝑧 ↔ ∃𝑠(𝑠𝑝 ∧ if-(∃𝑛 𝑛𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦)))
2 biimpr 221 . . . . 5 ((𝑤𝑧 ↔ ∃𝑠(𝑠𝑝 ∧ if-(∃𝑛 𝑛𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦))) → (∃𝑠(𝑠𝑝 ∧ if-(∃𝑛 𝑛𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦)) → 𝑤𝑧))
32alimi 1803 . . . 4 (∀𝑤(𝑤𝑧 ↔ ∃𝑠(𝑠𝑝 ∧ if-(∃𝑛 𝑛𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦))) → ∀𝑤(∃𝑠(𝑠𝑝 ∧ if-(∃𝑛 𝑛𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦)) → 𝑤𝑧))
41, 3eximii 1828 . . 3 𝑧𝑤(∃𝑠(𝑠𝑝 ∧ if-(∃𝑛 𝑛𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦)) → 𝑤𝑧)
5 axprlem4 5317 . . . . . . . 8 ((∀𝑠(∀𝑛𝑠𝑡 ¬ 𝑡𝑛𝑠𝑝) ∧ 𝑤 = 𝑥) → ∃𝑠(𝑠𝑝 ∧ if-(∃𝑛 𝑛𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦)))
6 axprlem5 5318 . . . . . . . 8 ((∀𝑠(∀𝑛𝑠𝑡 ¬ 𝑡𝑛𝑠𝑝) ∧ 𝑤 = 𝑦) → ∃𝑠(𝑠𝑝 ∧ if-(∃𝑛 𝑛𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦)))
75, 6jaodan 951 . . . . . . 7 ((∀𝑠(∀𝑛𝑠𝑡 ¬ 𝑡𝑛𝑠𝑝) ∧ (𝑤 = 𝑥𝑤 = 𝑦)) → ∃𝑠(𝑠𝑝 ∧ if-(∃𝑛 𝑛𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦)))
87ex 413 . . . . . 6 (∀𝑠(∀𝑛𝑠𝑡 ¬ 𝑡𝑛𝑠𝑝) → ((𝑤 = 𝑥𝑤 = 𝑦) → ∃𝑠(𝑠𝑝 ∧ if-(∃𝑛 𝑛𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦))))
98imim1d 82 . . . . 5 (∀𝑠(∀𝑛𝑠𝑡 ¬ 𝑡𝑛𝑠𝑝) → ((∃𝑠(𝑠𝑝 ∧ if-(∃𝑛 𝑛𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦)) → 𝑤𝑧) → ((𝑤 = 𝑥𝑤 = 𝑦) → 𝑤𝑧)))
109alimdv 1908 . . . 4 (∀𝑠(∀𝑛𝑠𝑡 ¬ 𝑡𝑛𝑠𝑝) → (∀𝑤(∃𝑠(𝑠𝑝 ∧ if-(∃𝑛 𝑛𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦)) → 𝑤𝑧) → ∀𝑤((𝑤 = 𝑥𝑤 = 𝑦) → 𝑤𝑧)))
1110eximdv 1909 . . 3 (∀𝑠(∀𝑛𝑠𝑡 ¬ 𝑡𝑛𝑠𝑝) → (∃𝑧𝑤(∃𝑠(𝑠𝑝 ∧ if-(∃𝑛 𝑛𝑠, 𝑤 = 𝑥, 𝑤 = 𝑦)) → 𝑤𝑧) → ∃𝑧𝑤((𝑤 = 𝑥𝑤 = 𝑦) → 𝑤𝑧)))
124, 11mpi 20 . 2 (∀𝑠(∀𝑛𝑠𝑡 ¬ 𝑡𝑛𝑠𝑝) → ∃𝑧𝑤((𝑤 = 𝑥𝑤 = 𝑦) → 𝑤𝑧))
13 axprlem2 5315 . 2 𝑝𝑠(∀𝑛𝑠𝑡 ¬ 𝑡𝑛𝑠𝑝)
1412, 13exlimiiv 1923 1 𝑧𝑤((𝑤 = 𝑥𝑤 = 𝑦) → 𝑤𝑧)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396  wo 841  if-wif 1054  wal 1526  wex 1771  wral 3135
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1787  ax-4 1801  ax-5 1902  ax-6 1961  ax-7 2006  ax-9 2115  ax-10 2136  ax-11 2151  ax-12 2167  ax-rep 5181  ax-sep 5194  ax-nul 5201  ax-pow 5257
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 842  df-ifp 1055  df-tru 1531  df-ex 1772  df-nf 1776  df-ral 3140
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator