Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > spc3egv | GIF version |
Description: Existential specialization with 3 quantifiers, using implicit substitution. (Contributed by NM, 12-May-2008.) |
Ref | Expression |
---|---|
spc3egv.1 | ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
spc3egv | ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝜓 → ∃𝑥∃𝑦∃𝑧𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elisset 2568 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → ∃𝑥 𝑥 = 𝐴) | |
2 | elisset 2568 | . . . 4 ⊢ (𝐵 ∈ 𝑊 → ∃𝑦 𝑦 = 𝐵) | |
3 | elisset 2568 | . . . 4 ⊢ (𝐶 ∈ 𝑋 → ∃𝑧 𝑧 = 𝐶) | |
4 | 1, 2, 3 | 3anim123i 1089 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵 ∧ ∃𝑧 𝑧 = 𝐶)) |
5 | eeeanv 1808 | . . 3 ⊢ (∃𝑥∃𝑦∃𝑧(𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) ↔ (∃𝑥 𝑥 = 𝐴 ∧ ∃𝑦 𝑦 = 𝐵 ∧ ∃𝑧 𝑧 = 𝐶)) | |
6 | 4, 5 | sylibr 137 | . 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → ∃𝑥∃𝑦∃𝑧(𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶)) |
7 | spc3egv.1 | . . . . 5 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝜑 ↔ 𝜓)) | |
8 | 7 | biimprcd 149 | . . . 4 ⊢ (𝜓 → ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → 𝜑)) |
9 | 8 | eximdv 1760 | . . 3 ⊢ (𝜓 → (∃𝑧(𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → ∃𝑧𝜑)) |
10 | 9 | 2eximdv 1762 | . 2 ⊢ (𝜓 → (∃𝑥∃𝑦∃𝑧(𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → ∃𝑥∃𝑦∃𝑧𝜑)) |
11 | 6, 10 | syl5com 26 | 1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝐵 ∈ 𝑊 ∧ 𝐶 ∈ 𝑋) → (𝜓 → ∃𝑥∃𝑦∃𝑧𝜑)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 98 ∧ w3a 885 = wceq 1243 ∃wex 1381 ∈ wcel 1393 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 99 ax-ia2 100 ax-ia3 101 ax-5 1336 ax-7 1337 ax-gen 1338 ax-ie1 1382 ax-ie2 1383 ax-8 1395 ax-4 1400 ax-17 1419 ax-i9 1423 ax-ial 1427 ax-ext 2022 |
This theorem depends on definitions: df-bi 110 df-3an 887 df-nf 1350 df-sb 1646 df-clab 2027 df-cleq 2033 df-clel 2036 df-v 2559 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |