ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  nfraldya GIF version

Theorem nfraldya 2501
Description: Not-free for restricted universal quantification where 𝑦 and 𝐴 are distinct. See nfraldxy 2499 for a version with 𝑥 and 𝑦 distinct instead. (Contributed by Jim Kingdon, 30-May-2018.)
Hypotheses
Ref Expression
nfraldya.2 𝑦𝜑
nfraldya.3 (𝜑𝑥𝐴)
nfraldya.4 (𝜑 → Ⅎ𝑥𝜓)
Assertion
Ref Expression
nfraldya (𝜑 → Ⅎ𝑥𝑦𝐴 𝜓)
Distinct variable group:   𝑦,𝐴
Allowed substitution hints:   𝜑(𝑥,𝑦)   𝜓(𝑥,𝑦)   𝐴(𝑥)

Proof of Theorem nfraldya
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 df-ral 2449 . 2 (∀𝑦𝐴 𝜓 ↔ ∀𝑦(𝑦𝐴𝜓))
2 sbim 1941 . . . . . 6 ([𝑧 / 𝑦](𝑦𝐴𝜓) ↔ ([𝑧 / 𝑦]𝑦𝐴 → [𝑧 / 𝑦]𝜓))
3 clelsb1 2271 . . . . . . 7 ([𝑧 / 𝑦]𝑦𝐴𝑧𝐴)
43imbi1i 237 . . . . . 6 (([𝑧 / 𝑦]𝑦𝐴 → [𝑧 / 𝑦]𝜓) ↔ (𝑧𝐴 → [𝑧 / 𝑦]𝜓))
52, 4bitri 183 . . . . 5 ([𝑧 / 𝑦](𝑦𝐴𝜓) ↔ (𝑧𝐴 → [𝑧 / 𝑦]𝜓))
65albii 1458 . . . 4 (∀𝑧[𝑧 / 𝑦](𝑦𝐴𝜓) ↔ ∀𝑧(𝑧𝐴 → [𝑧 / 𝑦]𝜓))
7 nfv 1516 . . . . 5 𝑧(𝑦𝐴𝜓)
87sb8 1844 . . . 4 (∀𝑦(𝑦𝐴𝜓) ↔ ∀𝑧[𝑧 / 𝑦](𝑦𝐴𝜓))
9 df-ral 2449 . . . 4 (∀𝑧𝐴 [𝑧 / 𝑦]𝜓 ↔ ∀𝑧(𝑧𝐴 → [𝑧 / 𝑦]𝜓))
106, 8, 93bitr4i 211 . . 3 (∀𝑦(𝑦𝐴𝜓) ↔ ∀𝑧𝐴 [𝑧 / 𝑦]𝜓)
11 nfv 1516 . . . 4 𝑧𝜑
12 nfraldya.3 . . . 4 (𝜑𝑥𝐴)
13 nfraldya.2 . . . . 5 𝑦𝜑
14 nfraldya.4 . . . . 5 (𝜑 → Ⅎ𝑥𝜓)
1513, 14nfsbd 1965 . . . 4 (𝜑 → Ⅎ𝑥[𝑧 / 𝑦]𝜓)
1611, 12, 15nfraldxy 2499 . . 3 (𝜑 → Ⅎ𝑥𝑧𝐴 [𝑧 / 𝑦]𝜓)
1710, 16nfxfrd 1463 . 2 (𝜑 → Ⅎ𝑥𝑦(𝑦𝐴𝜓))
181, 17nfxfrd 1463 1 (𝜑 → Ⅎ𝑥𝑦𝐴 𝜓)
Colors of variables: wff set class
Syntax hints:  wi 4  wal 1341  wnf 1448  [wsb 1750  wcel 2136  wnfc 2295  wral 2444
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 699  ax-5 1435  ax-7 1436  ax-gen 1437  ax-ie1 1481  ax-ie2 1482  ax-8 1492  ax-10 1493  ax-11 1494  ax-i12 1495  ax-bndl 1497  ax-4 1498  ax-17 1514  ax-i9 1518  ax-ial 1522  ax-i5r 1523  ax-ext 2147
This theorem depends on definitions:  df-bi 116  df-nf 1449  df-sb 1751  df-cleq 2158  df-clel 2161  df-nfc 2297  df-ral 2449
This theorem is referenced by:  nfralya  2506
  Copyright terms: Public domain W3C validator