| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ralrid | Structured version Visualization version GIF version | ||
| Description: Sufficient condition for the restricted universal quantifier. Deduction form. (Contributed by Jonathan Ben-Naim, 3-Jun-2011.) |
| Ref | Expression |
|---|---|
| ralrid.1 | ⊢ (𝜑 → ∀𝑥(𝑥 ∈ 𝐴 → 𝜓)) |
| Ref | Expression |
|---|---|
| ralrid | ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ralrid.1 | . 2 ⊢ (𝜑 → ∀𝑥(𝑥 ∈ 𝐴 → 𝜓)) | |
| 2 | df-ral 3067 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝜓 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜓)) | |
| 3 | 1, 2 | sylibr 236 | 1 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝜓) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∀wal 1548 ∈ wcel 2132 ∀wral 3066 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
| This theorem depends on definitions: df-bi 209 df-ral 3067 |
| This theorem is referenced by: alral 3081 hbralrimi 3142 axprlem4 5373 ingru 10759 bnj1476 35089 bnj1533 35094 bnj1523 35313 r1omhfb 35353 r1omhfbregs 35378 bj-axnul 37495 bj-axreprepsep 37498 exrecfnlem 37811 nninfnub 38188 eqab2 38687 |
| Copyright terms: Public domain | W3C validator |