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

Theorem fint 6122
 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 4525 . . . 4 (ran 𝐹 𝐵 ↔ ∀𝑥𝐵 ran 𝐹𝑥)
21anbi2i 730 . . 3 ((𝐹 Fn 𝐴 ∧ ran 𝐹 𝐵) ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥𝐵 ran 𝐹𝑥))
3 fint.1 . . . 4 𝐵 ≠ ∅
4 r19.28zv 4099 . . . 4 (𝐵 ≠ ∅ → (∀𝑥𝐵 (𝐹 Fn 𝐴 ∧ ran 𝐹𝑥) ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥𝐵 ran 𝐹𝑥)))
53, 4ax-mp 5 . . 3 (∀𝑥𝐵 (𝐹 Fn 𝐴 ∧ ran 𝐹𝑥) ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥𝐵 ran 𝐹𝑥))
62, 5bitr4i 267 . 2 ((𝐹 Fn 𝐴 ∧ ran 𝐹 𝐵) ↔ ∀𝑥𝐵 (𝐹 Fn 𝐴 ∧ ran 𝐹𝑥))
7 df-f 5930 . 2 (𝐹:𝐴 𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 𝐵))
8 df-f 5930 . . 3 (𝐹:𝐴𝑥 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹𝑥))
98ralbii 3009 . 2 (∀𝑥𝐵 𝐹:𝐴𝑥 ↔ ∀𝑥𝐵 (𝐹 Fn 𝐴 ∧ ran 𝐹𝑥))
106, 7, 93bitr4i 292 1 (𝐹:𝐴 𝐵 ↔ ∀𝑥𝐵 𝐹:𝐴𝑥)
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 196   ∧ wa 383   ≠ wne 2823  ∀wral 2941   ⊆ wss 3607  ∅c0 3948  ∩ cint 4507  ran crn 5144   Fn wfn 5921  ⟶wf 5922 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631 This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ne 2824  df-ral 2946  df-v 3233  df-dif 3610  df-in 3614  df-ss 3621  df-nul 3949  df-int 4508  df-f 5930 This theorem is referenced by:  chintcli  28318
 Copyright terms: Public domain W3C validator