| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > spcgft | GIF version | ||
| Description: A closed version of spcgf 2888. (Contributed by Andrew Salmon, 6-Jun-2011.) (Revised by Mario Carneiro, 4-Jan-2017.) |
| Ref | Expression |
|---|---|
| spcimgft.1 | ⊢ Ⅎ𝑥𝜓 |
| spcimgft.2 | ⊢ Ⅎ𝑥𝐴 |
| Ref | Expression |
|---|---|
| spcgft | ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) → (𝐴 ∈ 𝐵 → (∀𝑥𝜑 → 𝜓))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | biimp 118 | . . . 4 ⊢ ((𝜑 ↔ 𝜓) → (𝜑 → 𝜓)) | |
| 2 | 1 | imim2i 12 | . . 3 ⊢ ((𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) → (𝑥 = 𝐴 → (𝜑 → 𝜓))) |
| 3 | 2 | alimi 1503 | . 2 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) → ∀𝑥(𝑥 = 𝐴 → (𝜑 → 𝜓))) |
| 4 | spcimgft.1 | . . 3 ⊢ Ⅎ𝑥𝜓 | |
| 5 | spcimgft.2 | . . 3 ⊢ Ⅎ𝑥𝐴 | |
| 6 | 4, 5 | spcimgft 2882 | . 2 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 → 𝜓)) → (𝐴 ∈ 𝐵 → (∀𝑥𝜑 → 𝜓))) |
| 7 | 3, 6 | syl 14 | 1 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) → (𝐴 ∈ 𝐵 → (∀𝑥𝜑 → 𝜓))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 ∀wal 1395 = wceq 1397 Ⅎwnf 1508 ∈ wcel 2202 Ⅎwnfc 2361 |
| 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 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-v 2804 |
| This theorem is referenced by: spcgf 2888 rspct 2903 |
| Copyright terms: Public domain | W3C validator |