Theorem fin 5384

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

Assertion

Ref	Expression
fin	⊢ (𝐹:𝐴⟶(𝐵 ∩ 𝐶) ↔ (𝐹:𝐴⟶𝐵 ∧ 𝐹:𝐴⟶𝐶))

Proof of Theorem fin

Step	Hyp	Ref	Expression
1		ssin 3349	. . . 4 ⊢ ((ran 𝐹 ⊆ 𝐵 ∧ ran 𝐹 ⊆ 𝐶) ↔ ran 𝐹 ⊆ (𝐵 ∩ 𝐶))
2	1	anbi2i 454	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ (ran 𝐹 ⊆ 𝐵 ∧ ran 𝐹 ⊆ 𝐶)) ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ (𝐵 ∩ 𝐶)))
3		anandi 585	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ (ran 𝐹 ⊆ 𝐵 ∧ ran 𝐹 ⊆ 𝐶)) ↔ ((𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵) ∧ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐶)))
4	2, 3	bitr3i 185	. 2 ⊢ ((𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ (𝐵 ∩ 𝐶)) ↔ ((𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵) ∧ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐶)))
5		df-f 5202	. 2 ⊢ (𝐹:𝐴⟶(𝐵 ∩ 𝐶) ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ (𝐵 ∩ 𝐶)))
6		df-f 5202	. . 3 ⊢ (𝐹:𝐴⟶𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵))
7		df-f 5202	. . 3 ⊢ (𝐹:𝐴⟶𝐶 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐶))
8	6, 7	anbi12i 457	. 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝐹:𝐴⟶𝐶) ↔ ((𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐵) ∧ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝐶)))
9	4, 5, 8	3bitr4i 211	1 ⊢ (𝐹:𝐴⟶(𝐵 ∩ 𝐶) ↔ (𝐹:𝐴⟶𝐵 ∧ 𝐹:𝐴⟶𝐶))

Syntax hints:   ∧ wa 103   ↔ wb 104   ∩ cin 3120   ⊆ wss 3121  ran crn 4612   Fn wfn 5193  ⟶wf 5194

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 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152

This theorem depends on definitions:  df-bi 116  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-v 2732  df-in 3127  df-ss 3134  df-f 5202

This theorem is referenced by: (None)