Users' Mathboxes Mathbox for BTernaryTau < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fnfvintima Structured version   Visualization version   GIF version

Theorem fnfvintima 35786
Description: Condition for a function value to equal the intersection of an image that contains it. (Contributed by BTernaryTau, 23-Jun-2026.)
Assertion
Ref Expression
fnfvintima ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → ((𝐹‘𝐶) = ∩ (𝐹 “ 𝐵) ↔ ∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥)))
Distinct variable groups:   𝑥,𝐵   𝑥,𝐶   𝑥,𝐹
Allowed substitution hint:   𝐴(𝑥)

Proof of Theorem fnfvintima
StepHypRef Expression
1 eqimss 3971 . . 3 ((𝐹‘𝐶) = ∩ (𝐹 “ 𝐵) → (𝐹‘𝐶) ⊆ ∩ (𝐹 “ 𝐵))
2 fnssintima 7395 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → ((𝐹‘𝐶) ⊆ ∩ (𝐹 “ 𝐵) ↔ ∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥)))
323adant3 1150 . . 3 ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → ((𝐹‘𝐶) ⊆ ∩ (𝐹 “ 𝐵) ↔ ∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥)))
41, 3imbitrid 247 . 2 ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → ((𝐹‘𝐶) = ∩ (𝐹 “ 𝐵) → ∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥)))
53biimprd 251 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥) → (𝐹‘𝐶) ⊆ ∩ (𝐹 “ 𝐵)))
6 fnfvima 7262 . . . . 5 ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → (𝐹‘𝐶) ∈ (𝐹 “ 𝐵))
7 intss1 4926 . . . . 5 ((𝐹‘𝐶) ∈ (𝐹 “ 𝐵) → ∩ (𝐹 “ 𝐵) ⊆ (𝐹‘𝐶))
86, 7syl 18 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → ∩ (𝐹 “ 𝐵) ⊆ (𝐹‘𝐶))
95, 8jctird 536 . . 3 ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥) → ((𝐹‘𝐶) ⊆ ∩ (𝐹 “ 𝐵) ∧ ∩ (𝐹 “ 𝐵) ⊆ (𝐹‘𝐶))))
10 eqss 3928 . . 3 ((𝐹‘𝐶) = ∩ (𝐹 “ 𝐵) ↔ ((𝐹‘𝐶) ⊆ ∩ (𝐹 “ 𝐵) ∧ ∩ (𝐹 “ 𝐵) ⊆ (𝐹‘𝐶)))
119, 10imbitrrdi 255 . 2 ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥) → (𝐹‘𝐶) = ∩ (𝐹 “ 𝐵)))
124, 11impbid 215 1 ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → ((𝐹‘𝐶) = ∩ (𝐹 “ 𝐵) ↔ ∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ⊆ wss 3900  ∩ cint 4910   “ cima 5658   Fn wfn 6553  ‘cfv 6558
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5252  ax-nul 5263  ax-pr 5395
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-br 5107  df-opab 5171  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6512  df-fun 6560  df-fn 6561  df-fv 6566
This theorem is used by:  dfscott2  35826
  Copyright terms: Public domain W3C validator