| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > drsb1 | Structured version Visualization version GIF version | ||
| Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Part of Theorem 9.4 of [Megill] p. 448 (p. 16 of preprint). Usage of this theorem is discouraged because it depends on ax-13 2403. (Contributed by NM, 2-Jun-1993.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| drsb1 | ⊢ (∀𝑥 𝑥 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑧 / 𝑦]𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | equequ1 2045 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 = 𝑧 ↔ 𝑦 = 𝑧)) | |
| 2 | 1 | sps 2220 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑧 ↔ 𝑦 = 𝑧)) |
| 3 | 2 | imbi1d 343 | . . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → ((𝑥 = 𝑧 → 𝜑) ↔ (𝑦 = 𝑧 → 𝜑))) |
| 4 | 2 | anbi1d 640 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → ((𝑥 = 𝑧 ∧ 𝜑) ↔ (𝑦 = 𝑧 ∧ 𝜑))) |
| 5 | 4 | drex1 2472 | . . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝑥 = 𝑧 ∧ 𝜑) ↔ ∃𝑦(𝑦 = 𝑧 ∧ 𝜑))) |
| 6 | 3, 5 | anbi12d 641 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (((𝑥 = 𝑧 → 𝜑) ∧ ∃𝑥(𝑥 = 𝑧 ∧ 𝜑)) ↔ ((𝑦 = 𝑧 → 𝜑) ∧ ∃𝑦(𝑦 = 𝑧 ∧ 𝜑)))) |
| 7 | dfsb1 2512 | . 2 ⊢ ([𝑧 / 𝑥]𝜑 ↔ ((𝑥 = 𝑧 → 𝜑) ∧ ∃𝑥(𝑥 = 𝑧 ∧ 𝜑))) | |
| 8 | dfsb1 2512 | . 2 ⊢ ([𝑧 / 𝑦]𝜑 ↔ ((𝑦 = 𝑧 → 𝜑) ∧ ∃𝑦(𝑦 = 𝑧 ∧ 𝜑))) | |
| 9 | 6, 7, 8 | 3bitr4g 316 | 1 ⊢ (∀𝑥 𝑥 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑧 / 𝑦]𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 399 ∀wal 1558 ∃wex 1799 [wsb 2090 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-10 2175 ax-12 2212 ax-13 2403 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-ex 1800 df-nf 1804 df-sb 2091 |
| This theorem is referenced by: sb2ae 2527 sbco3 2544 iotaeq 6489 |
| Copyright terms: Public domain | W3C validator |