Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > spcimgft | GIF version |
Description: A closed version of spcimgf 2766. (Contributed by Mario Carneiro, 4-Jan-2017.) |
Ref | Expression |
---|---|
spcimgft.1 | ⊢ Ⅎ𝑥𝜓 |
spcimgft.2 | ⊢ Ⅎ𝑥𝐴 |
Ref | Expression |
---|---|
spcimgft | ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 → 𝜓)) → (𝐴 ∈ 𝐵 → (∀𝑥𝜑 → 𝜓))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 2697 | . 2 ⊢ (𝐴 ∈ 𝐵 → 𝐴 ∈ V) | |
2 | spcimgft.2 | . . . . 5 ⊢ Ⅎ𝑥𝐴 | |
3 | 2 | issetf 2693 | . . . 4 ⊢ (𝐴 ∈ V ↔ ∃𝑥 𝑥 = 𝐴) |
4 | exim 1578 | . . . 4 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 → 𝜓)) → (∃𝑥 𝑥 = 𝐴 → ∃𝑥(𝜑 → 𝜓))) | |
5 | 3, 4 | syl5bi 151 | . . 3 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 → 𝜓)) → (𝐴 ∈ V → ∃𝑥(𝜑 → 𝜓))) |
6 | spcimgft.1 | . . . 4 ⊢ Ⅎ𝑥𝜓 | |
7 | 6 | 19.36-1 1651 | . . 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 1329 = wceq 1331 Ⅎwnf 1436 ∃wex 1468 ∈ wcel 1480 Ⅎwnfc 2268 Vcvv 2686 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 698 ax-5 1423 ax-7 1424 ax-gen 1425 ax-ie1 1469 ax-ie2 1470 ax-8 1482 ax-10 1483 ax-11 1484 ax-i12 1485 ax-bndl 1486 ax-4 1487 ax-17 1506 ax-i9 1510 ax-ial 1514 ax-i5r 1515 ax-ext 2121 |
This theorem depends on definitions: df-bi 116 df-tru 1334 df-nf 1437 df-sb 1736 df-clab 2126 df-cleq 2132 df-clel 2135 df-nfc 2270 df-v 2688 |
This theorem is referenced by: spcgft 2763 spcimgf 2766 spcimdv 2770 |
Copyright terms: Public domain | W3C validator |