| 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 1981 | . . . 4 ⊢ (∃𝑠((𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴) ↔ (∃𝑠(𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴)) | |
| 2 | vex 3454 | . . . . . . . 8 ⊢ 𝑠 ∈ V | |
| 3 | 2 | opelresi 5977 | . . . . . . 7 ⊢ (〈𝑡, 𝑠〉 ∈ (𝐹 ↾ 𝐴) ↔ (𝑡 ∈ 𝐴 ∧ 〈𝑡, 𝑠〉 ∈ 𝐹)) |
| 4 | vex 3454 | . . . . . . . 8 ⊢ 𝑡 ∈ V | |
| 5 | 2, 4 | opelcnv 5858 | . . . . . . 7 ⊢ (〈𝑠, 𝑡〉 ∈ ◡(𝐹 ↾ 𝐴) ↔ 〈𝑡, 𝑠〉 ∈ (𝐹 ↾ 𝐴)) |
| 6 | 2, 4 | opelcnv 5858 | . . . . . . . 8 ⊢ (〈𝑠, 𝑡〉 ∈ ◡𝐹 ↔ 〈𝑡, 𝑠〉 ∈ 𝐹) |
| 7 | 6 | anbi2ci 637 | . . . . . . 7 ⊢ ((〈𝑠, 𝑡〉 ∈ ◡𝐹 ∧ 𝑡 ∈ 𝐴) ↔ (𝑡 ∈ 𝐴 ∧ 〈𝑡, 𝑠〉 ∈ 𝐹)) |
| 8 | 3, 5, 7 | 3bitr4i 306 | . . . . . 6 ⊢ (〈𝑠, 𝑡〉 ∈ ◡(𝐹 ↾ 𝐴) ↔ (〈𝑠, 𝑡〉 ∈ ◡𝐹 ∧ 𝑡 ∈ 𝐴)) |
| 9 | 8 | bianass 655 | . . . . 5 ⊢ ((𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡(𝐹 ↾ 𝐴)) ↔ ((𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴)) |
| 10 | 9 | exbii 1880 | . . . 4 ⊢ (∃𝑠(𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡(𝐹 ↾ 𝐴)) ↔ ∃𝑠((𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴)) |
| 11 | 4 | elima3 6062 | . . . . 5 ⊢ (𝑡 ∈ (◡𝐹 “ 𝐵) ↔ ∃𝑠(𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡𝐹)) |
| 12 | 11 | anbi1i 636 | . . . 4 ⊢ ((𝑡 ∈ (◡𝐹 “ 𝐵) ∧ 𝑡 ∈ 𝐴) ↔ (∃𝑠(𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴)) |
| 13 | 1, 10, 12 | 3bitr4i 306 | . . 3 ⊢ (∃𝑠(𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡(𝐹 ↾ 𝐴)) ↔ (𝑡 ∈ (◡𝐹 “ 𝐵) ∧ 𝑡 ∈ 𝐴)) |
| 14 | 4 | elima3 6062 | . . 3 ⊢ (𝑡 ∈ (◡(𝐹 ↾ 𝐴) “ 𝐵) ↔ ∃𝑠(𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡(𝐹 ↾ 𝐴))) |
| 15 | elin 4093 | . . 3 ⊢ (𝑡 ∈ ((◡𝐹 “ 𝐵) ∩ 𝐴) ↔ (𝑡 ∈ (◡𝐹 “ 𝐵) ∧ 𝑡 ∈ 𝐴)) | |
| 16 | 13, 14, 15 | 3bitr4i 306 | . 2 ⊢ (𝑡 ∈ (◡(𝐹 ↾ 𝐴) “ 𝐵) ↔ 𝑡 ∈ ((◡𝐹 “ 𝐵) ∩ 𝐴)) |
| 17 | 16 | eqriv 2757 | 1 ⊢ (◡(𝐹 ↾ 𝐴) “ 𝐵) = ((◡𝐹 “ 𝐵) ∩ 𝐴) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ∧ wa 401 = wceq 1569 ∃wex 1811 ∈ wcel 2144 ∩ cin 4089 〈cop 4589 ◡ccnv 5649 ↾ cres 5652 “ cima 5653 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-ext 2732 ax-sep 5248 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-sb 2099 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-br 5103 df-opab 5167 df-xp 5656 df-cnv 5658 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 |
| This theorem is used by: fimacnvinrn 7071 ramub2 17192 ramub1lem2 17205 cnrest 23603 kgencn 23875 kgencn3 23877 xkoptsub 23973 qtopres 24017 qtoprest 24036 mbfid 25956 mbfres 25965 1stpreima 33300 2ndpreima 33301 gsumhashmul 33628 cvmsss2 36039 lmhmlnmsplit 44089 |
| Copyright terms: Public domain | W3C validator |