| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > r19.2mOLD | GIF version | ||
| Description: Theorem 19.2 of [Margaris] p. 89 with restricted quantifiers (compare 19.2 1652). The restricted version is valid only when the domain of quantification is inhabited. (Contributed by Jim Kingdon, 5-Aug-2018.) Obsolete version of r19.2m 3537 as of 7-Apr-2023. (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| r19.2mOLD | ⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝜑) → ∃𝑥 ∈ 𝐴 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ral 2480 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)) | |
| 2 | exintr 1648 | . . . 4 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) → (∃𝑥 𝑥 ∈ 𝐴 → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))) | |
| 3 | 1, 2 | sylbi 121 | . . 3 ⊢ (∀𝑥 ∈ 𝐴 𝜑 → (∃𝑥 𝑥 ∈ 𝐴 → ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))) |
| 4 | df-rex 2481 | . . 3 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 5 | 3, 4 | imbitrrdi 162 | . 2 ⊢ (∀𝑥 ∈ 𝐴 𝜑 → (∃𝑥 𝑥 ∈ 𝐴 → ∃𝑥 ∈ 𝐴 𝜑)) |
| 6 | 5 | impcom 125 | 1 ⊢ ((∃𝑥 𝑥 ∈ 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝜑) → ∃𝑥 ∈ 𝐴 𝜑) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∀wal 1362 ∃wex 1506 ∈ wcel 2167 ∀wral 2475 ∃wrex 2476 |
| 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-5 1461 ax-gen 1463 ax-ie1 1507 ax-ie2 1508 ax-4 1524 ax-ial 1548 |
| This theorem depends on definitions: df-bi 117 df-ral 2480 df-rex 2481 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |