| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ra4 | Structured version Visualization version GIF version | ||
| Description: Restricted quantifier version of Axiom 5 of [Mendelson] p. 69. This is the axiom stdpc5 2245 of standard predicate calculus for a restricted domain. See ra4v 3840 for a version requiring fewer axioms. (Contributed by NM, 16-Jan-2004.) (Proof shortened by BJ, 27-Mar-2020.) |
| Ref | Expression |
|---|---|
| ra4.1 | ⊢ Ⅎ𝑥𝜑 |
| Ref | Expression |
|---|---|
| ra4 | ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) → (𝜑 → ∀𝑥 ∈ 𝐴 𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ra4.1 | . . 3 ⊢ Ⅎ𝑥𝜑 | |
| 2 | 1 | r19.21 3259 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ (𝜑 → ∀𝑥 ∈ 𝐴 𝜓)) |
| 3 | 2 | biimpi 218 | 1 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) → (𝜑 → ∀𝑥 ∈ 𝐴 𝜓)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 Ⅎwnf 1805 ∀wral 3078 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1817 ax-4 1831 ax-5 1932 ax-6 1989 ax-7 2030 ax-12 2214 |
| This theorem depends on definitions: df-bi 209 df-ex 1802 df-nf 1806 df-ral 3079 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |