![]() |
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 6862 | . 2 ⊢ (𝑤 = 𝑊 → (𝐸‘𝑤) ∈ V) | |
2 | simpr 485 | . . . . 5 ⊢ ((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) → 𝑎 = (𝐸‘𝑤)) | |
3 | sbcies.a | . . . . . . 7 ⊢ 𝐴 = (𝐸‘𝑊) | |
4 | fveq2 6847 | . . . . . . 7 ⊢ (𝑤 = 𝑊 → (𝐸‘𝑤) = (𝐸‘𝑊)) | |
5 | 3, 4 | eqtr4id 2790 | . . . . . 6 ⊢ (𝑤 = 𝑊 → 𝐴 = (𝐸‘𝑤)) |
6 | 5 | adantr 481 | . . . . 5 ⊢ ((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) → 𝐴 = (𝐸‘𝑤)) |
7 | 2, 6 | eqtr4d 2774 | . . . 4 ⊢ ((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) → 𝑎 = 𝐴) |
8 | sbcies.1 | . . . 4 ⊢ (𝑎 = 𝐴 → (𝜑 ↔ 𝜓)) | |
9 | 7, 8 | syl 17 | . . 3 ⊢ ((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) → (𝜑 ↔ 𝜓)) |
10 | 9 | bicomd 222 | . 2 ⊢ ((𝑤 = 𝑊 ∧ 𝑎 = (𝐸‘𝑤)) → (𝜓 ↔ 𝜑)) |
11 | 1, 10 | sbcied 3787 | 1 ⊢ (𝑤 = 𝑊 → ([(𝐸‘𝑤) / 𝑎]𝜓 ↔ 𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 396 = wceq 1541 Vcvv 3446 [wsbc 3742 ‘cfv 6501 |
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 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2702 ax-nul 5268 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-clab 2709 df-cleq 2723 df-clel 2809 df-ne 2940 df-rab 3406 df-v 3448 df-sbc 3743 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4288 df-if 4492 df-sn 4592 df-pr 4594 df-op 4598 df-uni 4871 df-br 5111 df-iota 6453 df-fv 6509 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |