Theorem fpwfvss 44674

Description: Functions into a powerset always have values which are subsets. This is dependant on our convention when the argument is not part of the domain. (Contributed by RP, 13-Sep-2024.)

Hypothesis

Ref	Expression
fpwfvss.f	⊢ 𝐹:𝐶⟶𝒫 𝐵

Assertion

Ref	Expression
fpwfvss	⊢ (𝐹‘𝐴) ⊆ 𝐵

Proof of Theorem fpwfvss

Step	Hyp	Ref	Expression
1		fpwfvss.f	. . . 4 ⊢ 𝐹:𝐶⟶𝒫 𝐵
2	1	ffvelcdmi 7115	. . 3 ⊢ (𝐴 ∈ 𝐶 → (𝐹‘𝐴) ∈ 𝒫 𝐵)
3	2	elpwid 4569	. 2 ⊢ (𝐴 ∈ 𝐶 → (𝐹‘𝐴) ⊆ 𝐵)
4	1	fdmi 6751	. . . . 5 ⊢ dom 𝐹 = 𝐶
5	4	eleq2i 2856	. . . 4 ⊢ (𝐴 ∈ dom 𝐹 ↔ 𝐴 ∈ 𝐶)
6		ndmfv 6948	. . . 4 ⊢ (¬ 𝐴 ∈ dom 𝐹 → (𝐹‘𝐴) = ∅)
7	5, 6	sylnbir 334	. . 3 ⊢ (¬ 𝐴 ∈ 𝐶 → (𝐹‘𝐴) = ∅)
8		0ss 4353	. . 3 ⊢ ∅ ⊆ 𝐵
9	7, 8	eqsstrdi 3957	. 2 ⊢ (¬ 𝐴 ∈ 𝐶 → (𝐹‘𝐴) ⊆ 𝐵)
10	3, 9	pm2.61i 184	1 ⊢ (𝐹‘𝐴) ⊆ 𝐵

This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2147   ⊆ wss 3900  ∅c0 4281  𝒫 cpw 4560  dom cdm 5658  ⟶wf 6562  ‘cfv 6566

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-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398

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-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-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574

This theorem is used by: (None)