Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > cdeqal1 | GIF version |
Description: Distribute conditional equality over quantification. (Contributed by Mario Carneiro, 11-Aug-2016.) |
Ref | Expression |
---|---|
cdeqnot.1 | ⊢ CondEq(𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
cdeqal1 | ⊢ CondEq(𝑥 = 𝑦 → (∀𝑥𝜑 ↔ ∀𝑦𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cdeqnot.1 | . . . 4 ⊢ CondEq(𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
2 | 1 | cdeqri 2937 | . . 3 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
3 | 2 | cbvalv 1905 | . 2 ⊢ (∀𝑥𝜑 ↔ ∀𝑦𝜓) |
4 | 3 | cdeqth 2938 | 1 ⊢ CondEq(𝑥 = 𝑦 → (∀𝑥𝜑 ↔ ∀𝑦𝜓)) |
Colors of variables: wff set class |
Syntax hints: ↔ wb 104 ∀wal 1341 CondEqwcdeq 2934 |
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-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 |
This theorem depends on definitions: df-bi 116 df-nf 1449 df-cdeq 2935 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |