![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > spcimgft | GIF version |
Description: A closed version of spcimgf 2817. (Contributed by Mario Carneiro, 4-Jan-2017.) |
Ref | Expression |
---|---|
spcimgft.1 | ⊢ Ⅎ𝑥𝜓 |
spcimgft.2 | ⊢ Ⅎ𝑥𝐴 |
Ref | Expression |
---|---|
spcimgft | ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 → 𝜓)) → (𝐴 ∈ 𝐵 → (∀𝑥𝜑 → 𝜓))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 2748 | . 2 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ V) | |
2 | spcimgft.2 | . . . . 5 ⊢ Ⅎ𝑥𝐴 | |
3 | 2 | issetf 2744 | . . . 4 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) |
4 | exim 1599 | . . . 4 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 → 𝜓)) → (∃𝑥 𝑥 = 𝐴 → ∃𝑥(𝜑 → 𝜓))) | |
5 | 3, 4 | biimtrid 152 | . . 3 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 → 𝜓)) → (𝐴 ∈ V → ∃𝑥(𝜑 → 𝜓))) |
6 | spcimgft.1 | . . . 4 ⊢ Ⅎ𝑥𝜓 | |
7 | 6 | 19.36-1 1673 | . . 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 1351 = wceq 1353 Ⅎwnf 1460 ∃wex 1492 ∈ wcel 2148 Ⅎwnfc 2306 Vcvv 2737 |
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-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-ext 2159 |
This theorem depends on definitions: df-bi 117 df-tru 1356 df-nf 1461 df-sb 1763 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-v 2739 |
This theorem is referenced by: spcgft 2814 spcimgf 2817 spcimdv 2821 |
Copyright terms: Public domain | W3C validator |