![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > r19.3rm | GIF version |
Description: Restricted quantification of wff not containing quantified variable. (Contributed by Jim Kingdon, 19-Dec-2018.) |
Ref | Expression |
---|---|
r19.3rm.1 | ⊢ Ⅎ𝑥𝜑 |
Ref | Expression |
---|---|
r19.3rm | ⊢ (∃𝑦 𝑦 ∈ 𝐴 → (𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eleq1 2157 | . . 3 ⊢ (𝑎 = 𝑦 → (𝑎 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) | |
2 | 1 | cbvexv 1850 | . 2 ⊢ (∃𝑎 𝑎 ∈ 𝐴 ↔ ∃𝑦 𝑦 ∈ 𝐴) |
3 | eleq1 2157 | . . . 4 ⊢ (𝑎 = 𝑥 → (𝑎 ∈ 𝐴 ↔ 𝑥 ∈ 𝐴)) | |
4 | 3 | cbvexv 1850 | . . 3 ⊢ (∃𝑎 𝑎 ∈ 𝐴 ↔ ∃𝑥 𝑥 ∈ 𝐴) |
5 | biimt 240 | . . . 4 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (𝜑 ↔ (∃𝑥 𝑥 ∈ 𝐴 → 𝜑))) | |
6 | df-ral 2375 | . . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ ∀𝑥(𝑥 ∈ 𝐴 → 𝜑)) | |
7 | r19.3rm.1 | . . . . . 6 ⊢ Ⅎ𝑥𝜑 | |
8 | 7 | 19.23 1620 | . . . . 5 ⊢ (∀𝑥(𝑥 ∈ 𝐴 → 𝜑) ↔ (∃𝑥 𝑥 ∈ 𝐴 → 𝜑)) |
9 | 6, 8 | bitri 183 | . . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝜑 ↔ (∃𝑥 𝑥 ∈ 𝐴 → 𝜑)) |
10 | 5, 9 | syl6bbr 197 | . . 3 ⊢ (∃𝑥 𝑥 ∈ 𝐴 → (𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜑)) |
11 | 4, 10 | sylbi 120 | . 2 ⊢ (∃𝑎 𝑎 ∈ 𝐴 → (𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜑)) |
12 | 2, 11 | sylbir 134 | 1 ⊢ (∃𝑦 𝑦 ∈ 𝐴 → (𝜑 ↔ ∀𝑥 ∈ 𝐴 𝜑)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 104 ∀wal 1294 Ⅎwnf 1401 ∃wex 1433 ∈ wcel 1445 ∀wral 2370 |
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 ax-i5r 1480 ax-ext 2077 |
This theorem depends on definitions: df-bi 116 df-nf 1402 df-cleq 2088 df-clel 2091 df-ral 2375 |
This theorem is referenced by: r19.28m 3391 r19.3rmv 3392 r19.27m 3397 indstr 9180 |
Copyright terms: Public domain | W3C validator |