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 48666
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 6731 . . . . . 6 (𝐹:𝐴⟶𝐵 → Fun 𝐹)
213ad2ant1 1151 . . . . 5 ((𝐹:𝐴⟶𝐵 ∧ 𝑆 ⊆ 𝐴 ∧ 𝑋 ∈ 𝑆) → Fun 𝐹)
32adantr 486 . . . 4 (((𝐹:𝐴⟶𝐵 ∧ 𝑆 ⊆ 𝐴 ∧ 𝑋 ∈ 𝑆) ∧ ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = (𝐹‘𝑋)) → Fun 𝐹)
4 funiunfv 7272 . . . 4 (Fun 𝐹 → ∪ 𝑦 ∈ 𝑆 (𝐹‘𝑦) = ∪ (𝐹 “ 𝑆))
53, 4syl 18 . . 3 (((𝐹:𝐴⟶𝐵 ∧ 𝑆 ⊆ 𝐴 ∧ 𝑋 ∈ 𝑆) ∧ ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = (𝐹‘𝑋)) → ∪ 𝑦 ∈ 𝑆 (𝐹‘𝑦) = ∪ (𝐹 “ 𝑆))
6 simp3 1156 . . . 4 ((𝐹:𝐴⟶𝐵 ∧ 𝑆 ⊆ 𝐴 ∧ 𝑋 ∈ 𝑆) → 𝑋 ∈ 𝑆)
7 fveqeq2 6914 . . . . . 6 (𝑥 = 𝑦 → ((𝐹‘𝑥) = (𝐹‘𝑋) ↔ (𝐹‘𝑦) = (𝐹‘𝑋)))
87cbvralvw 3244 . . . . 5 (∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = (𝐹‘𝑋) ↔ ∀𝑦 ∈ 𝑆 (𝐹‘𝑦) = (𝐹‘𝑋))
98biimpi 219 . . . 4 (∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = (𝐹‘𝑋) → ∀𝑦 ∈ 𝑆 (𝐹‘𝑦) = (𝐹‘𝑋))
10 fveq2 6905 . . . . 5 (𝑦 = 𝑋 → (𝐹‘𝑦) = (𝐹‘𝑋))
1110iuneqconst 4966 . . . 4 ((𝑋 ∈ 𝑆 ∧ ∀𝑦 ∈ 𝑆 (𝐹‘𝑦) = (𝐹‘𝑋)) → ∪ 𝑦 ∈ 𝑆 (𝐹‘𝑦) = (𝐹‘𝑋))
126, 9, 11syl2an 608 . . 3 (((𝐹:𝐴⟶𝐵 ∧ 𝑆 ⊆ 𝐴 ∧ 𝑋 ∈ 𝑆) ∧ ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = (𝐹‘𝑋)) → ∪ 𝑦 ∈ 𝑆 (𝐹‘𝑦) = (𝐹‘𝑋))
135, 12eqtr3d 2800 . 2 (((𝐹:𝐴⟶𝐵 ∧ 𝑆 ⊆ 𝐴 ∧ 𝑋 ∈ 𝑆) ∧ ∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = (𝐹‘𝑋)) → ∪ (𝐹 “ 𝑆) = (𝐹‘𝑋))
1413ex 418 1 ((𝐹:𝐴⟶𝐵 ∧ 𝑆 ⊆ 𝐴 ∧ 𝑋 ∈ 𝑆) → (∀𝑥 ∈ 𝑆 (𝐹‘𝑥) = (𝐹‘𝑋) → ∪ (𝐹 “ 𝑆) = (𝐹‘𝑋)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080   ⊆ wss 3900  ∪ cuni 4870  ∪ ciun 4954   “ cima 5658  Fun wfun 6549  ⟶wf 6551  ‘cfv 6555
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-nfc 2913  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-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  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 6509  df-fun 6557  df-fn 6558  df-f 6559  df-fv 6563
This theorem is used by:  uniimaprimaeqfv  48667
  Copyright terms: Public domain W3C validator