| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rename-sb | Structured version Visualization version GIF version | ||
| Description: The equivalence needed for df-sb 2094 in just3-df 2091. It is proved from Tarski's FOL axiom schemes. (Contributed by BJ, 22-Jan-2023.) |
| Ref | Expression |
|---|---|
| rename-sb | ⊢ (∀𝑦(𝑦 = 𝑡 → ∀𝑥(𝑥 = 𝑦 → 𝜑)) ↔ ∀𝑧(𝑧 = 𝑡 → ∀𝑥(𝑥 = 𝑧 → 𝜑))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | equequ1 2048 | . . 3 ⊢ (𝑦 = 𝑧 → (𝑦 = 𝑡 ↔ 𝑧 = 𝑡)) | |
| 2 | equequ2 2049 | . . . . 5 ⊢ (𝑦 = 𝑧 → (𝑥 = 𝑦 ↔ 𝑥 = 𝑧)) | |
| 3 | 2 | imbi1d 344 | . . . 4 ⊢ (𝑦 = 𝑧 → ((𝑥 = 𝑦 → 𝜑) ↔ (𝑥 = 𝑧 → 𝜑))) |
| 4 | 3 | albidv 1943 | . . 3 ⊢ (𝑦 = 𝑧 → (∀𝑥(𝑥 = 𝑦 → 𝜑) ↔ ∀𝑥(𝑥 = 𝑧 → 𝜑))) |
| 5 | 1, 4 | imbi12d 347 | . 2 ⊢ (𝑦 = 𝑧 → ((𝑦 = 𝑡 → ∀𝑥(𝑥 = 𝑦 → 𝜑)) ↔ (𝑧 = 𝑡 → ∀𝑥(𝑥 = 𝑧 → 𝜑)))) |
| 6 | 5 | cbvalvw 2059 | 1 ⊢ (∀𝑦(𝑦 = 𝑡 → ∀𝑥(𝑥 = 𝑦 → 𝜑)) ↔ ∀𝑧(𝑧 = 𝑡 → ∀𝑥(𝑥 = 𝑧 → 𝜑))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∀wal 1561 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-ex 1803 |
| This theorem is referenced by: dfsb 2096 |
| Copyright terms: Public domain | W3C validator |