| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > csbpredg | Structured version Visualization version GIF version | ||
| Description: Move class substitution in and out of the predecessor class of a relation. (Contributed by ML, 25-Oct-2020.) |
| Ref | Expression |
|---|---|
| csbpredg | ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌Pred(𝑅, 𝐷, 𝑋) = Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, ⦋𝐴 / 𝑥⦌𝑋)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | csbin 4403 | . . 3 ⊢ ⦋𝐴 / 𝑥⦌(𝐷 ∩ (◡𝑅 “ {𝑋})) = (⦋𝐴 / 𝑥⦌𝐷 ∩ ⦋𝐴 / 𝑥⦌(◡𝑅 “ {𝑋})) | |
| 2 | csbima12 6079 | . . . . 5 ⊢ ⦋𝐴 / 𝑥⦌(◡𝑅 “ {𝑋}) = (⦋𝐴 / 𝑥⦌◡𝑅 “ ⦋𝐴 / 𝑥⦌{𝑋}) | |
| 3 | csbcnv 5870 | . . . . . . 7 ⊢ ◡⦋𝐴 / 𝑥⦌𝑅 = ⦋𝐴 / 𝑥⦌◡𝑅 | |
| 4 | 3 | imaeq1i 6057 | . . . . . 6 ⊢ (◡⦋𝐴 / 𝑥⦌𝑅 “ ⦋𝐴 / 𝑥⦌{𝑋}) = (⦋𝐴 / 𝑥⦌◡𝑅 “ ⦋𝐴 / 𝑥⦌{𝑋}) |
| 5 | csbsng 4672 | . . . . . . 7 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌{𝑋} = {⦋𝐴 / 𝑥⦌𝑋}) | |
| 6 | 5 | imaeq2d 6060 | . . . . . 6 ⊢ (𝐴 ∈ 𝑉 → (◡⦋𝐴 / 𝑥⦌𝑅 “ ⦋𝐴 / 𝑥⦌{𝑋}) = (◡⦋𝐴 / 𝑥⦌𝑅 “ {⦋𝐴 / 𝑥⦌𝑋})) |
| 7 | 4, 6 | eqtr3id 2811 | . . . . 5 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌◡𝑅 “ ⦋𝐴 / 𝑥⦌{𝑋}) = (◡⦋𝐴 / 𝑥⦌𝑅 “ {⦋𝐴 / 𝑥⦌𝑋})) |
| 8 | 2, 7 | eqtrid 2809 | . . . 4 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(◡𝑅 “ {𝑋}) = (◡⦋𝐴 / 𝑥⦌𝑅 “ {⦋𝐴 / 𝑥⦌𝑋})) |
| 9 | 8 | ineq2d 4169 | . . 3 ⊢ (𝐴 ∈ 𝑉 → (⦋𝐴 / 𝑥⦌𝐷 ∩ ⦋𝐴 / 𝑥⦌(◡𝑅 “ {𝑋})) = (⦋𝐴 / 𝑥⦌𝐷 ∩ (◡⦋𝐴 / 𝑥⦌𝑅 “ {⦋𝐴 / 𝑥⦌𝑋}))) |
| 10 | 1, 9 | eqtrid 2809 | . 2 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌(𝐷 ∩ (◡𝑅 “ {𝑋})) = (⦋𝐴 / 𝑥⦌𝐷 ∩ (◡⦋𝐴 / 𝑥⦌𝑅 “ {⦋𝐴 / 𝑥⦌𝑋}))) |
| 11 | df-pred 6303 | . . 3 ⊢ Pred(𝑅, 𝐷, 𝑋) = (𝐷 ∩ (◡𝑅 “ {𝑋})) | |
| 12 | 11 | csbeq2i 3858 | . 2 ⊢ ⦋𝐴 / 𝑥⦌Pred(𝑅, 𝐷, 𝑋) = ⦋𝐴 / 𝑥⦌(𝐷 ∩ (◡𝑅 “ {𝑋})) |
| 13 | df-pred 6303 | . 2 ⊢ Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, ⦋𝐴 / 𝑥⦌𝑋) = (⦋𝐴 / 𝑥⦌𝐷 ∩ (◡⦋𝐴 / 𝑥⦌𝑅 “ {⦋𝐴 / 𝑥⦌𝑋})) | |
| 14 | 10, 12, 13 | 3eqtr4g 2822 | 1 ⊢ (𝐴 ∈ 𝑉 → ⦋𝐴 / 𝑥⦌Pred(𝑅, 𝐷, 𝑋) = Pred(⦋𝐴 / 𝑥⦌𝑅, ⦋𝐴 / 𝑥⦌𝐷, ⦋𝐴 / 𝑥⦌𝑋)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 = wceq 1570 ∈ wcel 2145 ⦋csb 3850 ∩ cin 3901 {csn 4587 ◡ccnv 5658 “ cima 5662 Predcpred 6302 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-ext 2734 ax-sep 5255 ax-pr 5402 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-rab 3415 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-br 5108 df-opab 5172 df-xp 5665 df-cnv 5667 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-pred 6303 |
| This theorem is used by: csbfrecsg 8287 |
| Copyright terms: Public domain | W3C validator |