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 35646
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 3988 . . 3 ((𝐹‘𝐶) = ∩ (𝐹 “ 𝐵) → (𝐹‘𝐶) ⊆ ∩ (𝐹 “ 𝐵))
2 fnssintima 7360 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴) → ((𝐹‘𝐶) ⊆ ∩ (𝐹 “ 𝐵) ↔ ∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥)))
323adant3 1150 . . 3 ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → ((𝐹‘𝐶) ⊆ ∩ (𝐹 “ 𝐵) ↔ ∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥)))
41, 3imbitrid 247 . 2 ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → ((𝐹‘𝐶) = ∩ (𝐹 “ 𝐵) → ∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥)))
53biimprd 251 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥) → (𝐹‘𝐶) ⊆ ∩ (𝐹 “ 𝐵)))
6 fnfvima 7227 . . . . 5 ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → (𝐹‘𝐶) ∈ (𝐹 “ 𝐵))
7 intss1 4922 . . . . 5 ((𝐹‘𝐶) ∈ (𝐹 “ 𝐵) → ∩ (𝐹 “ 𝐵) ⊆ (𝐹‘𝐶))
86, 7syl 18 . . . 4 ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → ∩ (𝐹 “ 𝐵) ⊆ (𝐹‘𝐶))
95, 8jctird 536 . . 3 ((𝐹 Fn 𝐴 ∧ 𝐵 ⊆ 𝐴 ∧ 𝐶 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 (𝐹‘𝐶) ⊆ (𝐹‘𝑥) → ((𝐹‘𝐶) ⊆ ∩ (𝐹 “ 𝐵) ∧ ∩ (𝐹 “ 𝐵) ⊆ (𝐹‘𝐶))))
10 eqss 3945 . . 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 2145  ∀wral 3076   ⊆ wss 3898  ∩ cint 4906   “ cima 5650   Fn wfn 6522  ‘cfv 6527
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390
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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-br 5103  df-opab 5167  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6483  df-fun 6529  df-fn 6530  df-fv 6535
This theorem is used by:  dfscott2  35672
  Copyright terms: Public domain W3C validator