Theorem sspreima 7064

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 7060	. . 3 ⊢ (Fun 𝐹 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵)))
2		dfss2 3920	. . . . 5 ⊢ (𝐴 ⊆ 𝐵 ↔ (𝐴 ∩ 𝐵) = 𝐴)
3	2	biimpi 219	. . . 4 ⊢ (𝐴 ⊆ 𝐵 → (𝐴 ∩ 𝐵) = 𝐴)
4	3	imaeq2d 6060	. . 3 ⊢ (𝐴 ⊆ 𝐵 → (◡𝐹 “ (𝐴 ∩ 𝐵)) = (◡𝐹 “ 𝐴))
5	1, 4	sylan9req 2818	. 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ 𝐵) → ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵)) = (◡𝐹 “ 𝐴))
6		dfss2 3920	. 2 ⊢ ((◡𝐹 “ 𝐴) ⊆ (◡𝐹 “ 𝐵) ↔ ((◡𝐹 “ 𝐴) ∩ (◡𝐹 “ 𝐵)) = (◡𝐹 “ 𝐴))
7	5, 6	sylibr 237	1 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ 𝐵) → (◡𝐹 “ 𝐴) ⊆ (◡𝐹 “ 𝐵))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∩ cin 3901   ⊆ wss 3902  ^◡ccnv 5658   “ cima 5662  Fun wfun 6531

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 2215  ax-ext 2734  ax-sep 5255  ax-pr 5402

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 2566  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-fun 6539

This theorem is used by:  pwrssmgc  33448  gsumhashmul  33515  elrspunidl  33864  carsggect  34837  eulerpartlemmf  34894  eulerpartlemgf  34898  orvclteinc  34995  cnneiima  49851