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

Theorem bj-sbnf 33132
Description: Move non-free predicate in and out of substitution; see sbal 2597 and sbex 2598. (Contributed by BJ, 2-May-2019.)
Assertion
Ref Expression
bj-sbnf ([𝑧 / 𝑦]Ⅎ𝑥𝜑 ↔ Ⅎ𝑥[𝑧 / 𝑦]𝜑)
Distinct variable groups:   𝑥,𝑦   𝑥,𝑧
Allowed substitution hints:   𝜑(𝑥,𝑦,𝑧)

Proof of Theorem bj-sbnf
StepHypRef Expression
1 sbim 2530 . . . 4 ([𝑧 / 𝑦](𝜑 → ∀𝑥𝜑) ↔ ([𝑧 / 𝑦]𝜑 → [𝑧 / 𝑦]∀𝑥𝜑))
2 sbal 2597 . . . . 5 ([𝑧 / 𝑦]∀𝑥𝜑 ↔ ∀𝑥[𝑧 / 𝑦]𝜑)
32imbi2i 325 . . . 4 (([𝑧 / 𝑦]𝜑 → [𝑧 / 𝑦]∀𝑥𝜑) ↔ ([𝑧 / 𝑦]𝜑 → ∀𝑥[𝑧 / 𝑦]𝜑))
41, 3bitri 264 . . 3 ([𝑧 / 𝑦](𝜑 → ∀𝑥𝜑) ↔ ([𝑧 / 𝑦]𝜑 → ∀𝑥[𝑧 / 𝑦]𝜑))
54albii 1894 . 2 (∀𝑥[𝑧 / 𝑦](𝜑 → ∀𝑥𝜑) ↔ ∀𝑥([𝑧 / 𝑦]𝜑 → ∀𝑥[𝑧 / 𝑦]𝜑))
6 nf5 2261 . . . 4 (Ⅎ𝑥𝜑 ↔ ∀𝑥(𝜑 → ∀𝑥𝜑))
76sbbii 2051 . . 3 ([𝑧 / 𝑦]Ⅎ𝑥𝜑 ↔ [𝑧 / 𝑦]∀𝑥(𝜑 → ∀𝑥𝜑))
8 sbal 2597 . . 3 ([𝑧 / 𝑦]∀𝑥(𝜑 → ∀𝑥𝜑) ↔ ∀𝑥[𝑧 / 𝑦](𝜑 → ∀𝑥𝜑))
97, 8bitri 264 . 2 ([𝑧 / 𝑦]Ⅎ𝑥𝜑 ↔ ∀𝑥[𝑧 / 𝑦](𝜑 → ∀𝑥𝜑))
10 nf5 2261 . 2 (Ⅎ𝑥[𝑧 / 𝑦]𝜑 ↔ ∀𝑥([𝑧 / 𝑦]𝜑 → ∀𝑥[𝑧 / 𝑦]𝜑))
115, 9, 103bitr4i 292 1 ([𝑧 / 𝑦]Ⅎ𝑥𝜑 ↔ Ⅎ𝑥[𝑧 / 𝑦]𝜑)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wal 1628  wnf 1855  [wsb 2044
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1869  ax-4 1884  ax-5 1986  ax-6 2052  ax-7 2088  ax-10 2166  ax-11 2181  ax-12 2194  ax-13 2389
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1633  df-ex 1852  df-nf 1857  df-sb 2045
This theorem is referenced by:  bj-nfcf  33224
  Copyright terms: Public domain W3C validator