Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > ecinxp | Structured version Visualization version GIF version |
Description: Restrict the relation in an equivalence class to a base set. (Contributed by Mario Carneiro, 10-Jul-2015.) |
Ref | Expression |
---|---|
ecinxp | ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → [𝐵]𝑅 = [𝐵](𝑅 ∩ (𝐴 × 𝐴))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simpr 488 | . . . . . . . 8 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵 ∈ 𝐴) | |
2 | 1 | snssd 4697 | . . . . . . 7 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → {𝐵} ⊆ 𝐴) |
3 | df-ss 3860 | . . . . . . 7 ⊢ ({𝐵} ⊆ 𝐴 ↔ ({𝐵} ∩ 𝐴) = {𝐵}) | |
4 | 2, 3 | sylib 221 | . . . . . 6 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → ({𝐵} ∩ 𝐴) = {𝐵}) |
5 | 4 | imaeq2d 5903 | . . . . 5 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑅 “ ({𝐵} ∩ 𝐴)) = (𝑅 “ {𝐵})) |
6 | 5 | ineq1d 4102 | . . . 4 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝑅 “ ({𝐵} ∩ 𝐴)) ∩ 𝐴) = ((𝑅 “ {𝐵}) ∩ 𝐴)) |
7 | imass2 5939 | . . . . . . 7 ⊢ ({𝐵} ⊆ 𝐴 → (𝑅 “ {𝐵}) ⊆ (𝑅 “ 𝐴)) | |
8 | 2, 7 | syl 17 | . . . . . 6 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑅 “ {𝐵}) ⊆ (𝑅 “ 𝐴)) |
9 | simpl 486 | . . . . . 6 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑅 “ 𝐴) ⊆ 𝐴) | |
10 | 8, 9 | sstrd 3887 | . . . . 5 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑅 “ {𝐵}) ⊆ 𝐴) |
11 | df-ss 3860 | . . . . 5 ⊢ ((𝑅 “ {𝐵}) ⊆ 𝐴 ↔ ((𝑅 “ {𝐵}) ∩ 𝐴) = (𝑅 “ {𝐵})) | |
12 | 10, 11 | sylib 221 | . . . 4 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝑅 “ {𝐵}) ∩ 𝐴) = (𝑅 “ {𝐵})) |
13 | 6, 12 | eqtr2d 2774 | . . 3 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑅 “ {𝐵}) = ((𝑅 “ ({𝐵} ∩ 𝐴)) ∩ 𝐴)) |
14 | imainrect 6013 | . . 3 ⊢ ((𝑅 ∩ (𝐴 × 𝐴)) “ {𝐵}) = ((𝑅 “ ({𝐵} ∩ 𝐴)) ∩ 𝐴) | |
15 | 13, 14 | eqtr4di 2791 | . 2 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑅 “ {𝐵}) = ((𝑅 ∩ (𝐴 × 𝐴)) “ {𝐵})) |
16 | df-ec 8322 | . 2 ⊢ [𝐵]𝑅 = (𝑅 “ {𝐵}) | |
17 | df-ec 8322 | . 2 ⊢ [𝐵](𝑅 ∩ (𝐴 × 𝐴)) = ((𝑅 ∩ (𝐴 × 𝐴)) “ {𝐵}) | |
18 | 15, 16, 17 | 3eqtr4g 2798 | 1 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → [𝐵]𝑅 = [𝐵](𝑅 ∩ (𝐴 × 𝐴))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 = wceq 1542 ∈ wcel 2114 ∩ cin 3842 ⊆ wss 3843 {csn 4516 × cxp 5523 “ cima 5528 [cec 8318 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2020 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2162 ax-12 2179 ax-ext 2710 ax-sep 5167 ax-nul 5174 ax-pr 5296 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2075 df-clab 2717 df-cleq 2730 df-clel 2811 df-ral 3058 df-rex 3059 df-rab 3062 df-v 3400 df-dif 3846 df-un 3848 df-in 3850 df-ss 3860 df-nul 4212 df-if 4415 df-sn 4517 df-pr 4519 df-op 4523 df-br 5031 df-opab 5093 df-xp 5531 df-rel 5532 df-cnv 5533 df-dm 5535 df-rn 5536 df-res 5537 df-ima 5538 df-ec 8322 |
This theorem is referenced by: qsinxp 8404 qusin 16920 pi1addval 23800 pi1grplem 23801 |
Copyright terms: Public domain | W3C validator |