![]() |
Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > sbcies | Structured version Visualization version GIF version |
Description: A special version of class substitution commonly used for structures. (Contributed by Thierry Arnoux, 14-Mar-2019.) |
Ref | Expression |
---|---|
sbcies.a | ⊢ 𝐴 = (𝐸‘𝑊) |
sbcies.1 | ⊢ (𝑎 = 𝐴 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
sbcies | ⊢ (𝑤 = 𝑊 → ([(𝐸‘𝑤) / 𝑎]𝜓 ↔ 𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fvexd 6935 | . 2 ⊢ (𝑤 = 𝑊 → (𝐸‘𝑤) ∈ V) | |
2 | simpr 484 | . . . . 5 ⊢ ((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) → 𝑎 = (𝐸‘𝑤)) | |
3 | sbcies.a | . . . . . . 7 ⊢ 𝐴 = (𝐸‘𝑊) | |
4 | fveq2 6920 | . . . . . . 7 ⊢ (𝑤 = 𝑊 → (𝐸‘𝑤) = (𝐸‘𝑊)) | |
5 | 3, 4 | eqtr4id 2799 | . . . . . 6 ⊢ (𝑤 = 𝑊 → 𝐴 = (𝐸‘𝑤)) |
6 | 5 | adantr 480 | . . . . 5 ⊢ ((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) → 𝐴 = (𝐸‘𝑤)) |
7 | 2, 6 | eqtr4d 2783 | . . . 4 ⊢ ((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) → 𝑎 = 𝐴) |
8 | sbcies.1 | . . . 4 ⊢ (𝑎 = 𝐴 → (𝜑 ↔ 𝜓)) | |
9 | 7, 8 | syl 17 | . . 3 ⊢ ((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) → (𝜑 ↔ 𝜓)) |
10 | 9 | bicomd 223 | . 2 ⊢ ((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) → (𝜓 ↔ 𝜑)) |
11 | 1, 10 | sbcied 3850 | 1 ⊢ (𝑤 = 𝑊 → ([(𝐸‘𝑤) / 𝑎]𝜓 ↔ 𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 Vcvv 3488 [wsbc 3804 ‘cfv 6573 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 ax-nul 5324 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-ne 2947 df-rab 3444 df-v 3490 df-sbc 3805 df-dif 3979 df-un 3981 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-iota 6525 df-fv 6581 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |