Theorem cnvresima 5100

Description: An image under the converse of a restriction. (Contributed by Jeff Hankins, 12-Jul-2009.)

Assertion

Ref	Expression
cnvresima	⊢ (◡(𝐹 ↾ 𝐴) “ 𝐵) = ((◡𝐹 “ 𝐵) ∩ 𝐴)

Proof of Theorem cnvresima

Dummy variables 𝑡 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 2733	. . . 4 ⊢ 𝑡 ∈ V
2	1	elima3 4960	. . 3 ⊢ (𝑡 ∈ (◡(𝐹 ↾ 𝐴) “ 𝐵) ↔ ∃𝑠(𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡(𝐹 ↾ 𝐴)))
3	1	elima3 4960	. . . . 5 ⊢ (𝑡 ∈ (◡𝐹 “ 𝐵) ↔ ∃𝑠(𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡𝐹))
4	3	anbi1i 455	. . . 4 ⊢ ((𝑡 ∈ (◡𝐹 “ 𝐵) ∧ 𝑡 ∈ 𝐴) ↔ (∃𝑠(𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴))
5		elin 3310	. . . 4 ⊢ (𝑡 ∈ ((◡𝐹 “ 𝐵) ∩ 𝐴) ↔ (𝑡 ∈ (◡𝐹 “ 𝐵) ∧ 𝑡 ∈ 𝐴))
6		vex 2733	. . . . . . . . . 10 ⊢ 𝑠 ∈ V
7	6, 1	opelcnv 4793	. . . . . . . . 9 ⊢ (⟨𝑠, 𝑡⟩ ∈ ◡(𝐹 ↾ 𝐴) ↔ ⟨𝑡, 𝑠⟩ ∈ (𝐹 ↾ 𝐴))
8	6	opelres 4896	. . . . . . . . . 10 ⊢ (⟨𝑡, 𝑠⟩ ∈ (𝐹 ↾ 𝐴) ↔ (⟨𝑡, 𝑠⟩ ∈ 𝐹 ∧ 𝑡 ∈ 𝐴))
9	6, 1	opelcnv 4793	. . . . . . . . . . 11 ⊢ (⟨𝑠, 𝑡⟩ ∈ ◡𝐹 ↔ ⟨𝑡, 𝑠⟩ ∈ 𝐹)
10	9	anbi1i 455	. . . . . . . . . 10 ⊢ ((⟨𝑠, 𝑡⟩ ∈ ◡𝐹 ∧ 𝑡 ∈ 𝐴) ↔ (⟨𝑡, 𝑠⟩ ∈ 𝐹 ∧ 𝑡 ∈ 𝐴))
11	8, 10	bitr4i 186	. . . . . . . . 9 ⊢ (⟨𝑡, 𝑠⟩ ∈ (𝐹 ↾ 𝐴) ↔ (⟨𝑠, 𝑡⟩ ∈ ◡𝐹 ∧ 𝑡 ∈ 𝐴))
12	7, 11	bitri 183	. . . . . . . 8 ⊢ (⟨𝑠, 𝑡⟩ ∈ ◡(𝐹 ↾ 𝐴) ↔ (⟨𝑠, 𝑡⟩ ∈ ◡𝐹 ∧ 𝑡 ∈ 𝐴))
13	12	anbi2i 454	. . . . . . 7 ⊢ ((𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡(𝐹 ↾ 𝐴)) ↔ (𝑠 ∈ 𝐵 ∧ (⟨𝑠, 𝑡⟩ ∈ ◡𝐹 ∧ 𝑡 ∈ 𝐴)))
14		anass 399	. . . . . . 7 ⊢ (((𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴) ↔ (𝑠 ∈ 𝐵 ∧ (⟨𝑠, 𝑡⟩ ∈ ◡𝐹 ∧ 𝑡 ∈ 𝐴)))
15	13, 14	bitr4i 186	. . . . . 6 ⊢ ((𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡(𝐹 ↾ 𝐴)) ↔ ((𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴))
16	15	exbii 1598	. . . . 5 ⊢ (∃𝑠(𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡(𝐹 ↾ 𝐴)) ↔ ∃𝑠((𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴))
17		19.41v 1895	. . . . 5 ⊢ (∃𝑠((𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴) ↔ (∃𝑠(𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴))
18	16, 17	bitri 183	. . . 4 ⊢ (∃𝑠(𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡(𝐹 ↾ 𝐴)) ↔ (∃𝑠(𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴))
19	4, 5, 18	3bitr4ri 212	. . 3 ⊢ (∃𝑠(𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡(𝐹 ↾ 𝐴)) ↔ 𝑡 ∈ ((◡𝐹 “ 𝐵) ∩ 𝐴))
20	2, 19	bitri 183	. 2 ⊢ (𝑡 ∈ (◡(𝐹 ↾ 𝐴) “ 𝐵) ↔ 𝑡 ∈ ((◡𝐹 “ 𝐵) ∩ 𝐴))
21	20	eqriv 2167	1 ⊢ (◡(𝐹 ↾ 𝐴) “ 𝐵) = ((◡𝐹 “ 𝐵) ∩ 𝐴)

Syntax hints:   ∧ wa 103   = wceq 1348  ∃wex 1485   ∈ wcel 2141   ∩ cin 3120  ⟨cop 3586  ^◡ccnv 4610   ↾ cres 4613   “ cima 4614

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 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-14 2144  ax-ext 2152  ax-sep 4107  ax-pow 4160  ax-pr 4194

This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-un 3125  df-in 3127  df-ss 3134  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-br 3990  df-opab 4051  df-xp 4617  df-cnv 4619  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624

This theorem is referenced by:  cnrest  13029