Theorem fpwfvss 44252

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 7076	. . 3 ⊢ (𝐴 ∈ 𝐶 → (𝐹‘𝐴) ∈ 𝒫 𝐵)
3	2	elpwid 4566	. 2 ⊢ (𝐴 ∈ 𝐶 → (𝐹‘𝐴) ⊆ 𝐵)
4	1	fdmi 6714	. . . . 5 ⊢ dom 𝐹 = 𝐶
5	4	eleq2i 2852	. . . 4 ⊢ (𝐴 ∈ dom 𝐹 ↔ 𝐴 ∈ 𝐶)
6		ndmfv 6910	. . . 4 ⊢ (¬ 𝐴 ∈ dom 𝐹 → (𝐹‘𝐴) = ∅)
7	5, 6	sylnbir 334	. . 3 ⊢ (¬ 𝐴 ∈ 𝐶 → (𝐹‘𝐴) = ∅)
8		0ss 4350	. . 3 ⊢ ∅ ⊆ 𝐵
9	7, 8	eqsstrdi 3975	. 2 ⊢ (¬ 𝐴 ∈ 𝐶 → (𝐹‘𝐴) ⊆ 𝐵)
10	3, 9	pm2.61i 184	1 ⊢ (𝐹‘𝐴) ⊆ 𝐵

This proof depends on syntax axioms:  ¬ wn 3   = wceq 1570   ∈ wcel 2145   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557  dom cdm 5655  ⟶wf 6529  ‘cfv 6533

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-nul 5263  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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-iota 6489  df-fun 6535  df-fn 6536  df-f 6537  df-fv 6541

This theorem is used by: (None)