| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > stdpc4lem | Structured version Visualization version GIF version | ||
| Description: In the case of stdpc4 2092, rename-sb 2083 is derivable from fewer axioms than dfsb 2087. The essential proof step is presented in this lemma. Based on a proof of BJ, 22-Dec-2020. (Contributed by Wolf Lammen, 4-Jun-2026.) |
| Ref | Expression |
|---|---|
| stdpc4lem | ⊢ (∀𝑥𝜑 → ∀𝑦(𝑦 = 𝑡 → ∀𝑥(𝑥 = 𝑦 → 𝜑))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ala1 1827 | . . 3 ⊢ (∀𝑥𝜑 → ∀𝑥(𝑥 = 𝑦 → 𝜑)) | |
| 2 | 1 | a1d 25 | . 2 ⊢ (∀𝑥𝜑 → (𝑦 = 𝑡 → ∀𝑥(𝑥 = 𝑦 → 𝜑))) |
| 3 | 2 | alrimiv 1941 | 1 ⊢ (∀𝑥𝜑 → ∀𝑦(𝑦 = 𝑡 → ∀𝑥(𝑥 = 𝑦 → 𝜑))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∀wal 1552 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-gen 1809 ax-4 1823 ax-5 1924 |
| This theorem is referenced by: stdpc4 2092 |
| Copyright terms: Public domain | W3C validator |