![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > fimacnvdisj | Structured version Visualization version GIF version |
Description: The preimage of a class disjoint with a mapping's codomain is empty. (Contributed by FL, 24-Jan-2007.) |
Ref | Expression |
---|---|
fimacnvdisj | ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (◡𝐹 “ 𝐶) = ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | df-rn 5645 | . . . 4 ⊢ ran 𝐹 = dom ◡𝐹 | |
2 | frn 6676 | . . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → ran 𝐹 ⊆ 𝐵) | |
3 | 2 | adantr 482 | . . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → ran 𝐹 ⊆ 𝐵) |
4 | 1, 3 | eqsstrrid 3994 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → dom ◡𝐹 ⊆ 𝐵) |
5 | ssdisj 4420 | . . 3 ⊢ ((dom ◡𝐹 ⊆ 𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (dom ◡𝐹 ∩ 𝐶) = ∅) | |
6 | 4, 5 | sylancom 589 | . 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (dom ◡𝐹 ∩ 𝐶) = ∅) |
7 | imadisj 6033 | . 2 ⊢ ((◡𝐹 “ 𝐶) = ∅ ↔ (dom ◡𝐹 ∩ 𝐶) = ∅) | |
8 | 6, 7 | sylibr 233 | 1 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (◡𝐹 “ 𝐶) = ∅) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 397 = wceq 1542 ∩ cin 3910 ⊆ wss 3911 ∅c0 4283 ◡ccnv 5633 dom cdm 5634 ran crn 5635 “ cima 5637 ⟶wf 6493 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-10 2138 ax-11 2155 ax-12 2172 ax-ext 2708 ax-sep 5257 ax-nul 5264 ax-pr 5385 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-3an 1090 df-tru 1545 df-fal 1555 df-ex 1783 df-nf 1787 df-sb 2069 df-clab 2715 df-cleq 2729 df-clel 2815 df-ral 3066 df-rex 3075 df-rab 3409 df-v 3448 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4284 df-if 4488 df-sn 4588 df-pr 4590 df-op 4594 df-br 5107 df-opab 5169 df-xp 5640 df-cnv 5642 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-f 6501 |
This theorem is referenced by: vdwmc2 16852 gsumval3a 19681 psrbag0 21473 mbfconstlem 24994 itg1val2 25051 ofpreima2 31585 |
Copyright terms: Public domain | W3C validator |