Theorem funimass2 5459

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		imass2 5163	. 2 ⊢ (𝐴 ⊆ (◡𝐹 “ 𝐵) → (𝐹 “ 𝐴) ⊆ (𝐹 “ (◡𝐹 “ 𝐵)))
2		funimacnv 5457	. . . . 5 ⊢ (Fun 𝐹 → (𝐹 “ (◡𝐹 “ 𝐵)) = (𝐵 ∩ ran 𝐹))
3	2	sseq2d 3278	. . . 4 ⊢ (Fun 𝐹 → ((𝐹 “ 𝐴) ⊆ (𝐹 “ (◡𝐹 “ 𝐵)) ↔ (𝐹 “ 𝐴) ⊆ (𝐵 ∩ ran 𝐹)))
4		inss1 3451	. . . . 5 ⊢ (𝐵 ∩ ran 𝐹) ⊆ 𝐵
5		sstr2 3255	. . . . 5 ⊢ ((𝐹 “ 𝐴) ⊆ (𝐵 ∩ ran 𝐹) → ((𝐵 ∩ ran 𝐹) ⊆ 𝐵 → (𝐹 “ 𝐴) ⊆ 𝐵))
6	4, 5	mpi 15	. . . 4 ⊢ ((𝐹 “ 𝐴) ⊆ (𝐵 ∩ ran 𝐹) → (𝐹 “ 𝐴) ⊆ 𝐵)
7	3, 6	biimtrdi 163	. . 3 ⊢ (Fun 𝐹 → ((𝐹 “ 𝐴) ⊆ (𝐹 “ (◡𝐹 “ 𝐵)) → (𝐹 “ 𝐴) ⊆ 𝐵))
8	7	imp 124	. 2 ⊢ ((Fun 𝐹 ∧ (𝐹 “ 𝐴) ⊆ (𝐹 “ (◡𝐹 “ 𝐵))) → (𝐹 “ 𝐴) ⊆ 𝐵)
9	1, 8	sylan2 286	1 ⊢ ((Fun 𝐹 ∧ 𝐴 ⊆ (◡𝐹 “ 𝐵)) → (𝐹 “ 𝐴) ⊆ 𝐵)

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ∩ cin 3219   ⊆ wss 3220  ^◡ccnv 4773  ran crn 4775   “ cima 4777  Fun wfun 5371

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ral 2533  df-rex 2534  df-v 2823  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-br 4131  df-opab 4193  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-fun 5379

This theorem is used by:  fvimacnvi  5823