| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > hbralrimi | Structured version Visualization version GIF version | ||
| Description: Inference from Theorem 19.21 of [Margaris] p. 90 (restricted quantifier version). This theorem contains the common proof steps for ralrimi 3262 and ralrimiv 3155. Its main advantage over these two is its minimal references to axioms. The proof is extracted from NM's previous work. (Contributed by Wolf Lammen, 4-Dec-2019.) |
| Ref | Expression |
|---|---|
| hbralrimi.1 | ⊢ (𝜑 → ∀𝑥𝜑) |
| hbralrimi.2 | ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝜓)) |
| Ref | Expression |
|---|---|
| hbralrimi | ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | hbralrimi.1 | . . 3 ⊢ (𝜑 → ∀𝑥𝜑) | |
| 2 | hbralrimi.2 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝜓)) | |
| 3 | 1, 2 | alrimih 1857 | . 2 ⊢ (𝜑 → ∀𝑥(𝑥 ∈ 𝐴 → 𝜓)) |
| 4 | 3 | ralrid 3086 | 1 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝜓) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∀wal 1568 ∈ wcel 2145 ∀wral 3078 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 |
| This proof depends on definitions: df-bi 210 df-ral 3079 |
| This theorem is used by: ralrimiv 3155 ralrimi 3262 bnj1145 35489 |
| Copyright terms: Public domain | W3C validator |