![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > 19.32r | GIF version |
Description: One direction of Theorem 19.32 of [Margaris] p. 90. The converse holds if 𝜑 is decidable, as seen at 19.32dc 1689. (Contributed by Jim Kingdon, 28-Jul-2018.) |
Ref | Expression |
---|---|
19.32r.1 | ⊢ Ⅎ𝑥𝜑 |
Ref | Expression |
---|---|
19.32r | ⊢ ((𝜑 ∨ ∀𝑥𝜓) → ∀𝑥(𝜑 ∨ 𝜓)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | 19.32r.1 | . . 3 ⊢ Ⅎ𝑥𝜑 | |
2 | orc 713 | . . 3 ⊢ (𝜑 → (𝜑 ∨ 𝜓)) | |
3 | 1, 2 | alrimi 1532 | . 2 ⊢ (𝜑 → ∀𝑥(𝜑 ∨ 𝜓)) |
4 | olc 712 | . . 3 ⊢ (𝜓 → (𝜑 ∨ 𝜓)) | |
5 | 4 | alimi 1465 | . 2 ⊢ (∀𝑥𝜓 → ∀𝑥(𝜑 ∨ 𝜓)) |
6 | 3, 5 | jaoi 717 | 1 ⊢ ((𝜑 ∨ ∀𝑥𝜓) → ∀𝑥(𝜑 ∨ 𝜓)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∨ wo 709 ∀wal 1361 Ⅎwnf 1470 |
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-io 710 ax-5 1457 ax-gen 1459 ax-4 1520 |
This theorem depends on definitions: df-bi 117 df-nf 1471 |
This theorem is referenced by: 19.31r 1691 |
Copyright terms: Public domain | W3C validator |