| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ra4v | Structured version Visualization version GIF version | ||
| Description: Version of ra4 3840 with a disjoint variable condition, requiring fewer axioms. This is stdpc5v 1968 for a restricted domain. (Contributed by BJ, 27-Mar-2020.) |
| Ref | Expression |
|---|---|
| ra4v | ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) → (𝜑 → ∀𝑥 ∈ 𝐴 𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | r19.21v 3190 | . 2 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ (𝜑 → ∀𝑥 ∈ 𝐴 𝜓)) | |
| 2 | 1 | biimpi 219 | 1 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) → (𝜑 → ∀𝑥 ∈ 𝐴 𝜓)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∀wral 3079 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ral 3080 |
| This theorem is referenced by: wfr3g 8317 frr3g 9729 r1omhfb 35489 r1omhfbregs 35531 |
| Copyright terms: Public domain | W3C validator |