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

Theorem bj-cbveaw 37293
Description: Universally quantifying over a non-occurring variable is independent from the variable, under a weaker condition than in bj-cbvalvv 37289. (Contributed by BJ, 14-Mar-2026.) (Proof modification is discouraged.)
Assertion
Ref Expression
bj-cbveaw ((∃𝑥⊤ → ∃𝑦𝜑) → (∀𝑦𝜓 → ∀𝑥𝜓))
Distinct variable groups:   𝜓,𝑥   𝜓,𝑦
Allowed substitution hints:   𝜑(𝑥, 𝑦)

Proof of Theorem bj-cbveaw
StepHypRef Expression
1 empty 1935 . . 3 (¬ ∃𝑥⊤ ↔ ∀𝑥⊥)
2 falim 1586 . . . . 5 (⊥ → 𝜓)
32alimi 1840 . . . 4 (∀𝑥⊥ → ∀𝑥𝜓)
43a1d 26 . . 3 (∀𝑥⊥ → (∀𝑦𝜓 → ∀𝑥𝜓))
51, 4sylbi 220 . 2 (¬ ∃𝑥⊤ → (∀𝑦𝜓 → ∀𝑥𝜓))
6 bj-cbvalvv 37289 . 2 (∃𝑦𝜑 → (∀𝑦𝜓 → ∀𝑥𝜓))
75, 6ja 188 1 ((∃𝑥⊤ → ∃𝑦𝜑) → (∀𝑦𝜓 → ∀𝑥𝜓))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wal 1567  wtru 1570  wfal 1581  wex 1808
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939
This proof depends on definitions:  df-bi 210  df-tru 1572  df-fal 1582  df-ex 1809
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator