Theorem fin 5462

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 3395	. . . 4 |- ( ( ran F C_ B /\ ran F C_ C ) <-> ran F C_ ( B i^i C ) )
2	1	anbi2i 457	. . 3 |- ( ( F Fn A /\ ( ran F C_ B /\ ran F C_ C ) ) <-> ( F Fn A /\ ran F C_ ( B i^i C ) ) )
3		anandi 590	. . 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 186	. 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 5275	. 2 |- ( F : A --> ( B i^i C ) <-> ( F Fn A /\ ran F C_ ( B i^i C ) ) )
6		df-f 5275	. . 3 |- ( F : A --> B <-> ( F Fn A /\ ran F C_ B ) )
7		df-f 5275	. . 3 |- ( F : A --> C <-> ( F Fn A /\ ran F C_ C ) )
8	6, 7	anbi12i 460	. 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 212	1 |- ( F : A --> ( B i^i C ) <-> ( F : A --> B /\ F : A --> C ) )

Syntax hints:   /\ wa 104   <-> wb 105   i^i cin 3165   C_ wss 3166   ran crn 4676   Fn wfn 5266   -->wf 5267

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 711  ax-5 1470  ax-7 1471  ax-gen 1472  ax-ie1 1516  ax-ie2 1517  ax-8 1527  ax-10 1528  ax-11 1529  ax-i12 1530  ax-bndl 1532  ax-4 1533  ax-17 1549  ax-i9 1553  ax-ial 1557  ax-i5r 1558  ax-ext 2187

This theorem depends on definitions:  df-bi 117  df-tru 1376  df-nf 1484  df-sb 1786  df-clab 2192  df-cleq 2198  df-clel 2201  df-nfc 2337  df-v 2774  df-in 3172  df-ss 3179  df-f 5275

This theorem is referenced by: (None)