| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > rspcimdv | GIF version | ||
| Description: Restricted specialization, using implicit substitution. (Contributed by Mario Carneiro, 4-Jan-2017.) |
| Ref | Expression |
|---|---|
| rspcimdv.1 | ⊢ (𝜑 → 𝐴 ∈ 𝐵) |
| rspcimdv.2 | ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 → 𝜒)) |
| Ref | Expression |
|---|---|
| rspcimdv | ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 𝜓 → 𝜒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-ral 2513 | . 2 ⊢ (∀𝑥 ∈ 𝐵 𝜓 ↔ ∀𝑥(𝑥 ∈ 𝐵 → 𝜓)) | |
| 2 | rspcimdv.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝐵) | |
| 3 | simpr 110 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝑥 = 𝐴) | |
| 4 | 3 | eleq1d 2298 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝑥 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵)) |
| 5 | 4 | biimprd 158 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝐴 ∈ 𝐵 → 𝑥 ∈ 𝐵)) |
| 6 | rspcimdv.2 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 → 𝜒)) | |
| 7 | 5, 6 | imim12d 74 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → ((𝑥 ∈ 𝐵 → 𝜓) → (𝐴 ∈ 𝐵 → 𝜒))) |
| 8 | 2, 7 | spcimdv 2887 | . . 3 ⊢ (𝜑 → (∀𝑥(𝑥 ∈ 𝐵 → 𝜓) → (𝐴 ∈ 𝐵 → 𝜒))) |
| 9 | 2, 8 | mpid 42 | . 2 ⊢ (𝜑 → (∀𝑥(𝑥 ∈ 𝐵 → 𝜓) → 𝜒)) |
| 10 | 1, 9 | biimtrid 152 | 1 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 𝜓 → 𝜒)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∀wal 1393 = wceq 1395 ∈ wcel 2200 ∀wral 2508 |
| 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 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-ext 2211 |
| This theorem depends on definitions: df-bi 117 df-tru 1398 df-nf 1507 df-sb 1809 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-v 2801 |
| This theorem is referenced by: rspcdv 2910 wrd2ind 11255 mpomulcn 15240 |
| Copyright terms: Public domain | W3C validator |