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 2380. (Contributed by NM, 2-Jun-1993.) (New usage is discouraged.) |
Ref | Expression |
---|---|
drsb1 | ⊢ (∀𝑥 𝑥 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑧 / 𝑦]𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | equequ1 2033 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 = 𝑧 ↔ 𝑦 = 𝑧)) | |
2 | 1 | sps 2183 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑧 ↔ 𝑦 = 𝑧)) |
3 | 2 | imbi1d 346 | . . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → ((𝑥 = 𝑧 → 𝜑) ↔ (𝑦 = 𝑧 → 𝜑))) |
4 | 2 | anbi1d 633 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → ((𝑥 = 𝑧 ∧ 𝜑) ↔ (𝑦 = 𝑧 ∧ 𝜑))) |
5 | 4 | drex1 2453 | . . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝑥 = 𝑧 ∧ 𝜑) ↔ ∃𝑦(𝑦 = 𝑧 ∧ 𝜑))) |
6 | 3, 5 | anbi12d 634 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (((𝑥 = 𝑧 → 𝜑) ∧ ∃𝑥(𝑥 = 𝑧 ∧ 𝜑)) ↔ ((𝑦 = 𝑧 → 𝜑) ∧ ∃𝑦(𝑦 = 𝑧 ∧ 𝜑)))) |
7 | dfsb1 2500 | . 2 ⊢ ([𝑧 / 𝑥]𝜑 ↔ ((𝑥 = 𝑧 → 𝜑) ∧ ∃𝑥(𝑥 = 𝑧 ∧ 𝜑))) | |
8 | dfsb1 2500 | . 2 ⊢ ([𝑧 / 𝑦]𝜑 ↔ ((𝑦 = 𝑧 → 𝜑) ∧ ∃𝑦(𝑦 = 𝑧 ∧ 𝜑))) | |
9 | 6, 7, 8 | 3bitr4g 318 | 1 ⊢ (∀𝑥 𝑥 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑧 / 𝑦]𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∀wal 1537 ∃wex 1782 [wsb 2070 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1912 ax-6 1971 ax-7 2016 ax-10 2143 ax-12 2176 ax-13 2380 |
This theorem depends on definitions: df-bi 210 df-an 401 df-or 846 df-ex 1783 df-nf 1787 df-sb 2071 |
This theorem is referenced by: sb2ae 2515 sbco3 2533 iotaeq 6304 |
Copyright terms: Public domain | W3C validator |