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

Theorem fint 6536
 Description: Function into an intersection. (Contributed by NM, 14-Oct-1999.) (Proof shortened by Andrew Salmon, 17-Sep-2011.)
Hypothesis
Ref Expression
fint.1 𝐵 ≠ ∅
Assertion
Ref Expression
fint (𝐹:𝐴 𝐵 ↔ ∀𝑥𝐵 𝐹:𝐴𝑥)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐹

Proof of Theorem fint
StepHypRef Expression
1 ssint 4857 . . . 4 (ran 𝐹 𝐵 ↔ ∀𝑥𝐵 ran 𝐹𝑥)
21anbi2i 625 . . 3 ((𝐹 Fn 𝐴 ∧ ran 𝐹 𝐵) ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥𝐵 ran 𝐹𝑥))
3 fint.1 . . . 4 𝐵 ≠ ∅
4 r19.28zv 4407 . . . 4 (𝐵 ≠ ∅ → (∀𝑥𝐵 (𝐹 Fn 𝐴 ∧ ran 𝐹𝑥) ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥𝐵 ran 𝐹𝑥)))
53, 4ax-mp 5 . . 3 (∀𝑥𝐵 (𝐹 Fn 𝐴 ∧ ran 𝐹𝑥) ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥𝐵 ran 𝐹𝑥))
62, 5bitr4i 281 . 2 ((𝐹 Fn 𝐴 ∧ ran 𝐹 𝐵) ↔ ∀𝑥𝐵 (𝐹 Fn 𝐴 ∧ ran 𝐹𝑥))
7 df-f 6332 . 2 (𝐹:𝐴 𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 𝐵))
8 df-f 6332 . . 3 (𝐹:𝐴𝑥 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹𝑥))
98ralbii 3136 . 2 (∀𝑥𝐵 𝐹:𝐴𝑥 ↔ ∀𝑥𝐵 (𝐹 Fn 𝐴 ∧ ran 𝐹𝑥))
106, 7, 93bitr4i 306 1 (𝐹:𝐴 𝐵 ↔ ∀𝑥𝐵 𝐹:𝐴𝑥)
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 209   ∧ wa 399   ≠ wne 2990  ∀wral 3109   ⊆ wss 3884  ∅c0 4246  ∩ cint 4841  ran crn 5524   Fn wfn 6323  ⟶wf 6324 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-11 2159  ax-12 2176  ax-ext 2773 This theorem depends on definitions:  df-bi 210  df-an 400  df-ex 1782  df-nf 1786  df-sb 2070  df-clab 2780  df-cleq 2794  df-clel 2873  df-ne 2991  df-ral 3114  df-v 3446  df-dif 3887  df-in 3891  df-ss 3901  df-nul 4247  df-int 4842  df-f 6332 This theorem is referenced by:  chintcli  29117
 Copyright terms: Public domain W3C validator