Theorem funimass2 6631

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

Assertion

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

Proof of Theorem funimass2

Step	Hyp	Ref	Expression
1		funimacnv 6629	. . . 4 ⊢ (Fun 𝐹 → (𝐹 “ (◡𝐹 “ 𝐵)) = (𝐵 ∩ ran 𝐹))
2	1	sseq2d 4014	. . 3 ⊢ (Fun 𝐹 → ((𝐹 “ 𝐴) ⊆ (𝐹 “ (◡𝐹 “ 𝐵)) ↔ (𝐹 “ 𝐴) ⊆ (𝐵 ∩ ran 𝐹)))
3		inss1 4228	. . . 4 ⊢ (𝐵 ∩ ran 𝐹) ⊆ 𝐵
4		sstr2 3989	. . . 4 ⊢ ((𝐹 “ 𝐴) ⊆ (𝐵 ∩ ran 𝐹) → ((𝐵 ∩ ran 𝐹) ⊆ 𝐵 → (𝐹 “ 𝐴) ⊆ 𝐵))
5	3, 4	mpi 20	. . 3 ⊢ ((𝐹 “ 𝐴) ⊆ (𝐵 ∩ ran 𝐹) → (𝐹 “ 𝐴) ⊆ 𝐵)
6	2, 5	syl6bi 252	. 2 ⊢ (Fun 𝐹 → ((𝐹 “ 𝐴) ⊆ (𝐹 “ (◡𝐹 “ 𝐵)) → (𝐹 “ 𝐴) ⊆ 𝐵))
7		imass2 6101	. 2 ⊢ (𝐴 ⊆ (◡𝐹 “ 𝐵) → (𝐹 “ 𝐴) ⊆ (𝐹 “ (◡𝐹 “ 𝐵)))
8	6, 7	impel 506	1 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ (◡𝐹 “ 𝐵)) → (𝐹 “ 𝐴) ⊆ 𝐵)

Syntax hints:   → wi 4   ∧ wa 396   ∩ cin 3947   ⊆ wss 3948  ^◡ccnv 5675  ran crn 5677   “ cima 5679  Fun wfun 6537

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 5299  ax-nul 5306  ax-pr 5427

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 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-if 4529  df-sn 4629  df-pr 4631  df-op 4635  df-br 5149  df-opab 5211  df-id 5574  df-xp 5682  df-rel 5683  df-cnv 5684  df-co 5685  df-dm 5686  df-rn 5687  df-res 5688  df-ima 5689  df-fun 6545

This theorem is referenced by:  fvimacnvi  7053  lmhmlsp  20659  2ndcomap  22961  tgqtop  23215  kqreglem1  23244  fmfnfmlem4  23460  fmucnd  23796  cfilucfil  24067  zarcmplem  32856