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 1705 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → ∀𝑧∀𝑥 𝑥 = 𝑦) | |
2 | drex2.1 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
3 | 1, 2 | exbidh 1601 | 1 ⊢ (∀𝑥 𝑥 = 𝑦 → (∃𝑧𝜑 ↔ ∃𝑧𝜓)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 ∀wal 1340 ∃wex 1479 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1434 ax-7 1435 ax-gen 1436 ax-ie1 1480 ax-ie2 1481 ax-8 1491 ax-10 1492 ax-11 1493 ax-i12 1494 ax-4 1497 ax-17 1513 ax-i9 1517 ax-ial 1521 |
This theorem depends on definitions: df-bi 116 |
This theorem is referenced by: exdistrfor 1787 |
Copyright terms: Public domain | W3C validator |