![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > eupickbi | GIF version |
Description: Theorem *14.26 in [WhiteheadRussell] p. 192. (Contributed by Andrew Salmon, 11-Jul-2011.) |
Ref | Expression |
---|---|
eupickbi | ⊢ (∃!𝑥𝜑 → (∃𝑥(𝜑 ∧ 𝜓) ↔ ∀𝑥(𝜑 → 𝜓))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eupicka 2021 | . . 3 ⊢ ((∃!𝑥𝜑 ∧ ∃𝑥(𝜑 ∧ 𝜓)) → ∀𝑥(𝜑 → 𝜓)) | |
2 | 1 | ex 113 | . 2 ⊢ (∃!𝑥𝜑 → (∃𝑥(𝜑 ∧ 𝜓) → ∀𝑥(𝜑 → 𝜓))) |
3 | hba1 1473 | . . . . 5 ⊢ (∀𝑥(𝜑 → 𝜓) → ∀𝑥∀𝑥(𝜑 → 𝜓)) | |
4 | ancl 311 | . . . . . . 7 ⊢ ((𝜑 → 𝜓) → (𝜑 → (𝜑 ∧ 𝜓))) | |
5 | simpl 107 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝜓) → 𝜑) | |
6 | 4, 5 | impbid1 140 | . . . . . 6 ⊢ ((𝜑 → 𝜓) → (𝜑 ↔ (𝜑 ∧ 𝜓))) |
7 | 6 | sps 1470 | . . . . 5 ⊢ (∀𝑥(𝜑 → 𝜓) → (𝜑 ↔ (𝜑 ∧ 𝜓))) |
8 | 3, 7 | eubidh 1947 | . . . 4 ⊢ (∀𝑥(𝜑 → 𝜓) → (∃!𝑥𝜑 ↔ ∃!𝑥(𝜑 ∧ 𝜓))) |
9 | euex 1971 | . . . 4 ⊢ (∃!𝑥(𝜑 ∧ 𝜓) → ∃𝑥(𝜑 ∧ 𝜓)) | |
10 | 8, 9 | syl6bi 161 | . . 3 ⊢ (∀𝑥(𝜑 → 𝜓) → (∃!𝑥𝜑 → ∃𝑥(𝜑 ∧ 𝜓))) |
11 | 10 | com12 30 | . 2 ⊢ (∃!𝑥𝜑 → (∀𝑥(𝜑 → 𝜓) → ∃𝑥(𝜑 ∧ 𝜓))) |
12 | 2, 11 | impbid 127 | 1 ⊢ (∃!𝑥𝜑 → (∃𝑥(𝜑 ∧ 𝜓) ↔ ∀𝑥(𝜑 → 𝜓))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 102 ↔ wb 103 ∀wal 1282 ∃wex 1421 ∃!weu 1941 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 |
This theorem depends on definitions: df-bi 115 df-nf 1390 df-sb 1686 df-eu 1944 df-mo 1945 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |