![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > rspn0 | Structured version Visualization version GIF version |
Description: Specialization for restricted generalization with a nonempty class. (Contributed by Alexander van der Vekens, 6-Sep-2018.) Avoid ax-10 2137, ax-12 2171. (Revised by Gino Giotto, 28-Jun-2024.) |
Ref | Expression |
---|---|
rspn0 | ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 𝜑 → 𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | n0 4304 | . 2 ⊢ (𝐴 ≠ ∅ ↔ ∃𝑥 𝑥 ∈ 𝐴) | |
2 | df-ral 3063 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)) | |
3 | exim 1836 | . . . 4 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) → (∃𝑥 𝑥 ∈ 𝐴 → ∃𝑥𝜑)) | |
4 | ax5e 1915 | . . . 4 ⊢ (∃𝑥𝜑 → 𝜑) | |
5 | 3, 4 | syl6com 37 | . . 3 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) → 𝜑)) |
6 | 2, 5 | biimtrid 241 | . 2 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (∀𝑥 ∈ 𝐴 𝜑 → 𝜑)) |
7 | 1, 6 | sylbi 216 | 1 ⊢ (𝐴 ≠ ∅ → (∀𝑥 ∈ 𝐴 𝜑 → 𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∀wal 1539 ∃wex 1781 ∈ wcel 2106 ≠ wne 2941 ∀wral 3062 ∅c0 4280 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-9 2116 ax-ext 2708 |
This theorem depends on definitions: df-bi 206 df-an 397 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2715 df-cleq 2729 df-ne 2942 df-ral 3063 df-dif 3911 df-nul 4281 |
This theorem is referenced by: hashge2el2dif 14333 rmodislmodlem 20342 rmodislmod 20343 rmodislmodOLD 20344 scmatf1 21832 fusgrregdegfi 28346 rusgr1vtxlem 28364 upgrewlkle2 28383 zarclsiin 32264 ralralimp 45411 |
Copyright terms: Public domain | W3C validator |