Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > spcimgft | GIF version |
Description: A closed version of spcimgf 2678. (Contributed by Mario Carneiro, 4-Jan-2017.) |
Ref | Expression |
---|---|
spcimgft.1 | ⊢ Ⅎ𝑥𝜓 |
spcimgft.2 | ⊢ Ⅎ𝑥𝐴 |
Ref | Expression |
---|---|
spcimgft | ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 → 𝜓)) → (𝐴 ∈ 𝐵 → (∀𝑥𝜑 → 𝜓))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 2610 | . 2 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ V) | |
2 | spcimgft.2 | . . . . 5 ⊢ Ⅎ𝑥𝐴 | |
3 | 2 | issetf 2606 | . . . 4 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) |
4 | exim 1530 | . . . 4 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 → 𝜓)) → (∃𝑥 𝑥 = 𝐴 → ∃𝑥(𝜑 → 𝜓))) | |
5 | 3, 4 | syl5bi 150 | . . 3 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 → 𝜓)) → (𝐴 ∈ V → ∃𝑥(𝜑 → 𝜓))) |
6 | spcimgft.1 | . . . 4 ⊢ Ⅎ𝑥𝜓 | |
7 | 6 | 19.36-1 1603 | . . 3 ⊢ (∃𝑥(𝜑 → 𝜓) → (∀𝑥𝜑 → 𝜓)) |
8 | 5, 7 | syl6 33 | . 2 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 → 𝜓)) → (𝐴 ∈ V → (∀𝑥𝜑 → 𝜓))) |
9 | 1, 8 | syl5 32 | 1 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 → 𝜓)) → (𝐴 ∈ 𝐵 → (∀𝑥𝜑 → 𝜓))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∀wal 1282 = wceq 1284 Ⅎwnf 1389 ∃wex 1421 ∈ wcel 1433 Ⅎwnfc 2206 Vcvv 2601 |
This theorem was proved from axioms: ax-1 5 ax-2 6 ax-mp 7 ax-ia1 104 ax-ia2 105 ax-ia3 106 ax-io 662 ax-5 1376 ax-7 1377 ax-gen 1378 ax-ie1 1422 ax-ie2 1423 ax-8 1435 ax-10 1436 ax-11 1437 ax-i12 1438 ax-bndl 1439 ax-4 1440 ax-17 1459 ax-i9 1463 ax-ial 1467 ax-i5r 1468 ax-ext 2063 |
This theorem depends on definitions: df-bi 115 df-tru 1287 df-nf 1390 df-sb 1686 df-clab 2068 df-cleq 2074 df-clel 2077 df-nfc 2208 df-v 2603 |
This theorem is referenced by: spcgft 2675 spcimgf 2678 spcimdv 2682 |
Copyright terms: Public domain | W3C validator |