MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  fin Structured version   Visualization version   GIF version

Theorem fin 6246
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
StepHypRef Expression
1 ssin 3978 . . . 4 ((ran 𝐹𝐵 ∧ ran 𝐹𝐶) ↔ ran 𝐹 ⊆ (𝐵𝐶))
21anbi2i 732 . . 3 ((𝐹 Fn 𝐴 ∧ (ran 𝐹𝐵 ∧ ran 𝐹𝐶)) ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ (𝐵𝐶)))
3 anandi 906 . . 3 ((𝐹 Fn 𝐴 ∧ (ran 𝐹𝐵 ∧ ran 𝐹𝐶)) ↔ ((𝐹 Fn 𝐴 ∧ ran 𝐹𝐵) ∧ (𝐹 Fn 𝐴 ∧ ran 𝐹𝐶)))
42, 3bitr3i 266 . 2 ((𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ (𝐵𝐶)) ↔ ((𝐹 Fn 𝐴 ∧ ran 𝐹𝐵) ∧ (𝐹 Fn 𝐴 ∧ ran 𝐹𝐶)))
5 df-f 6053 . 2 (𝐹:𝐴⟶(𝐵𝐶) ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ (𝐵𝐶)))
6 df-f 6053 . . 3 (𝐹:𝐴𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹𝐵))
7 df-f 6053 . . 3 (𝐹:𝐴𝐶 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹𝐶))
86, 7anbi12i 735 . 2 ((𝐹:𝐴𝐵𝐹:𝐴𝐶) ↔ ((𝐹 Fn 𝐴 ∧ ran 𝐹𝐵) ∧ (𝐹 Fn 𝐴 ∧ ran 𝐹𝐶)))
94, 5, 83bitr4i 292 1 (𝐹:𝐴⟶(𝐵𝐶) ↔ (𝐹:𝐴𝐵𝐹:𝐴𝐶))
Colors of variables: wff setvar class
Syntax hints:  wb 196  wa 383  cin 3714  wss 3715  ran crn 5267   Fn wfn 6044  wf 6045
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1635  df-ex 1854  df-nf 1859  df-sb 2047  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-v 3342  df-in 3722  df-ss 3729  df-f 6053
This theorem is referenced by:  umgrislfupgr  26217  usgrislfuspgr  26278  maprnin  29815  reprinrn  31005  reprinfz1  31009  inmap  39900
  Copyright terms: Public domain W3C validator