| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > r19.9rmv | GIF version | ||
| Description: Restricted quantification of wff not containing quantified variable. (Contributed by Jim Kingdon, 5-Aug-2018.) |
| Ref | Expression |
|---|---|
| r19.9rmv | ⊢ (∃𝑦 𝑦 ∈ 𝐴 → (𝜑 ↔ ∃𝑥 ∈ 𝐴 𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq1 2267 | . . 3 ⊢ (𝑎 = 𝑦 → (𝑎 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) | |
| 2 | 1 | cbvexv 1941 | . 2 ⊢ (∃𝑎 𝑎 ∈ 𝐴 ↔ ∃𝑦 𝑦 ∈ 𝐴) |
| 3 | eleq1 2267 | . . . 4 ⊢ (𝑎 = 𝑥 → (𝑎 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴)) | |
| 4 | 3 | cbvexv 1941 | . . 3 ⊢ (∃𝑎 𝑎 ∈ 𝐴 ↔ ∃𝑥 𝑥 ∈ 𝐴) |
| 5 | df-rex 2489 | . . . . 5 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 6 | 19.41v 1925 | . . . . 5 ⊢ (∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (∃𝑥 𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 7 | 5, 6 | bitri 184 | . . . 4 ⊢ (∃𝑥 ∈ 𝐴 𝜑 ↔ (∃𝑥 𝑥 ∈ 𝐴 ∧ 𝜑)) |
| 8 | 7 | baibr 921 | . . 3 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (𝜑 ↔ ∃𝑥 ∈ 𝐴 𝜑)) |
| 9 | 4, 8 | sylbi 121 | . 2 ⊢ (∃𝑎 𝑎 ∈ 𝐴 → (𝜑 ↔ ∃𝑥 ∈ 𝐴 𝜑)) |
| 10 | 2, 9 | sylbir 135 | 1 ⊢ (∃𝑦 𝑦 ∈ 𝐴 → (𝜑 ↔ ∃𝑥 ∈ 𝐴 𝜑)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ↔ wb 105 ∃wex 1514 ∈ wcel 2175 ∃wrex 2484 |
| 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 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-ext 2186 |
| This theorem depends on definitions: df-bi 117 df-cleq 2197 df-clel 2200 df-rex 2489 |
| This theorem is referenced by: r19.45mv 3553 r19.44mv 3554 iunconstm 3934 fconstfvm 5801 frecabcl 6484 ltexprlemloc 7719 lcmgcdlem 12341 dvdsr02 13809 |
| Copyright terms: Public domain | W3C validator |