![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > r19.2m | GIF version |
Description: Theorem 19.2 of [Margaris] p. 89 with restricted quantifiers (compare 19.2 1581). The restricted version is valid only when the domain of quantification is inhabited. (Contributed by Jim Kingdon, 5-Aug-2018.) (Revised by Jim Kingdon, 7-Apr-2023.) |
Ref | Expression |
---|---|
r19.2m | ⊢ ((∃𝑦 𝑦 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝜑) → ∃𝑥 ∈ 𝐴 𝜑) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eleq1w 2155 | . . . 4 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴)) | |
2 | 1 | cbvexv 1850 | . . 3 ⊢ (∃𝑥 𝑥 ∈ 𝐴 ↔ ∃𝑧 𝑧 ∈ 𝐴) |
3 | eleq1w 2155 | . . . 4 ⊢ (𝑧 = 𝑦 → (𝑧 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) | |
4 | 3 | cbvexv 1850 | . . 3 ⊢ (∃𝑧 𝑧 ∈ 𝐴 ↔ ∃𝑦 𝑦 ∈ 𝐴) |
5 | 2, 4 | bitri 183 | . 2 ⊢ (∃𝑥 𝑥 ∈ 𝐴 ↔ ∃𝑦 𝑦 ∈ 𝐴) |
6 | df-ral 2375 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)) | |
7 | exintr 1577 | . . . . 5 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) → (∃𝑥 𝑥 ∈ 𝐴 → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))) | |
8 | 6, 7 | sylbi 120 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝜑 → (∃𝑥 𝑥 ∈ 𝐴 → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))) |
9 | df-rex 2376 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
10 | 8, 9 | syl6ibr 161 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝜑 → (∃𝑥 𝑥 ∈ 𝐴 → ∃𝑥 ∈ 𝐴 𝜑)) |
11 | 10 | impcom 124 | . 2 ⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝜑) → ∃𝑥 ∈ 𝐴 𝜑) |
12 | 5, 11 | sylanbr 280 | 1 ⊢ ((∃𝑦 𝑦 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝜑) → ∃𝑥 ∈ 𝐴 𝜑) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∀wal 1294 ∃wex 1433 ∈ wcel 1445 ∀wral 2370 ∃wrex 2371 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-5 1388 ax-7 1389 ax-gen 1390 ax-ie1 1434 ax-ie2 1435 ax-8 1447 ax-4 1452 ax-17 1471 ax-i9 1475 ax-ial 1479 |
This theorem depends on definitions: df-bi 116 df-clel 2091 df-ral 2375 df-rex 2376 |
This theorem is referenced by: intssunim 3732 riinm 3824 iinexgm 4011 xpiindim 4604 cnviinm 5006 eusvobj2 5676 iinerm 6404 rexfiuz 10537 r19.2uz 10541 climuni 10836 cncnp2m 12082 |
Copyright terms: Public domain | W3C validator |