Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rspcdf | Structured version Visualization version GIF version |
Description: Restricted specialization, using implicit substitution. (Contributed by Emmett Weisz, 16-Jan-2020.) |
Ref | Expression |
---|---|
rspcdf.1 | ⊢ Ⅎ𝑥𝜑 |
rspcdf.2 | ⊢ Ⅎ𝑥𝜒 |
rspcdf.3 | ⊢ (𝜑 → 𝐴 ∈ 𝐵) |
rspcdf.4 | ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 ↔ 𝜒)) |
Ref | Expression |
---|---|
rspcdf | ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 𝜓 → 𝜒)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | rspcdf.1 | . . 3 ⊢ Ⅎ𝑥𝜑 | |
2 | rspcdf.4 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 ↔ 𝜒)) | |
3 | 2 | ex 413 | . . 3 ⊢ (𝜑 → (𝑥 = 𝐴 → (𝜓 ↔ 𝜒))) |
4 | 1, 3 | alrimi 2206 | . 2 ⊢ (𝜑 → ∀𝑥(𝑥 = 𝐴 → (𝜓 ↔ 𝜒))) |
5 | rspcdf.3 | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝐵) | |
6 | rspcdf.2 | . . 3 ⊢ Ⅎ𝑥𝜒 | |
7 | 6 | rspct 3547 | . 2 ⊢ (∀𝑥(𝑥 = 𝐴 → (𝜓 ↔ 𝜒)) → (𝐴 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 𝜓 → 𝜒))) |
8 | 4, 5, 7 | sylc 65 | 1 ⊢ (𝜑 → (∀𝑥 ∈ 𝐵 𝜓 → 𝜒)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 ∀wal 1537 = wceq 1539 Ⅎwnf 1786 ∈ wcel 2106 ∀wral 3064 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-10 2137 ax-11 2154 ax-12 2171 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-tru 1542 df-ex 1783 df-nf 1787 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-nfc 2889 df-ral 3069 df-v 3434 |
This theorem is referenced by: rspc2daf 30816 |
Copyright terms: Public domain | W3C validator |