| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sb4e | Structured version Visualization version GIF version | ||
| Description: One direction of a simplified definition of substitution that unlike sb4b 2474 does not require a distinctor antecedent. Usage of this theorem is discouraged because it depends on ax-13 2371. (Contributed by NM, 2-Feb-2007.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| sb4e | ⊢ ([𝑦 / 𝑥]𝜑 → ∀𝑥(𝑥 = 𝑦 → ∃𝑦𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sb1 2477 | . 2 ⊢ ([𝑦 / 𝑥]𝜑 → ∃𝑥(𝑥 = 𝑦 ∧ 𝜑)) | |
| 2 | equs5e 2457 | . 2 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝜑) → ∀𝑥(𝑥 = 𝑦 → ∃𝑦𝜑)) | |
| 3 | 1, 2 | syl 17 | 1 ⊢ ([𝑦 / 𝑥]𝜑 → ∀𝑥(𝑥 = 𝑦 → ∃𝑦𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∀wal 1538 ∃wex 1779 [wsb 2065 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-10 2142 ax-12 2178 ax-13 2371 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-ex 1780 df-nf 1784 df-sb 2066 |
| This theorem is referenced by: hbsb2e 2485 |
| Copyright terms: Public domain | W3C validator |