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

Theorem drnf2 1782
Description: Formula-building lemma for use with the Distinctor Reduction Theorem. (Contributed by Mario Carneiro, 4-Oct-2016.)
Hypothesis
Ref Expression
drex2.1 (∀𝑥 𝑥 = 𝑦 → (𝜑𝜓))
Assertion
Ref Expression
drnf2 (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑧𝜑 ↔ Ⅎ𝑧𝜓))

Proof of Theorem drnf2
StepHypRef Expression
1 drex2.1 . . . 4 (∀𝑥 𝑥 = 𝑦 → (𝜑𝜓))
21dral2 1779 . . . 4 (∀𝑥 𝑥 = 𝑦 → (∀𝑧𝜑 ↔ ∀𝑧𝜓))
31, 2imbi12d 234 . . 3 (∀𝑥 𝑥 = 𝑦 → ((𝜑 → ∀𝑧𝜑) ↔ (𝜓 → ∀𝑧𝜓)))
43dral2 1779 . 2 (∀𝑥 𝑥 = 𝑦 → (∀𝑧(𝜑 → ∀𝑧𝜑) ↔ ∀𝑧(𝜓 → ∀𝑧𝜓)))
5 df-nf 1510 . 2 (Ⅎ𝑧𝜑 ↔ ∀𝑧(𝜑 → ∀𝑧𝜑))
6 df-nf 1510 . 2 (Ⅎ𝑧𝜓 ↔ ∀𝑧(𝜓 → ∀𝑧𝜓))
74, 5, 63bitr4g 223 1 (∀𝑥 𝑥 = 𝑦 → (Ⅎ𝑧𝜑 ↔ Ⅎ𝑧𝜓))
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105  wal 1396  wnf 1509
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583
This theorem depends on definitions:  df-bi 117  df-nf 1510
This theorem is referenced by:  nfsbxy  1995  nfsbxyt  1996  drnfc2  2393
  Copyright terms: Public domain W3C validator