Theorem funimass1 6627

Description: A kind of contraposition law that infers a subclass of an image from a preimage subclass. (Contributed by NM, 25-May-2004.)

Assertion

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

Proof of Theorem funimass1

Step	Hyp	Ref	Expression
1		imass2 6098	. 2 ⊢ ((◡𝐹 “ 𝐴) ⊆ 𝐵 → (𝐹 “ (◡𝐹 “ 𝐴)) ⊆ (𝐹 “ 𝐵))
2		funimacnv 6626	. . . 4 ⊢ (Fun 𝐹 → (𝐹 “ (◡𝐹 “ 𝐴)) = (𝐴 ∩ ran 𝐹))
3		dfss 3965	. . . . . 6 ⊢ (𝐴 ⊆ ran 𝐹 ↔ 𝐴 = (𝐴 ∩ ran 𝐹))
4	3	biimpi 215	. . . . 5 ⊢ (𝐴 ⊆ ran 𝐹 → 𝐴 = (𝐴 ∩ ran 𝐹))
5	4	eqcomd 2738	. . . 4 ⊢ (𝐴 ⊆ ran 𝐹 → (𝐴 ∩ ran 𝐹) = 𝐴)
6	2, 5	sylan9eq 2792	. . 3 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹) → (𝐹 “ (◡𝐹 “ 𝐴)) = 𝐴)
7	6	sseq1d 4012	. 2 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹) → ((𝐹 “ (◡𝐹 “ 𝐴)) ⊆ (𝐹 “ 𝐵) ↔ 𝐴 ⊆ (𝐹 “ 𝐵)))
8	1, 7	imbitrid 243	1 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ ran 𝐹) → ((◡𝐹 “ 𝐴) ⊆ 𝐵 → 𝐴 ⊆ (𝐹 “ 𝐵)))

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1541   ∩ cin 3946   ⊆ wss 3947  ^◡ccnv 5674  ran crn 5676   “ cima 5678  Fun wfun 6534

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-12 2171  ax-ext 2703  ax-sep 5298  ax-nul 5305  ax-pr 5426

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-ral 3062  df-rex 3071  df-rab 3433  df-v 3476  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-sn 4628  df-pr 4630  df-op 4634  df-br 5148  df-opab 5210  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-fun 6542

This theorem is referenced by:  kqnrmlem1  23238  hmeontr  23264  nrmhmph  23289  cnheiborlem  24461