Theorem resixp 7015

Description: Restriction of an element of an infinite Cartesian product. (Contributed by FL, 7-Nov-2011.) (Proof shortened by Mario Carneiro, 31-May-2014.)

Assertion

Ref	Expression
resixp	|- ( ( B C_ A /\ F e. X_ x e. A C ) -> ( F |` B ) e. X_ x e. B C )

Distinct variable groups:   x, A   x, B   x, F

Allowed substitution hint:   C( x)

Proof of Theorem resixp

Step	Hyp	Ref	Expression
1		resexg 5103	. . 3 |- ( F e. X_ x e. A C -> ( F |` B ) e. _V )
2	1	adantl 277	. 2 |- ( ( B C_ A /\ F e. X_ x e. A C ) -> ( F |` B ) e. _V )
3		simpr 110	. . . . 5 |- ( ( B C_ A /\ F e. X_ x e. A C ) -> F e. X_ x e. A C )
4		elixp2 6984	. . . . 5 |- ( F e. X_ x e. A C <-> ( F e. _V /\ F Fn A /\ A. x e. A ( F ` x ) e. C ) )
5	3, 4	sylib 122	. . . 4 |- ( ( B C_ A /\ F e. X_ x e. A C ) -> ( F e. _V /\ F Fn A /\ A. x e. A ( F ` x ) e. C ) )
6	5	simp2d 1041	. . 3 |- ( ( B C_ A /\ F e. X_ x e. A C ) -> F Fn A )
7		simpl 109	. . 3 |- ( ( B C_ A /\ F e. X_ x e. A C ) -> B C_ A )
8		fnssres 5496	. . 3 |- ( ( F Fn A /\ B C_ A ) -> ( F |` B ) Fn B )
9	6, 7, 8	syl2anc 415	. 2 |- ( ( B C_ A /\ F e. X_ x e. A C ) -> ( F |` B ) Fn B )
10	5	simp3d 1042	. . . 4 |- ( ( B C_ A /\ F e. X_ x e. A C ) -> A. x e. A ( F ` x ) e. C )
11		ssralv 3312	. . . 4 |- ( B C_ A -> ( A. x e. A ( F ` x ) e. C -> A. x e. B ( F ` x ) e. C ) )
12	7, 10, 11	sylc 62	. . 3 |- ( ( B C_ A /\ F e. X_ x e. A C ) -> A. x e. B ( F ` x ) e. C )
13		fvres 5719	. . . . 5 |- ( x e. B -> ( ( F |` B ) ` x ) = ( F ` x ) )
14	13	eleq1d 2307	. . . 4 |- ( x e. B -> ( ( ( F |` B ) ` x ) e. C <-> ( F ` x ) e. C ) )
15	14	ralbiia 2564	. . 3 |- ( A. x e. B ( ( F |` B ) ` x ) e. C <-> A. x e. B ( F ` x ) e. C )
16	12, 15	sylibr 134	. 2 |- ( ( B C_ A /\ F e. X_ x e. A C ) -> A. x e. B ( ( F |` B ) ` x ) e. C )
17		elixp2 6984	. 2 |- ( ( F |` B ) e. X_ x e. B C <-> ( ( F |` B ) e. _V /\ ( F |` B ) Fn B /\ A. x e. B ( ( F |` B ) ` x ) e. C ) )
18	2, 9, 16, 17	syl3anbrc 1212	1 |- ( ( B C_ A /\ F e. X_ x e. A C ) -> ( F |` B ) e. X_ x e. B C )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   /\ w3a 1009   e. wcel 2209   A.wral 2528   _Vcvv 2821   C_ wss 3220   |` cres 4776   Fn wfn 5372   ` cfv 5377   X_cixp 6980

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-res 4786  df-iota 5337  df-fun 5379  df-fn 5380  df-fv 5385  df-ixp 6981

This theorem is used by: (None)