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 3063 | . 2 ⊢ (∀𝑥 ∈ 𝐵 𝜓 ↔ ∀𝑥(𝑥 ∈ 𝐵 → 𝜓)) | |
2 | rspcimdv.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝐵) | |
3 | simpr 486 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝑥 = 𝐴) | |
4 | 3 | eleq1d 2821 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝑥 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵)) |
5 | 4 | biimprd 248 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝐴 ∈ 𝐵 → 𝑥 ∈ 𝐵)) |
6 | rspcimdv.2 | . . . . 5 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 → 𝜒)) | |
7 | 5, 6 | imim12d 81 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → ((𝑥 ∈ 𝐵 → 𝜓) → (𝐴 ∈ 𝐵 → 𝜒))) |
8 | 2, 7 | spcimdv 3537 | . . 3 ⊢ (𝜑 → (∀𝑥(𝑥 ∈ 𝐵 → 𝜓) → (𝐴 ∈ 𝐵 → 𝜒))) |
9 | 2, 8 | mpid 44 | . 2 ⊢ (𝜑 → (∀𝑥(𝑥 ∈ 𝐵 → 𝜓) → 𝜒)) |
10 | 1, 9 | biimtrid 241 | 1 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 𝜓 → 𝜒)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 ∀wal 1537 = wceq 1539 ∈ wcel 2104 ∀wral 3062 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-ext 2707 |
This theorem depends on definitions: df-bi 206 df-an 398 df-tru 1542 df-ex 1780 df-sb 2066 df-clab 2714 df-cleq 2728 df-clel 2814 df-ral 3063 |
This theorem is referenced by: rspcimedv 3557 rspcdv 3558 wrd2ind 14485 mreexd 17400 mreexexlemd 17402 catcocl 17443 catass 17444 moni 17497 subccocl 17609 funcco 17635 fullfo 17677 fthf1 17682 nati 17720 acsfiindd 18320 chpscmat 22040 friendshipgt3 28811 lmxrge0 31951 funressnfv 44781 cfsetsnfsetf1 44797 |
Copyright terms: Public domain | W3C validator |