Theorem cnvresima 5036

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 2692	. . . 4 ⊢ 𝑡 ∈ V
2	1	elima3 4896	. . 3 ⊢ (𝑡 ∈ (◡(𝐹 ↾ 𝐴) “ 𝐵) ↔ ∃𝑠(𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡(𝐹 ↾ 𝐴)))
3	1	elima3 4896	. . . . 5 ⊢ (𝑡 ∈ (◡𝐹 “ 𝐵) ↔ ∃𝑠(𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡𝐹))
4	3	anbi1i 454	. . . 4 ⊢ ((𝑡 ∈ (◡𝐹 “ 𝐵) ∧ 𝑡 ∈ 𝐴) ↔ (∃𝑠(𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴))
5		elin 3264	. . . 4 ⊢ (𝑡 ∈ ((◡𝐹 “ 𝐵) ∩ 𝐴) ↔ (𝑡 ∈ (◡𝐹 “ 𝐵) ∧ 𝑡 ∈ 𝐴))
6		vex 2692	. . . . . . . . . 10 ⊢ 𝑠 ∈ V
7	6, 1	opelcnv 4729	. . . . . . . . 9 ⊢ (⟨𝑠, 𝑡⟩ ∈ ◡(𝐹 ↾ 𝐴) ↔ ⟨𝑡, 𝑠⟩ ∈ (𝐹 ↾ 𝐴))
8	6	opelres 4832	. . . . . . . . . 10 ⊢ (⟨𝑡, 𝑠⟩ ∈ (𝐹 ↾ 𝐴) ↔ (⟨𝑡, 𝑠⟩ ∈ 𝐹 ∧ 𝑡 ∈ 𝐴))
9	6, 1	opelcnv 4729	. . . . . . . . . . 11 ⊢ (⟨𝑠, 𝑡⟩ ∈ ◡𝐹 ↔ ⟨𝑡, 𝑠⟩ ∈ 𝐹)
10	9	anbi1i 454	. . . . . . . . . 10 ⊢ ((⟨𝑠, 𝑡⟩ ∈ ◡𝐹 ∧ 𝑡 ∈ 𝐴) ↔ (⟨𝑡, 𝑠⟩ ∈ 𝐹 ∧ 𝑡 ∈ 𝐴))
11	8, 10	bitr4i 186	. . . . . . . . 9 ⊢ (⟨𝑡, 𝑠⟩ ∈ (𝐹 ↾ 𝐴) ↔ (⟨𝑠, 𝑡⟩ ∈ ◡𝐹 ∧ 𝑡 ∈ 𝐴))
12	7, 11	bitri 183	. . . . . . . 8 ⊢ (⟨𝑠, 𝑡⟩ ∈ ◡(𝐹 ↾ 𝐴) ↔ (⟨𝑠, 𝑡⟩ ∈ ◡𝐹 ∧ 𝑡 ∈ 𝐴))
13	12	anbi2i 453	. . . . . . 7 ⊢ ((𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡(𝐹 ↾ 𝐴)) ↔ (𝑠 ∈ 𝐵 ∧ (⟨𝑠, 𝑡⟩ ∈ ◡𝐹 ∧ 𝑡 ∈ 𝐴)))
14		anass 399	. . . . . . 7 ⊢ (((𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴) ↔ (𝑠 ∈ 𝐵 ∧ (⟨𝑠, 𝑡⟩ ∈ ◡𝐹 ∧ 𝑡 ∈ 𝐴)))
15	13, 14	bitr4i 186	. . . . . 6 ⊢ ((𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡(𝐹 ↾ 𝐴)) ↔ ((𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴))
16	15	exbii 1585	. . . . 5 ⊢ (∃𝑠(𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡(𝐹 ↾ 𝐴)) ↔ ∃𝑠((𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴))
17		19.41v 1875	. . . . 5 ⊢ (∃𝑠((𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴) ↔ (∃𝑠(𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴))
18	16, 17	bitri 183	. . . 4 ⊢ (∃𝑠(𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡(𝐹 ↾ 𝐴)) ↔ (∃𝑠(𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡𝐹) ∧ 𝑡 ∈ 𝐴))
19	4, 5, 18	3bitr4ri 212	. . 3 ⊢ (∃𝑠(𝑠 ∈ 𝐵 ∧ ⟨𝑠, 𝑡⟩ ∈ ◡(𝐹 ↾ 𝐴)) ↔ 𝑡 ∈ ((◡𝐹 “ 𝐵) ∩ 𝐴))
20	2, 19	bitri 183	. 2 ⊢ (𝑡 ∈ (◡(𝐹 ↾ 𝐴) “ 𝐵) ↔ 𝑡 ∈ ((◡𝐹 “ 𝐵) ∩ 𝐴))
21	20	eqriv 2137	1 ⊢ (◡(𝐹 ↾ 𝐴) “ 𝐵) = ((◡𝐹 “ 𝐵) ∩ 𝐴)

Syntax hints:   ∧ wa 103   = wceq 1332  ∃wex 1469   ∈ wcel 1481   ∩ cin 3075  ⟨cop 3535  ^◡ccnv 4546   ↾ cres 4549   “ cima 4550

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 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-bndl 1487  ax-4 1488  ax-14 1493  ax-17 1507  ax-i9 1511  ax-ial 1515  ax-i5r 1516  ax-ext 2122  ax-sep 4054  ax-pow 4106  ax-pr 4139

This theorem depends on definitions:  df-bi 116  df-3an 965  df-tru 1335  df-nf 1438  df-sb 1737  df-eu 2003  df-mo 2004  df-clab 2127  df-cleq 2133  df-clel 2136  df-nfc 2271  df-ral 2422  df-rex 2423  df-v 2691  df-un 3080  df-in 3082  df-ss 3089  df-pw 3517  df-sn 3538  df-pr 3539  df-op 3541  df-br 3938  df-opab 3998  df-xp 4553  df-cnv 4555  df-dm 4557  df-rn 4558  df-res 4559  df-ima 4560

This theorem is referenced by:  cnrest  12443