Theorem cnvresima 5160

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

Assertion

Ref	Expression
cnvresima	|- ( `' ( F |` A ) " B ) = ( ( `' F " B ) i^i A )

Proof of Theorem cnvresima

Dummy variables t s are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 2766	. . . 4 |- t e. _V
2	1	elima3 5017	. . 3 |- ( t e. ( `' ( F |` A ) " B ) <-> E. s ( s e. B /\ <. s , t >. e. `' ( F |` A ) ) )
3	1	elima3 5017	. . . . 5 |- ( t e. ( `' F " B ) <-> E. s ( s e. B /\ <. s , t >. e. `' F ) )
4	3	anbi1i 458	. . . 4 |- ( ( t e. ( `' F " B ) /\ t e. A ) <-> ( E. s ( s e. B /\ <. s , t >. e. `' F ) /\ t e. A ) )
5		elin 3347	. . . 4 |- ( t e. ( ( `' F " B ) i^i A ) <-> ( t e. ( `' F " B ) /\ t e. A ) )
6		vex 2766	. . . . . . . . . 10 |- s e. _V
7	6, 1	opelcnv 4849	. . . . . . . . 9 |- ( <. s , t >. e. `' ( F |` A ) <-> <. t , s >. e. ( F |` A ) )
8	6	opelres 4952	. . . . . . . . . 10 |- ( <. t , s >. e. ( F |` A ) <-> ( <. t , s >. e. F /\ t e. A ) )
9	6, 1	opelcnv 4849	. . . . . . . . . . 11 |- ( <. s , t >. e. `' F <-> <. t , s >. e. F )
10	9	anbi1i 458	. . . . . . . . . 10 |- ( ( <. s , t >. e. `' F /\ t e. A ) <-> ( <. t , s >. e. F /\ t e. A ) )
11	8, 10	bitr4i 187	. . . . . . . . 9 |- ( <. t , s >. e. ( F |` A ) <-> ( <. s , t >. e. `' F /\ t e. A ) )
12	7, 11	bitri 184	. . . . . . . 8 |- ( <. s , t >. e. `' ( F |` A ) <-> ( <. s , t >. e. `' F /\ t e. A ) )
13	12	anbi2i 457	. . . . . . 7 |- ( ( s e. B /\ <. s , t >. e. `' ( F |` A ) ) <-> ( s e. B /\ ( <. s , t >. e. `' F /\ t e. A ) ) )
14		anass 401	. . . . . . 7 |- ( ( ( s e. B /\ <. s , t >. e. `' F ) /\ t e. A ) <-> ( s e. B /\ ( <. s , t >. e. `' F /\ t e. A ) ) )
15	13, 14	bitr4i 187	. . . . . 6 |- ( ( s e. B /\ <. s , t >. e. `' ( F |` A ) ) <-> ( ( s e. B /\ <. s , t >. e. `' F ) /\ t e. A ) )
16	15	exbii 1619	. . . . 5 |- ( E. s ( s e. B /\ <. s , t >. e. `' ( F |` A ) ) <-> E. s ( ( s e. B /\ <. s , t >. e. `' F ) /\ t e. A ) )
17		19.41v 1917	. . . . 5 |- ( E. s ( ( s e. B /\ <. s , t >. e. `' F ) /\ t e. A ) <-> ( E. s ( s e. B /\ <. s , t >. e. `' F ) /\ t e. A ) )
18	16, 17	bitri 184	. . . 4 |- ( E. s ( s e. B /\ <. s , t >. e. `' ( F |` A ) ) <-> ( E. s ( s e. B /\ <. s , t >. e. `' F ) /\ t e. A ) )
19	4, 5, 18	3bitr4ri 213	. . 3 |- ( E. s ( s e. B /\ <. s , t >. e. `' ( F |` A ) ) <-> t e. ( ( `' F " B ) i^i A ) )
20	2, 19	bitri 184	. 2 |- ( t e. ( `' ( F |` A ) " B ) <-> t e. ( ( `' F " B ) i^i A ) )
21	20	eqriv 2193	1 |- ( `' ( F |` A ) " B ) = ( ( `' F " B ) i^i A )

Syntax hints:   /\ wa 104   = wceq 1364   E.wex 1506   e. wcel 2167   i^i cin 3156   <.cop 3626   `'ccnv 4663   |` cres 4666   "cima 4667

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-14 2170  ax-ext 2178  ax-sep 4152  ax-pow 4208  ax-pr 4243

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ral 2480  df-rex 2481  df-v 2765  df-un 3161  df-in 3163  df-ss 3170  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-br 4035  df-opab 4096  df-xp 4670  df-cnv 4672  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677

This theorem is referenced by:  cnrest  14555