Theorem fin 5076

Description: Mapping into an intersection. (Contributed by NM, 14-Sep-1999.) (Proof shortened by Andrew Salmon, 17-Sep-2011.)

Assertion

Ref	Expression
fin	|- ( F : A --> ( B i^i C ) <-> ( F : A --> B /\ F : A --> C ) )

Proof of Theorem fin

Step	Hyp	Ref	Expression
1		ssin 3159	. . . 4 |- ( ( ran F C_ B /\ ran F C_ C ) <-> ran F C_ ( B i^i C ) )
2	1	anbi2i 430	. . 3 |- ( ( F Fn A /\ ( ran F C_ B /\ ran F C_ C ) ) <-> ( F Fn A /\ ran F C_ ( B i^i C ) ) )
3		anandi 524	. . 3 |- ( ( F Fn A /\ ( ran F C_ B /\ ran F C_ C ) ) <-> ( ( F Fn A /\ ran F C_ B ) /\ ( F Fn A /\ ran F C_ C ) ) )
4	2, 3	bitr3i 175	. 2 |- ( ( F Fn A /\ ran F C_ ( B i^i C ) ) <-> ( ( F Fn A /\ ran F C_ B ) /\ ( F Fn A /\ ran F C_ C ) ) )
5		df-f 4906	. 2 |- ( F : A --> ( B i^i C ) <-> ( F Fn A /\ ran F C_ ( B i^i C ) ) )
6		df-f 4906	. . 3 |- ( F : A --> B <-> ( F Fn A /\ ran F C_ B ) )
7		df-f 4906	. . 3 |- ( F : A --> C <-> ( F Fn A /\ ran F C_ C ) )
8	6, 7	anbi12i 433	. 2 |- ( ( F : A --> B /\ F : A --> C ) <-> ( ( F Fn A /\ ran F C_ B ) /\ ( F Fn A /\ ran F C_ C ) ) )
9	4, 5, 8	3bitr4i 201	1 |- ( F : A --> ( B i^i C ) <-> ( F : A --> B /\ F : A --> C ) )

Syntax hints:   /\ wa 97   <-> wb 98   i^i cin 2916   C_ wss 2917   ran crn 4346   Fn wfn 4897   -->wf 4898

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 99  ax-ia2 100  ax-ia3 101  ax-io 630  ax-5 1336  ax-7 1337  ax-gen 1338  ax-ie1 1382  ax-ie2 1383  ax-8 1395  ax-10 1396  ax-11 1397  ax-i12 1398  ax-bndl 1399  ax-4 1400  ax-17 1419  ax-i9 1423  ax-ial 1427  ax-i5r 1428  ax-ext 2022

This theorem depends on definitions:  df-bi 110  df-tru 1246  df-nf 1350  df-sb 1646  df-clab 2027  df-cleq 2033  df-clel 2036  df-nfc 2167  df-v 2559  df-in 2924  df-ss 2931  df-f 4906

This theorem is referenced by: (None)