Theorem elsetpreimafvssdm 43620

Description: An element of the class 𝑃 of all preimages of function values is a subset of the domain of the function. (Contributed by AV, 8-Mar-2024.)

Hypothesis

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

Assertion

Ref	Expression
elsetpreimafvssdm	⊢ ((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃) → 𝑆 ⊆ 𝐴)

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

Allowed substitution hints:   𝑃(𝑥,𝑧)

Proof of Theorem elsetpreimafvssdm

Step	Hyp	Ref	Expression
1		setpreimafvex.p	. . . 4 ⊢ 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}
2	1	elsetpreimafv 43619	. . 3 ⊢ (𝑆 ∈ 𝑃 → ∃𝑥 ∈ 𝐴 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}))
3		cnvimass 5942	. . . . . . . . 9 ⊢ (◡𝐹 “ {(𝐹‘𝑥)}) ⊆ dom 𝐹
4		fndm 6448	. . . . . . . . 9 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴)
5	3, 4	sseqtrid 4012	. . . . . . . 8 ⊢ (𝐹 Fn 𝐴 → (◡𝐹 “ {(𝐹‘𝑥)}) ⊆ 𝐴)
6	5	adantr 483	. . . . . . 7 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (◡𝐹 “ {(𝐹‘𝑥)}) ⊆ 𝐴)
7		sseq1 3985	. . . . . . 7 ⊢ (𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}) → (𝑆 ⊆ 𝐴 ↔ (◡𝐹 “ {(𝐹‘𝑥)}) ⊆ 𝐴))
8	6, 7	syl5ibrcom 249	. . . . . 6 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑥 ∈ 𝐴) → (𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}) → 𝑆 ⊆ 𝐴))
9	8	expcom 416	. . . . 5 ⊢ (𝑥 ∈ 𝐴 → (𝐹 Fn 𝐴 → (𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}) → 𝑆 ⊆ 𝐴)))
10	9	com23 86	. . . 4 ⊢ (𝑥 ∈ 𝐴 → (𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}) → (𝐹 Fn 𝐴 → 𝑆 ⊆ 𝐴)))
11	10	rexlimiv 3279	. . 3 ⊢ (∃𝑥 ∈ 𝐴 𝑆 = (◡𝐹 “ {(𝐹‘𝑥)}) → (𝐹 Fn 𝐴 → 𝑆 ⊆ 𝐴))
12	2, 11	syl 17	. 2 ⊢ (𝑆 ∈ 𝑃 → (𝐹 Fn 𝐴 → 𝑆 ⊆ 𝐴))
13	12	impcom 410	1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑆 ∈ 𝑃) → 𝑆 ⊆ 𝐴)

Syntax hints:   → wi 4   ∧ wa 398   = wceq 1536   ∈ wcel 2113  {cab 2798  ∃wrex 3138   ⊆ wss 3929  {csn 4560  ^◡ccnv 5547  dom cdm 5548   “ cima 5551   Fn wfn 6343  ‘cfv 6348

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2792  ax-sep 5196  ax-nul 5203  ax-pr 5323

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1084  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2799  df-cleq 2813  df-clel 2892  df-nfc 2962  df-ral 3142  df-rex 3143  df-rab 3146  df-v 3493  df-dif 3932  df-un 3934  df-in 3936  df-ss 3945  df-nul 4285  df-if 4461  df-sn 4561  df-pr 4563  df-op 4567  df-br 5060  df-opab 5122  df-xp 5554  df-cnv 5556  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-fn 6351

This theorem is referenced by:  preimafvsspwdm  43623  uniimaelsetpreimafv  43630