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 109 | . . . . . . . 8 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → 𝐵 ∈ 𝐴) | |
2 | 1 | snssd 3718 | . . . . . . 7 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → {𝐵} ⊆ 𝐴) |
3 | df-ss 3129 | . . . . . . 7 ⊢ ({𝐵} ⊆ 𝐴 ↔ ({𝐵} ∩ 𝐴) = {𝐵}) | |
4 | 2, 3 | sylib 121 | . . . . . 6 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → ({𝐵} ∩ 𝐴) = {𝐵}) |
5 | 4 | imaeq2d 4946 | . . . . 5 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑅 “ ({𝐵} ∩ 𝐴)) = (𝑅 “ {𝐵})) |
6 | 5 | ineq1d 3322 | . . . 4 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝑅 “ ({𝐵} ∩ 𝐴)) ∩ 𝐴) = ((𝑅 “ {𝐵}) ∩ 𝐴)) |
7 | imass2 4980 | . . . . . . 7 ⊢ ({𝐵} ⊆ 𝐴 → (𝑅 “ {𝐵}) ⊆ (𝑅 “ 𝐴)) | |
8 | 2, 7 | syl 14 | . . . . . 6 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑅 “ {𝐵}) ⊆ (𝑅 “ 𝐴)) |
9 | simpl 108 | . . . . . 6 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑅 “ 𝐴) ⊆ 𝐴) | |
10 | 8, 9 | sstrd 3152 | . . . . 5 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑅 “ {𝐵}) ⊆ 𝐴) |
11 | df-ss 3129 | . . . . 5 ⊢ ((𝑅 “ {𝐵}) ⊆ 𝐴 ↔ ((𝑅 “ {𝐵}) ∩ 𝐴) = (𝑅 “ {𝐵})) | |
12 | 10, 11 | sylib 121 | . . . 4 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → ((𝑅 “ {𝐵}) ∩ 𝐴) = (𝑅 “ {𝐵})) |
13 | 6, 12 | eqtr2d 2199 | . . 3 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑅 “ {𝐵}) = ((𝑅 “ ({𝐵} ∩ 𝐴)) ∩ 𝐴)) |
14 | imainrect 5049 | . . 3 ⊢ ((𝑅 ∩ (𝐴 × 𝐴)) “ {𝐵}) = ((𝑅 “ ({𝐵} ∩ 𝐴)) ∩ 𝐴) | |
15 | 13, 14 | eqtr4di 2217 | . 2 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → (𝑅 “ {𝐵}) = ((𝑅 ∩ (𝐴 × 𝐴)) “ {𝐵})) |
16 | df-ec 6503 | . 2 ⊢ [𝐵]𝑅 = (𝑅 “ {𝐵}) | |
17 | df-ec 6503 | . 2 ⊢ [𝐵](𝑅 ∩ (𝐴 × 𝐴)) = ((𝑅 ∩ (𝐴 × 𝐴)) “ {𝐵}) | |
18 | 15, 16, 17 | 3eqtr4g 2224 | 1 ⊢ (((𝑅 “ 𝐴) ⊆ 𝐴 ∧ 𝐵 ∈ 𝐴) → [𝐵]𝑅 = [𝐵](𝑅 ∩ (𝐴 × 𝐴))) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 = wceq 1343 ∈ wcel 2136 ∩ cin 3115 ⊆ wss 3116 {csn 3576 × cxp 4602 “ cima 4607 [cec 6499 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-io 699 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-10 1493 ax-11 1494 ax-i12 1495 ax-bndl 1497 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-14 2139 ax-ext 2147 ax-sep 4100 ax-pow 4153 ax-pr 4187 |
This theorem depends on definitions: df-bi 116 df-3an 970 df-tru 1346 df-nf 1449 df-sb 1751 df-eu 2017 df-mo 2018 df-clab 2152 df-cleq 2158 df-clel 2161 df-nfc 2297 df-ral 2449 df-rex 2450 df-v 2728 df-un 3120 df-in 3122 df-ss 3129 df-pw 3561 df-sn 3582 df-pr 3583 df-op 3585 df-br 3983 df-opab 4044 df-xp 4610 df-rel 4611 df-cnv 4612 df-dm 4614 df-rn 4615 df-res 4616 df-ima 4617 df-ec 6503 |
This theorem is referenced by: qsinxp 6577 nqnq0pi 7379 |
Copyright terms: Public domain | W3C validator |