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

Theorem 19.21v 1921
Description: Special case of Theorem 19.21 of [Margaris] p. 90. Notational convention: We sometimes suffix with "v" the label of a theorem eliminating a hypothesis such as (𝜑 → ∀𝑥𝜑) in 19.21 1632 via the use of distinct variable conditions combined with ax-17 1575. Conversely, we sometimes suffix with "f" the label of a theorem introducing such a hypothesis to eliminate the need for the distinct variable condition; e.g., euf 2084 derived from df-eu 2082. The "f" stands for "not free in" which is less restrictive than "does not occur in". (Contributed by NM, 5-Aug-1993.)
Assertion
Ref Expression
19.21v (∀𝑥(𝜑𝜓) ↔ (𝜑 → ∀𝑥𝜓))
Distinct variable group:   𝜑,𝑥
Allowed substitution hint:   𝜓(𝑥)

Proof of Theorem 19.21v
StepHypRef Expression
1 ax-17 1575 . 2 (𝜑 → ∀𝑥𝜑)
2119.21h 1606 1 (∀𝑥(𝜑𝜓) ↔ (𝜑 → ∀𝑥𝜓))
Colors of variables: wff set class
Syntax hints:  wi 4  wb 105  wal 1396
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia2 107  ax-ia3 108  ax-5 1496  ax-gen 1498  ax-4 1559  ax-17 1575  ax-ial 1583  ax-i5r 1584
This theorem depends on definitions:  df-bi 117
This theorem is referenced by:  pm11.53  1944  cbval2  1970  cbvaldvaw  1979  sbhb  1993  2sb6  2037  sbcom2v  2038  2sb6rf  2043  2exsb  2062  moanim  2154  r3al  2577  ceqsralt  2831  rspc2gv  2923  euind  2994  reu2  2995  reuind  3012  unissb  3928  dfiin2g  4008  tfi  4686  asymref  5129  dff13  5919  mpo2eqb  6141
  Copyright terms: Public domain W3C validator