| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cnvresima | Structured version Visualization version GIF version | ||
| Description: An image under the converse of a restriction. (Contributed by Jeff Hankins, 12-Jul-2009.) |
| Ref | Expression |
|---|---|
| cnvresima | ⊢ (◡(𝐹 ↾ 𝐴) “ 𝐵) = ((◡𝐹 “ 𝐵) ∩ 𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | 19.41v 1977 | . . . 4 ⊢ (∃𝑠((𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴) ↔ (∃𝑠(𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴)) | |
| 2 | vex 3466 | . . . . . . . 8 ⊢ 𝑠 ∈ V | |
| 3 | 2 | opelresi 5990 | . . . . . . 7 ⊢ (〈𝑡, 𝑠〉 ∈ (𝐹 ↾ 𝐴) ↔ (𝑡 ∈ 𝐴 ∧ 〈𝑡, 𝑠〉 ∈ 𝐹)) |
| 4 | vex 3466 | . . . . . . . 8 ⊢ 𝑡 ∈ V | |
| 5 | 2, 4 | opelcnv 5871 | . . . . . . 7 ⊢ (〈𝑠, 𝑡〉 ∈ ◡(𝐹 ↾ 𝐴) ↔ 〈𝑡, 𝑠〉 ∈ (𝐹 ↾ 𝐴)) |
| 6 | 2, 4 | opelcnv 5871 | . . . . . . . 8 ⊢ (〈𝑠, 𝑡〉 ∈ ◡𝐹 ↔ 〈𝑡, 𝑠〉 ∈ 𝐹) |
| 7 | 6 | anbi2ci 636 | . . . . . . 7 ⊢ ((〈𝑠, 𝑡〉 ∈ ◡𝐹 ∧ 𝑡 ∈ 𝐴) ↔ (𝑡 ∈ 𝐴 ∧ 〈𝑡, 𝑠〉 ∈ 𝐹)) |
| 8 | 3, 5, 7 | 3bitr4i 306 | . . . . . 6 ⊢ (〈𝑠, 𝑡〉 ∈ ◡(𝐹 ↾ 𝐴) ↔ (〈𝑠, 𝑡〉 ∈ ◡𝐹 ∧ 𝑡 ∈ 𝐴)) |
| 9 | 8 | bianass 654 | . . . . 5 ⊢ ((𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡(𝐹 ↾ 𝐴)) ↔ ((𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴)) |
| 10 | 9 | exbii 1876 | . . . 4 ⊢ (∃𝑠(𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡(𝐹 ↾ 𝐴)) ↔ ∃𝑠((𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴)) |
| 11 | 4 | elima3 6073 | . . . . 5 ⊢ (𝑡 ∈ (◡𝐹 “ 𝐵) ↔ ∃𝑠(𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡𝐹)) |
| 12 | 11 | anbi1i 635 | . . . 4 ⊢ ((𝑡 ∈ (◡𝐹 “ 𝐵) ∧ 𝑡 ∈ 𝐴) ↔ (∃𝑠(𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴)) |
| 13 | 1, 10, 12 | 3bitr4i 306 | . . 3 ⊢ (∃𝑠(𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡(𝐹 ↾ 𝐴)) ↔ (𝑡 ∈ (◡𝐹 “ 𝐵) ∧ 𝑡 ∈ 𝐴)) |
| 14 | 4 | elima3 6073 | . . 3 ⊢ (𝑡 ∈ (◡(𝐹 ↾ 𝐴) “ 𝐵) ↔ ∃𝑠(𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡(𝐹 ↾ 𝐴))) |
| 15 | elin 3929 | . . 3 ⊢ (𝑡 ∈ ((◡𝐹 “ 𝐵) ∩ 𝐴) ↔ (𝑡 ∈ (◡𝐹 “ 𝐵) ∧ 𝑡 ∈ 𝐴)) | |
| 16 | 13, 14, 15 | 3bitr4i 306 | . 2 ⊢ (𝑡 ∈ (◡(𝐹 ↾ 𝐴) “ 𝐵) ↔ 𝑡 ∈ ((◡𝐹 “ 𝐵) ∩ 𝐴)) |
| 17 | 16 | eqriv 2767 | 1 ⊢ (◡(𝐹 ↾ 𝐴) “ 𝐵) = ((◡𝐹 “ 𝐵) ∩ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 400 = wceq 1568 ∃wex 1807 ∈ wcel 2150 ∩ cin 3912 〈cop 4600 ◡ccnv 5664 ↾ cres 5667 “ cima 5668 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-ext 2742 ax-sep 5262 ax-pr 5408 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-sb 2099 df-clab 2749 df-cleq 2762 df-clel 2845 df-ral 3087 df-rex 3097 df-rab 3424 df-v 3464 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-br 5115 df-opab 5179 df-xp 5671 df-cnv 5673 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 |
| This theorem is referenced by: fimacnvinrn 7070 ramub2 17077 ramub1lem2 17090 cnrest 23425 kgencn 23696 kgencn3 23698 xkoptsub 23794 qtopres 23838 qtoprest 23857 mbfid 25777 mbfres 25786 1stpreima 33022 2ndpreima 33023 gsumhashmul 33357 cvmsss2 35724 lmhmlnmsplit 43766 |
| Copyright terms: Public domain | W3C validator |