| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rspcimdv | Structured version Visualization version 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 3051 | . 2 ⊢ (∀𝑥 ∈ 𝐵 𝜓 ↔ ∀𝑥(𝑥 ∈ 𝐵 → 𝜓)) | |
| 2 | rspcimdv.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝐵) | |
| 3 | simpr 484 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝑥 = 𝐴) | |
| 4 | 3 | eleq1d 2820 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝑥 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵)) |
| 5 | 4 | biimprd 248 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝐴 ∈ 𝐵 → 𝑥 ∈ 𝐵)) |
| 6 | rspcimdv.2 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 → 𝜒)) | |
| 7 | 5, 6 | imim12d 81 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → ((𝑥 ∈ 𝐵 → 𝜓) → (𝐴 ∈ 𝐵 → 𝜒))) |
| 8 | 2, 7 | spcimdv 3546 | . . 3 ⊢ (𝜑 → (∀𝑥(𝑥 ∈ 𝐵 → 𝜓) → (𝐴 ∈ 𝐵 → 𝜒))) |
| 9 | 2, 8 | mpid 44 | . 2 ⊢ (𝜑 → (∀𝑥(𝑥 ∈ 𝐵 → 𝜓) → 𝜒)) |
| 10 | 1, 9 | biimtrid 242 | 1 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 𝜓 → 𝜒)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 ∀wal 1540 = wceq 1542 ∈ wcel 2114 ∀wral 3050 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2707 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2714 df-cleq 2727 df-clel 2810 df-ral 3051 |
| This theorem is referenced by: rspcimedv 3566 rspcdv 3567 wrd2ind 14648 mreexd 17567 mreexexlemd 17569 catcocl 17610 catass 17611 moni 17662 subccocl 17771 funcco 17797 fullfo 17840 fthf1 17845 nati 17884 acsfiindd 18478 chpscmat 22788 mpomulcn 24816 friendshipgt3 30454 lmxrge0 34088 funressnfv 47326 cfsetsnfsetf1 47342 |
| Copyright terms: Public domain | W3C validator |