![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > sbal2 | GIF version |
Description: Move quantifier in and out of substitution. (Contributed by NM, 2-Jan-2002.) |
Ref | Expression |
---|---|
sbal2 | ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ([𝑧 / 𝑦]∀𝑥𝜑 ↔ ∀𝑥[𝑧 / 𝑦]𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | hbnae 1732 | . . . 4 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ∀𝑦 ¬ ∀𝑥 𝑥 = 𝑦) | |
2 | dveeq1 2035 | . . . . . . 7 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧)) | |
3 | 2 | alimi 1466 | . . . . . 6 ⊢ (∀𝑥 ¬ ∀𝑥 𝑥 = 𝑦 → ∀𝑥(𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧)) |
4 | 3 | hbnaes 1734 | . . . . 5 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ∀𝑥(𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧)) |
5 | 19.21ht 1592 | . . . . 5 ⊢ (∀𝑥(𝑦 = 𝑧 → ∀𝑥 𝑦 = 𝑧) → (∀𝑥(𝑦 = 𝑧 → 𝜑) ↔ (𝑦 = 𝑧 → ∀𝑥𝜑))) | |
6 | 4, 5 | syl 14 | . . . 4 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∀𝑥(𝑦 = 𝑧 → 𝜑) ↔ (𝑦 = 𝑧 → ∀𝑥𝜑))) |
7 | 1, 6 | albidh 1491 | . . 3 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∀𝑦∀𝑥(𝑦 = 𝑧 → 𝜑) ↔ ∀𝑦(𝑦 = 𝑧 → ∀𝑥𝜑))) |
8 | alcom 1489 | . . 3 ⊢ (∀𝑦∀𝑥(𝑦 = 𝑧 → 𝜑) ↔ ∀𝑥∀𝑦(𝑦 = 𝑧 → 𝜑)) | |
9 | 7, 8 | bitr3di 195 | . 2 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → (∀𝑦(𝑦 = 𝑧 → ∀𝑥𝜑) ↔ ∀𝑥∀𝑦(𝑦 = 𝑧 → 𝜑))) |
10 | sb6 1898 | . 2 ⊢ ([𝑧 / 𝑦]∀𝑥𝜑 ↔ ∀𝑦(𝑦 = 𝑧 → ∀𝑥𝜑)) | |
11 | sb6 1898 | . . 3 ⊢ ([𝑧 / 𝑦]𝜑 ↔ ∀𝑦(𝑦 = 𝑧 → 𝜑)) | |
12 | 11 | albii 1481 | . 2 ⊢ (∀𝑥[𝑧 / 𝑦]𝜑 ↔ ∀𝑥∀𝑦(𝑦 = 𝑧 → 𝜑)) |
13 | 9, 10, 12 | 3bitr4g 223 | 1 ⊢ (¬ ∀𝑥 𝑥 = 𝑦 → ([𝑧 / 𝑦]∀𝑥𝜑 ↔ ∀𝑥[𝑧 / 𝑦]𝜑)) |
Colors of variables: wff set class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 105 ∀wal 1362 [wsb 1773 |
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-in1 615 ax-in2 616 ax-io 710 ax-5 1458 ax-7 1459 ax-gen 1460 ax-ie1 1504 ax-ie2 1505 ax-8 1515 ax-10 1516 ax-11 1517 ax-i12 1518 ax-4 1521 ax-17 1537 ax-i9 1541 ax-ial 1545 ax-i5r 1546 |
This theorem depends on definitions: df-bi 117 df-tru 1367 df-fal 1370 df-nf 1472 df-sb 1774 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |