Users' Mathboxes Mathbox for BJ < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  bj-alextruim Structured version   Visualization version   GIF version

Theorem bj-alextruim 36873
Description: An equivalent expression for universal quantification over a non-occurring variable proved over ax-1 6-- ax-5 1912. The forward implication can be strengthened when ax-6 1969 is posited (which implies that models are non-empty), see spvw 1983. The reverse implication can be seen as a strengthening of ax-5 1912 (since the antecedent of the implication is weakened). See bj-exextruan 36874 for a dual statement.

An approximate meaning is: the universal quantification of a proposition over a non-occurring variable holds if and only if the proposition holds in nonempty universes. (Contributed by BJ, 14-Mar-2026.) (Proof modification is discouraged.)

Assertion
Ref Expression
bj-alextruim (∀𝑥𝜑 ↔ (∃𝑥⊤ → 𝜑))
Distinct variable group:   𝜑,𝑥

Proof of Theorem bj-alextruim
StepHypRef Expression
1 bj-spvw 36871 . . 3 (∃𝑥⊤ → (𝜑 ↔ ∀𝑥𝜑))
21biimprcd 250 . 2 (∀𝑥𝜑 → (∃𝑥⊤ → 𝜑))
3 ax-5 1912 . . . 4 (𝜑 → ∀𝑥𝜑)
43imim2i 16 . . 3 ((∃𝑥⊤ → 𝜑) → (∃𝑥⊤ → ∀𝑥𝜑))
5 19.38 1841 . . . 4 ((∃𝑥⊤ → ∀𝑥𝜑) → ∀𝑥(⊤ → 𝜑))
6 pm2.27 42 . . . . 5 (⊤ → ((⊤ → 𝜑) → 𝜑))
76mptru 1549 . . . 4 ((⊤ → 𝜑) → 𝜑)
85, 7sylg 1825 . . 3 ((∃𝑥⊤ → ∀𝑥𝜑) → ∀𝑥𝜑)
94, 8syl 17 . 2 ((∃𝑥⊤ → 𝜑) → ∀𝑥𝜑)
102, 9impbii 209 1 (∀𝑥𝜑 ↔ (∃𝑥⊤ → 𝜑))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wal 1540  wtru 1543  wex 1781
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912
This theorem depends on definitions:  df-bi 207  df-tru 1545  df-ex 1782
This theorem is referenced by:  bj-axseprep  37313
  Copyright terms: Public domain W3C validator