| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > drsb1 | 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). (Contributed by NM, 5-Aug-1993.) |
| Ref | Expression |
|---|---|
| drsb1 | ⊢ (∀𝑥 𝑥 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑧 / 𝑦]𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | equequ1 1734 | . . . . 5 ⊢ (𝑥 = 𝑦 → (𝑥 = 𝑧 ↔ 𝑦 = 𝑧)) | |
| 2 | 1 | sps 1559 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑧 ↔ 𝑦 = 𝑧)) |
| 3 | 2 | imbi1d 231 | . . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → ((𝑥 = 𝑧 → 𝜑) ↔ (𝑦 = 𝑧 → 𝜑))) |
| 4 | 2 | anbi1d 465 | . . . 4 ⊢ (∀𝑥 𝑥 = 𝑦 → ((𝑥 = 𝑧 ∧ 𝜑) ↔ (𝑦 = 𝑧 ∧ 𝜑))) |
| 5 | 4 | drex1 1820 | . . 3 ⊢ (∀𝑥 𝑥 = 𝑦 → (∃𝑥(𝑥 = 𝑧 ∧ 𝜑) ↔ ∃𝑦(𝑦 = 𝑧 ∧ 𝜑))) |
| 6 | 3, 5 | anbi12d 473 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (((𝑥 = 𝑧 → 𝜑) ∧ ∃𝑥(𝑥 = 𝑧 ∧ 𝜑)) ↔ ((𝑦 = 𝑧 → 𝜑) ∧ ∃𝑦(𝑦 = 𝑧 ∧ 𝜑)))) |
| 7 | df-sb 1785 | . 2 ⊢ ([𝑧 / 𝑥]𝜑 ↔ ((𝑥 = 𝑧 → 𝜑) ∧ ∃𝑥(𝑥 = 𝑧 ∧ 𝜑))) | |
| 8 | df-sb 1785 | . 2 ⊢ ([𝑧 / 𝑦]𝜑 ↔ ((𝑦 = 𝑧 → 𝜑) ∧ ∃𝑦(𝑦 = 𝑧 ∧ 𝜑))) | |
| 9 | 6, 7, 8 | 3bitr4g 223 | 1 ⊢ (∀𝑥 𝑥 = 𝑦 → ([𝑧 / 𝑥]𝜑 ↔ [𝑧 / 𝑦]𝜑)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∀wal 1370 ∃wex 1514 [wsb 1784 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 |
| This theorem depends on definitions: df-bi 117 df-sb 1785 |
| This theorem is referenced by: sbequi 1861 nfsbxy 1969 nfsbxyt 1970 sbcomxyyz 1999 iotaeq 5239 |
| Copyright terms: Public domain | W3C validator |