| 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 1581 | . 2 ⊢ Ⅎ𝑥𝜑 | |
| 2 | 1 | r19.21 2626 | 1 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ (𝜑 → ∀𝑥 ∈ 𝐴 𝜓)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∀wral 2528 |
| 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 1500 ax-gen 1502 ax-4 1563 ax-17 1579 ax-ial 1587 ax-i5r 1588 |
| This theorem depends on definitions: df-bi 117 df-nf 1514 df-ral 2533 |
| This theorem is referenced by: r19.32vdc 2700 rmo4 3019 rmo3 3144 dftr5 4227 reusv3 4601 tfrlem1 6569 tfrlemi1 6593 tfr1onlemaccex 6609 tfrcllemaccex 6622 tfri3 6628 ordiso2 7365 raluz2 9958 ndvdssub 12675 nninfalllem1 16956 nninfsellemqall 16963 |
| Copyright terms: Public domain | W3C validator |