Theorem fimacnvdisj 6769

Description: The preimage of a class disjoint with a mapping's codomain is empty. (Contributed by FL, 24-Jan-2007.)

Assertion

Ref	Expression
fimacnvdisj	⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (◡𝐹 “ 𝐶) = ∅)

Proof of Theorem fimacnvdisj

Step	Hyp	Ref	Expression
1		df-rn 5683	. . . 4 ⊢ ran 𝐹 = dom ◡𝐹
2		frn 6723	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → ran 𝐹 ⊆ 𝐵)
3	2	adantr 480	. . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → ran 𝐹 ⊆ 𝐵)
4	1, 3	eqsstrrid 4027	. . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → dom ◡𝐹 ⊆ 𝐵)
5		ssdisj 4455	. . 3 ⊢ ((dom ◡𝐹 ⊆ 𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (dom ◡𝐹 ∩ 𝐶) = ∅)
6	4, 5	sylancom 587	. 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (dom ◡𝐹 ∩ 𝐶) = ∅)
7		imadisj 6077	. 2 ⊢ ((◡𝐹 “ 𝐶) = ∅ ↔ (dom ◡𝐹 ∩ 𝐶) = ∅)
8	6, 7	sylibr 233	1 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (◡𝐹 “ 𝐶) = ∅)

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1534   ∩ cin 3943   ⊆ wss 3944  ∅c0 4318  ^◡ccnv 5671  dom cdm 5672  ran crn 5673   “ cima 5675  ⟶wf 6538

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2164  ax-ext 2698  ax-sep 5293  ax-nul 5300  ax-pr 5423

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-clab 2705  df-cleq 2719  df-clel 2805  df-ral 3057  df-rex 3066  df-rab 3428  df-v 3471  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4319  df-if 4525  df-sn 4625  df-pr 4627  df-op 4631  df-br 5143  df-opab 5205  df-xp 5678  df-cnv 5680  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-f 6546

This theorem is referenced by:  vdwmc2  16933  gsumval3a  19842  psrbag0  21984  mbfconstlem  25530  itg1val2  25587  ofpreima2  32422