| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > r19.21v | GIF version | ||
| Description: Theorem 19.21 of [Margaris] p. 90 with restricted quantifiers. (Contributed by NM, 15-Oct-2003.) (Proof shortened by Andrew Salmon, 30-May-2011.) |
| Ref | Expression |
|---|---|
| r19.21v | ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ (𝜑 → ∀𝑥 ∈ 𝐴 𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfv 1576 | . 2 ⊢ Ⅎ𝑥𝜑 | |
| 2 | 1 | r19.21 2608 | 1 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ (𝜑 → ∀𝑥 ∈ 𝐴 𝜓)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∀wral 2510 |
| 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-5 1495 ax-gen 1497 ax-4 1558 ax-17 1574 ax-ial 1582 ax-i5r 1583 |
| This theorem depends on definitions: df-bi 117 df-nf 1509 df-ral 2515 |
| This theorem is referenced by: r19.32vdc 2682 rmo4 2999 rmo3 3124 dftr5 4190 reusv3 4557 tfrlem1 6473 tfrlemi1 6497 tfr1onlemaccex 6513 tfrcllemaccex 6526 tfri3 6532 ordiso2 7233 raluz2 9812 ndvdssub 12490 nninfalllem1 16610 nninfsellemqall 16617 |
| Copyright terms: Public domain | W3C validator |