| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > csbiedf | Structured version Visualization version GIF version | ||
| Description: Conversion of implicit substitution to explicit substitution into a class. (Contributed by Mario Carneiro, 13-Oct-2016.) |
| Ref | Expression |
|---|---|
| csbiedf.1 | ⊢ Ⅎ𝑥𝜑 |
| csbiedf.2 | ⊢ (𝜑 → Ⅎ𝑥𝐶) |
| csbiedf.3 | ⊢ (𝜑 → 𝐴 ∈ 𝑉) |
| csbiedf.4 | ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 = 𝐶) |
| Ref | Expression |
|---|---|
| csbiedf | ⊢ (𝜑 → ⦋𝐴 / 𝑥⦌𝐵 = 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | csbiedf.1 | . . 3 ⊢ Ⅎ𝑥𝜑 | |
| 2 | csbiedf.4 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → 𝐵 = 𝐶) | |
| 3 | 2 | ex 417 | . . 3 ⊢ (𝜑 → (𝑥 = 𝐴 → 𝐵 = 𝐶)) |
| 4 | 1, 3 | alrimi 2255 | . 2 ⊢ (𝜑 → ∀𝑥(𝑥 = 𝐴 → 𝐵 = 𝐶)) |
| 5 | csbiedf.3 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝑉) | |
| 6 | csbiedf.2 | . . 3 ⊢ (𝜑 → Ⅎ𝑥𝐶) | |
| 7 | csbiebt 3890 | . . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ Ⅎ𝑥𝐶) → (∀𝑥(𝑥 = 𝐴 → 𝐵 = 𝐶) ↔ ⦋𝐴 / 𝑥⦌𝐵 = 𝐶)) | |
| 8 | 5, 6, 7 | syl2anc 595 | . 2 ⊢ (𝜑 → (∀𝑥(𝑥 = 𝐴 → 𝐵 = 𝐶) ↔ ⦋𝐴 / 𝑥⦌𝐵 = 𝐶)) |
| 9 | 4, 8 | mpbid 235 | 1 ⊢ (𝜑 → ⦋𝐴 / 𝑥⦌𝐵 = 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 ∀wal 1565 = wceq 1567 Ⅎwnf 1810 ∈ wcel 2149 Ⅎwnfc 2916 ⦋csb 3861 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-ex 1807 df-nf 1811 df-sb 2098 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-v 3465 df-sbc 3754 df-csb 3862 |
| This theorem is referenced by: csbie2t 3899 fvmptdf 6994 fsumsplit1 15792 fprodsplit1f 16040 natpropd 18032 fucpropd 18033 gsummptf1o 20029 gsummpt2d 33306 gsummptf1od 33312 gsummptfsf1o 33317 mnringvald 44822 sumsnd 45631 |
| Copyright terms: Public domain | W3C validator |