![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > eujust | GIF version |
Description: A soundness justification theorem for df-eu 1976, showing that the definition is equivalent to itself with its dummy variable renamed. Note that 𝑦 and 𝑧 needn't be distinct variables. (Contributed by NM, 11-Mar-2010.) (Proof shortened by Andrew Salmon, 9-Jul-2011.) |
Ref | Expression |
---|---|
eujust | ⊢ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) ↔ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | equequ2 1670 | . . . . 5 ⊢ (𝑦 = 𝑤 → (𝑥 = 𝑦 ↔ 𝑥 = 𝑤)) | |
2 | 1 | bibi2d 231 | . . . 4 ⊢ (𝑦 = 𝑤 → ((𝜑 ↔ 𝑥 = 𝑦) ↔ (𝜑 ↔ 𝑥 = 𝑤))) |
3 | 2 | albidv 1776 | . . 3 ⊢ (𝑦 = 𝑤 → (∀𝑥(𝜑 ↔ 𝑥 = 𝑦) ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑤))) |
4 | 3 | cbvexv 1868 | . 2 ⊢ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) ↔ ∃𝑤∀𝑥(𝜑 ↔ 𝑥 = 𝑤)) |
5 | equequ2 1670 | . . . . 5 ⊢ (𝑤 = 𝑧 → (𝑥 = 𝑤 ↔ 𝑥 = 𝑧)) | |
6 | 5 | bibi2d 231 | . . . 4 ⊢ (𝑤 = 𝑧 → ((𝜑 ↔ 𝑥 = 𝑤) ↔ (𝜑 ↔ 𝑥 = 𝑧))) |
7 | 6 | albidv 1776 | . . 3 ⊢ (𝑤 = 𝑧 → (∀𝑥(𝜑 ↔ 𝑥 = 𝑤) ↔ ∀𝑥(𝜑 ↔ 𝑥 = 𝑧))) |
8 | 7 | cbvexv 1868 | . 2 ⊢ (∃𝑤∀𝑥(𝜑 ↔ 𝑥 = 𝑤) ↔ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) |
9 | 4, 8 | bitri 183 | 1 ⊢ (∃𝑦∀𝑥(𝜑 ↔ 𝑥 = 𝑦) ↔ ∃𝑧∀𝑥(𝜑 ↔ 𝑥 = 𝑧)) |
Colors of variables: wff set class |
Syntax hints: ↔ wb 104 ∀wal 1310 = wceq 1312 ∃wex 1449 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-5 1404 ax-7 1405 ax-gen 1406 ax-ie1 1450 ax-ie2 1451 ax-8 1463 ax-4 1468 ax-17 1487 ax-i9 1491 ax-ial 1495 |
This theorem depends on definitions: df-bi 116 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |