Theorem funimass2 6623

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 6621	. . . 4 ⊢ (Fun 𝐹 → (𝐹 “ (◡𝐹 “ 𝐵)) = (𝐵 ∩ ran 𝐹))
2	1	sseq2d 3940	. . 3 ⊢ (Fun 𝐹 → ((𝐹 “ 𝐴) ⊆ (𝐹 “ (◡𝐹 “ 𝐵)) ↔ (𝐹 “ 𝐴) ⊆ (𝐵 ∩ ran 𝐹)))
3		inss1 4133	. . . 4 ⊢ (𝐵 ∩ ran 𝐹) ⊆ 𝐵
4		sstr2 3915	. . . 4 ⊢ ((𝐹 “ 𝐴) ⊆ (𝐵 ∩ ran 𝐹) → ((𝐵 ∩ ran 𝐹) ⊆ 𝐵 → (𝐹 “ 𝐴) ⊆ 𝐵))
5	3, 4	mpi 21	. . 3 ⊢ ((𝐹 “ 𝐴) ⊆ (𝐵 ∩ ran 𝐹) → (𝐹 “ 𝐴) ⊆ 𝐵)
6	2, 5	biimtrdi 256	. 2 ⊢ (Fun 𝐹 → ((𝐹 “ 𝐴) ⊆ (𝐹 “ (◡𝐹 “ 𝐵)) → (𝐹 “ 𝐴) ⊆ 𝐵))
7		imass2 6054	. 2 ⊢ (𝐴 ⊆ (◡𝐹 “ 𝐵) → (𝐹 “ 𝐴) ⊆ (𝐹 “ (◡𝐹 “ 𝐵)))
8	6, 7	impel 515	1 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ (◡𝐹 “ 𝐵)) → (𝐹 “ 𝐴) ⊆ 𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ⊆ wss 3895   ∩ cin 4089  ^◡ccnv 5649  ran crn 5651   “ cima 5653  Fun wfun 6532

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-pr 5390

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-br 5103  df-opab 5167  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-fun 6540

This theorem is used by:  fvimacnvi  7051  lmhmlsp  21329  2ndcomap  23782  tgqtop  24036  kqreglem1  24065  fmfnfmlem4  24281  fmucnd  24615  cfilucfil  24883  zarcmplem  34559