![]() |
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 1597 via the use of distinct variable conditions combined with ax-17 1540. 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 2050 derived from df-eu 2048. 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 1540 | . 2 ⊢ (𝜑 → ∀𝑥𝜑) | |
2 | 1 | 19.21h 1571 | 1 ⊢ (∀𝑥(𝜑 → 𝜓) ↔ (𝜑 → ∀𝑥𝜓)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 105 ∀wal 1362 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia2 107 ax-ia3 108 ax-5 1461 ax-gen 1463 ax-4 1524 ax-17 1540 ax-ial 1548 ax-i5r 1549 |
This theorem depends on definitions: df-bi 117 |
This theorem is referenced by: pm11.53 1910 cbval2 1936 cbvaldvaw 1945 sbhb 1959 2sb6 2003 sbcom2v 2004 2sb6rf 2009 2exsb 2028 moanim 2119 r3al 2541 ceqsralt 2790 rspc2gv 2880 euind 2951 reu2 2952 reuind 2969 unissb 3869 dfiin2g 3949 tfi 4618 asymref 5055 dff13 5815 mpo2eqb 6032 |
Copyright terms: Public domain | W3C validator |