Theorem sspreima 7059

Description: The preimage of a subset is a subset of the preimage. (Contributed by Brendan Leahy, 23-Sep-2017.)

Assertion

Ref	Expression
sspreima	⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ 𝐵) → (◡𝐹 “ 𝐴) ⊆ (◡𝐹 “ 𝐵))

Proof of Theorem sspreima

Step	Hyp	Ref	Expression
1		inpreima 7055	. . 3 ⊢ (Fun 𝐹 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵)))
2		dfss2 3917	. . . . 5 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∩ 𝐵) = 𝐴)
3	2	biimpi 219	. . . 4 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∩ 𝐵) = 𝐴)
4	3	imaeq2d 6054	. . 3 ⊢ (𝐴 ⊆ 𝐵 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = (◡𝐹 “ 𝐴))
5	1, 4	sylan9req 2817	. 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ 𝐵) → ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵)) = (◡𝐹 “ 𝐴))
6		dfss2 3917	. 2 ⊢ ((◡𝐹 “ 𝐴) ⊆ (◡𝐹 “ 𝐵) ↔ ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵)) = (◡𝐹 “ 𝐴))
7	5, 6	sylibr 237	1 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ 𝐵) → (◡𝐹 “ 𝐴) ⊆ (◡𝐹 “ 𝐵))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∩ cin 3898   ⊆ wss 3899  ^◡ccnv 5650   “ cima 5654  Fun wfun 6525

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 2733  ax-sep 5249  ax-pr 5391

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 2565  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-fun 6533

This theorem is used by:  pwrssmgc  33543  gsumhashmul  33610  elrspunidl  33960  carsggect  34933  eulerpartlemmf  34990  eulerpartlemgf  34994  orvclteinc  35091  cnneiima  49969