Theorem preimafvsspwdm 48471

Description: The class 𝑃 of all preimages of function values is a subset of the power set of the domain of the function. (Contributed by AV, 5-Mar-2024.)

Hypothesis

Ref	Expression
setpreimafvex.p	⊢ 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}

Assertion

Ref	Expression
preimafvsspwdm	⊢ (𝐹 Fn 𝐴 → 𝑃 ⊆ 𝒫 𝐴)

Distinct variable groups:   𝑥,𝐴,𝑧   𝑥,𝐹,𝑧   𝑥,𝑃

Allowed substitution hint:   𝑃(𝑧)

Proof of Theorem preimafvsspwdm

Dummy variable 𝑠 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		setpreimafvex.p	. . . 4 ⊢ 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}
2	1	elsetpreimafvssdm 48468	. . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑠 ∈ 𝑃) → 𝑠 ⊆ 𝐴)
3	2	ralrimiva 3154	. 2 ⊢ (𝐹 Fn 𝐴 → ∀𝑠 ∈ 𝑃 𝑠 ⊆ 𝐴)
4		pwssb 5060	. 2 ⊢ (𝑃 ⊆ 𝒫 𝐴 ↔ ∀𝑠 ∈ 𝑃 𝑠 ⊆ 𝐴)
5	3, 4	sylibr 237	1 ⊢ (𝐹 Fn 𝐴 → 𝑃 ⊆ 𝒫 𝐴)

This proof depends on syntax axioms:   → wi 4   = wceq 1569  {cab 2738  ∀wral 3076  ∃wrex 3086   ⊆ wss 3895  𝒫 cpw 4556  {csn 4583  ^◡ccnv 5649   “ cima 5653   Fn wfn 6533  ‘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-ext 2732  ax-sep 5248  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-sb 2099  df-clab 2739  df-cleq 2752  df-clel 2835  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-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-br 5103  df-opab 5167  df-xp 5656  df-rel 5657  df-cnv 5658  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-fn 6541

This theorem is used by: (None)