| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > 19.21v | GIF version | ||
| 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 2087 derived from df-eu 2085. The "f" stands for "not free in" which is less restrictive than "does not occur in". (Contributed by NM, 5-Aug-1993.) |
| Ref | Expression |
|---|---|
| 19.21v | ⊢ (∀𝑥(𝜑 → 𝜓) ↔ (𝜑 → ∀𝑥𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-17 1575 | . 2 ⊢ (𝜑 → ∀𝑥𝜑) | |
| 2 | 1 | 19.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 1947 cbval2 1973 cbvaldvaw 1982 sbhb 1996 2sb6 2040 sbcom2v 2041 2sb6rf 2046 2exsb 2065 moanim 2157 r3al 2588 ceqsralt 2843 rspc2gv 2936 euind 3007 reu2 3008 reuind 3025 unissb 3949 dfiin2g 4029 tfi 4709 asymref 5153 dff13 5947 mpo2eqb 6171 |
| Copyright terms: Public domain | W3C validator |