Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > drex2 | 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, 27-Feb-2005.) |
Ref | Expression |
---|---|
drex2.1 | ⊢ (∀𝑥 𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
drex2 | ⊢ (∀𝑥 𝑥 = 𝑦 → (∃𝑧𝜑 ↔ ∃𝑧𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | hbae 1646 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → ∀𝑧∀𝑥 𝑥 = 𝑦) | |
2 | drex2.1 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
3 | 1, 2 | exbidh 1545 | 1 ⊢ (∀𝑥 𝑥 = 𝑦 → (∃𝑧𝜑 ↔ ∃𝑧𝜓)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 103 ∀wal 1282 ∃wex 1421 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 |
This theorem depends on definitions: df-bi 115 |
This theorem is referenced by: exdistrfor 1721 |
Copyright terms: Public domain | W3C validator |