| 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 1948 | . . . 4 ⊢ (∃𝑠((𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴) ↔ (∃𝑠(𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴)) | |
| 2 | vex 3467 | . . . . . . . 8 ⊢ 𝑠 ∈ V | |
| 3 | 2 | opelresi 5985 | . . . . . . 7 ⊢ (〈𝑡, 𝑠〉 ∈ (𝐹 ↾ 𝐴) ↔ (𝑡 ∈ 𝐴 ∧ 〈𝑡, 𝑠〉 ∈ 𝐹)) |
| 4 | vex 3467 | . . . . . . . 8 ⊢ 𝑡 ∈ V | |
| 5 | 2, 4 | opelcnv 5872 | . . . . . . 7 ⊢ (〈𝑠, 𝑡〉 ∈ ◡(𝐹 ↾ 𝐴) ↔ 〈𝑡, 𝑠〉 ∈ (𝐹 ↾ 𝐴)) |
| 6 | 2, 4 | opelcnv 5872 | . . . . . . . 8 ⊢ (〈𝑠, 𝑡〉 ∈ ◡𝐹 ↔ 〈𝑡, 𝑠〉 ∈ 𝐹) |
| 7 | 6 | anbi2ci 625 | . . . . . . 7 ⊢ ((〈𝑠, 𝑡〉 ∈ ◡𝐹 ∧ 𝑡 ∈ 𝐴) ↔ (𝑡 ∈ 𝐴 ∧ 〈𝑡, 𝑠〉 ∈ 𝐹)) |
| 8 | 3, 5, 7 | 3bitr4i 303 | . . . . . 6 ⊢ (〈𝑠, 𝑡〉 ∈ ◡(𝐹 ↾ 𝐴) ↔ (〈𝑠, 𝑡〉 ∈ ◡𝐹 ∧ 𝑡 ∈ 𝐴)) |
| 9 | 8 | bianass 642 | . . . . 5 ⊢ ((𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡(𝐹 ↾ 𝐴)) ↔ ((𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴)) |
| 10 | 9 | exbii 1847 | . . . 4 ⊢ (∃𝑠(𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡(𝐹 ↾ 𝐴)) ↔ ∃𝑠((𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴)) |
| 11 | 4 | elima3 6065 | . . . . 5 ⊢ (𝑡 ∈ (◡𝐹 “ 𝐵) ↔ ∃𝑠(𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡𝐹)) |
| 12 | 11 | anbi1i 624 | . . . 4 ⊢ ((𝑡 ∈ (◡𝐹 “ 𝐵) ∧ 𝑡 ∈ 𝐴) ↔ (∃𝑠(𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴)) |
| 13 | 1, 10, 12 | 3bitr4i 303 | . . 3 ⊢ (∃𝑠(𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡(𝐹 ↾ 𝐴)) ↔ (𝑡 ∈ (◡𝐹 “ 𝐵) ∧ 𝑡 ∈ 𝐴)) |
| 14 | 4 | elima3 6065 | . . 3 ⊢ (𝑡 ∈ (◡(𝐹 ↾ 𝐴) “ 𝐵) ↔ ∃𝑠(𝑠 ∈ 𝐵 ∧ 〈𝑠, 𝑡〉 ∈ ◡(𝐹 ↾ 𝐴))) |
| 15 | elin 3947 | . . 3 ⊢ (𝑡 ∈ ((◡𝐹 “ 𝐵) ∩ 𝐴) ↔ (𝑡 ∈ (◡𝐹 “ 𝐵) ∧ 𝑡 ∈ 𝐴)) | |
| 16 | 13, 14, 15 | 3bitr4i 303 | . 2 ⊢ (𝑡 ∈ (◡(𝐹 ↾ 𝐴) “ 𝐵) ↔ 𝑡 ∈ ((◡𝐹 “ 𝐵) ∩ 𝐴)) |
| 17 | 16 | eqriv 2731 | 1 ⊢ (◡(𝐹 ↾ 𝐴) “ 𝐵) = ((◡𝐹 “ 𝐵) ∩ 𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: ∧ wa 395 = wceq 1539 ∃wex 1778 ∈ wcel 2107 ∩ cin 3930 〈cop 4612 ◡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 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-ext 2706 ax-sep 5276 ax-nul 5286 ax-pr 5412 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-sb 2064 df-clab 2713 df-cleq 2726 df-clel 2808 df-ral 3051 df-rex 3060 df-rab 3420 df-v 3465 df-dif 3934 df-un 3936 df-in 3938 df-ss 3948 df-nul 4314 df-if 4506 df-sn 4607 df-pr 4609 df-op 4613 df-br 5124 df-opab 5186 df-xp 5671 df-cnv 5673 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 |
| This theorem is referenced by: fimacnvinrn 7071 ramub2 17034 ramub1lem2 17047 cnrest 23239 kgencn 23510 kgencn3 23512 xkoptsub 23608 qtopres 23652 qtoprest 23671 mbfid 25606 mbfres 25615 1stpreima 32651 2ndpreima 32652 gsumhashmul 33003 cvmsss2 35238 lmhmlnmsplit 43062 |
| Copyright terms: Public domain | W3C validator |