Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  uniimafveqt Structured version   Visualization version   GIF version

Theorem uniimafveqt 48463
Description: The union of the image of a subset 𝑆 of the domain of a function with elements having the same function value is the function value at one of the elements of 𝑆. (Contributed by AV, 5-Mar-2024.)
Assertion
Ref Expression
uniimafveqt ((𝐹:𝐴⟶𝐵 ∧ 𝑆 ⊆ 𝐴 ∧ 𝑋 ∈ 𝑆) → (∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = (𝐹‘𝑋) → ∪ (𝐹 “ 𝑆) = (𝐹‘𝑋)))
Distinct variable groups:   𝑥,𝐹   𝑥,𝑆   𝑥,𝑋
Allowed substitution hints:   𝐴(𝑥)   𝐵(𝑥)

Proof of Theorem uniimafveqt
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 ffun 6712 . . . . . 6 (𝐹:𝐴⟶𝐵 → Fun 𝐹)
213ad2ant1 1151 . . . . 5 ((𝐹:𝐴⟶𝐵 ∧ 𝑆 ⊆ 𝐴 ∧ 𝑋 ∈ 𝑆) → Fun 𝐹)
32adantr 486 . . . 4 (((𝐹:𝐴⟶𝐵 ∧ 𝑆 ⊆ 𝐴 ∧ 𝑋 ∈ 𝑆) ∧ ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = (𝐹‘𝑋)) → Fun 𝐹)
4 funiunfv 7252 . . . 4 (Fun 𝐹 → ∪ 𝑦 ∈ 𝑆 (𝐹‘𝑦) = ∪ (𝐹 “ 𝑆))
53, 4syl 18 . . 3 (((𝐹:𝐴⟶𝐵 ∧ 𝑆 ⊆ 𝐴 ∧ 𝑋 ∈ 𝑆) ∧ ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = (𝐹‘𝑋)) → ∪ 𝑦 ∈ 𝑆 (𝐹‘𝑦) = ∪ (𝐹 “ 𝑆))
6 simp3 1156 . . . 4 ((𝐹:𝐴⟶𝐵 ∧ 𝑆 ⊆ 𝐴 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝑆)
7 fveqeq2 6894 . . . . . 6 (𝑥 = 𝑦 → ((𝐹‘𝑥) = (𝐹‘𝑋) ↔ (𝐹‘𝑦) = (𝐹‘𝑋)))
87cbvralvw 3240 . . . . 5 (∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = (𝐹‘𝑋) ↔ ∀𝑦 ∈ 𝑆 (𝐹‘𝑦) = (𝐹‘𝑋))
98biimpi 219 . . . 4 (∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = (𝐹‘𝑋) → ∀𝑦 ∈ 𝑆 (𝐹‘𝑦) = (𝐹‘𝑋))
10 fveq2 6885 . . . . 5 (𝑦 = 𝑋 → (𝐹‘𝑦) = (𝐹‘𝑋))
1110iuneqconst 4962 . . . 4 ((𝑋 ∈ 𝑆 ∧ ∀𝑦 ∈ 𝑆 (𝐹‘𝑦) = (𝐹‘𝑋)) → ∪ 𝑦 ∈ 𝑆 (𝐹‘𝑦) = (𝐹‘𝑋))
126, 9, 11syl2an 608 . . 3 (((𝐹:𝐴⟶𝐵 ∧ 𝑆 ⊆ 𝐴 ∧ 𝑋 ∈ 𝑆) ∧ ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = (𝐹‘𝑋)) → ∪ 𝑦 ∈ 𝑆 (𝐹‘𝑦) = (𝐹‘𝑋))
135, 12eqtr3d 2797 . 2 (((𝐹:𝐴⟶𝐵 ∧ 𝑆 ⊆ 𝐴 ∧ 𝑋 ∈ 𝑆) ∧ ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = (𝐹‘𝑋)) → ∪ (𝐹 “ 𝑆) = (𝐹‘𝑋))
1413ex 418 1 ((𝐹:𝐴⟶𝐵 ∧ 𝑆 ⊆ 𝐴 ∧ 𝑋 ∈ 𝑆) → (∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = (𝐹‘𝑋) → ∪ (𝐹 “ 𝑆) = (𝐹‘𝑋)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144  ∀wral 3076   ⊆ wss 3895  ∪ cuni 4866  ∪ ciun 4950   “ cima 5653  Fun wfun 6532  ⟶wf 6534  ‘cfv 6538
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  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 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-fv 6546
This theorem is used by:  uniimaprimaeqfv  48464
  Copyright terms: Public domain W3C validator