| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > ecinxp | 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 110 | . . . . . . . 8 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵 ∈ 𝐴) | |
| 2 | 1 | snssd 3813 | . . . . . . 7 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → {𝐵} ⊆ 𝐴) |
| 3 | df-ss 3210 | . . . . . . 7 ⊢ ({𝐵} ⊆ 𝐴 ↔ ({𝐵} ∩ 𝐴) = {𝐵}) | |
| 4 | 2, 3 | sylib 122 | . . . . . 6 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → ({𝐵} ∩ 𝐴) = {𝐵}) |
| 5 | 4 | imaeq2d 5068 | . . . . 5 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑅 “ ({𝐵} ∩ 𝐴)) = (𝑅 “ {𝐵})) |
| 6 | 5 | ineq1d 3404 | . . . 4 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝑅 “ ({𝐵} ∩ 𝐴)) ∩ 𝐴) = ((𝑅 “ {𝐵}) ∩ 𝐴)) |
| 7 | imass2 5104 | . . . . . . 7 ⊢ ({𝐵} ⊆ 𝐴 → (𝑅 “ {𝐵}) ⊆ (𝑅 “ 𝐴)) | |
| 8 | 2, 7 | syl 14 | . . . . . 6 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑅 “ {𝐵}) ⊆ (𝑅 “ 𝐴)) |
| 9 | simpl 109 | . . . . . 6 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑅 “ 𝐴) ⊆ 𝐴) | |
| 10 | 8, 9 | sstrd 3234 | . . . . 5 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑅 “ {𝐵}) ⊆ 𝐴) |
| 11 | df-ss 3210 | . . . . 5 ⊢ ((𝑅 “ {𝐵}) ⊆ 𝐴 ↔ ((𝑅 “ {𝐵}) ∩ 𝐴) = (𝑅 “ {𝐵})) | |
| 12 | 10, 11 | sylib 122 | . . . 4 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝑅 “ {𝐵}) ∩ 𝐴) = (𝑅 “ {𝐵})) |
| 13 | 6, 12 | eqtr2d 2263 | . . 3 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑅 “ {𝐵}) = ((𝑅 “ ({𝐵} ∩ 𝐴)) ∩ 𝐴)) |
| 14 | imainrect 5174 | . . 3 ⊢ ((𝑅 ∩ (𝐴 × 𝐴)) “ {𝐵}) = ((𝑅 “ ({𝐵} ∩ 𝐴)) ∩ 𝐴) | |
| 15 | 13, 14 | eqtr4di 2280 | . 2 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑅 “ {𝐵}) = ((𝑅 ∩ (𝐴 × 𝐴)) “ {𝐵})) |
| 16 | df-ec 6690 | . 2 ⊢ [𝐵]𝑅 = (𝑅 “ {𝐵}) | |
| 17 | df-ec 6690 | . 2 ⊢ [𝐵](𝑅 ∩ (𝐴 × 𝐴)) = ((𝑅 ∩ (𝐴 × 𝐴)) “ {𝐵}) | |
| 18 | 15, 16, 17 | 3eqtr4g 2287 | 1 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → [𝐵]𝑅 = [𝐵](𝑅 ∩ (𝐴 × 𝐴))) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 = wceq 1395 ∈ wcel 2200 ∩ cin 3196 ⊆ wss 3197 {csn 3666 × cxp 4717 “ cima 4722 [cec 6686 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 714 ax-5 1493 ax-7 1494 ax-gen 1495 ax-ie1 1539 ax-ie2 1540 ax-8 1550 ax-10 1551 ax-11 1552 ax-i12 1553 ax-bndl 1555 ax-4 1556 ax-17 1572 ax-i9 1576 ax-ial 1580 ax-i5r 1581 ax-14 2203 ax-ext 2211 ax-sep 4202 ax-pow 4258 ax-pr 4293 |
| This theorem depends on definitions: df-bi 117 df-3an 1004 df-tru 1398 df-nf 1507 df-sb 1809 df-eu 2080 df-mo 2081 df-clab 2216 df-cleq 2222 df-clel 2225 df-nfc 2361 df-ral 2513 df-rex 2514 df-v 2801 df-un 3201 df-in 3203 df-ss 3210 df-pw 3651 df-sn 3672 df-pr 3673 df-op 3675 df-br 4084 df-opab 4146 df-xp 4725 df-rel 4726 df-cnv 4727 df-dm 4729 df-rn 4730 df-res 4731 df-ima 4732 df-ec 6690 |
| This theorem is referenced by: qsinxp 6766 nqnq0pi 7633 qusin 13367 |
| Copyright terms: Public domain | W3C validator |