| 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 5642 | . . . 4 ⊢ ran 𝐹 = dom ◡𝐹 | |
| 2 | frn 6675 | . . . . 5 ⊢ (𝐹:𝐴⟶𝐵 → ran 𝐹 ⊆ 𝐵) | |
| 3 | 2 | adantr 480 | . . . 4 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → ran 𝐹 ⊆ 𝐵) |
| 4 | 1, 3 | eqsstrrid 3961 | . . 3 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → dom ◡𝐹 ⊆ 𝐵) |
| 5 | ssdisj 4400 | . . 3 ⊢ ((dom ◡𝐹 ⊆ 𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (dom ◡𝐹 ∩ 𝐶) = ∅) | |
| 6 | 4, 5 | sylancom 589 | . 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (dom ◡𝐹 ∩ 𝐶) = ∅) |
| 7 | imadisj 6045 | . 2 ⊢ ((◡𝐹 “ 𝐶) = ∅ ↔ (dom ◡𝐹 ∩ 𝐶) = ∅) | |
| 8 | 6, 7 | sylibr 234 | 1 ⊢ ((𝐹:𝐴⟶𝐵 ∧ (𝐵 ∩ 𝐶) = ∅) → (◡𝐹 “ 𝐶) = ∅) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 395 = wceq 1542 ∩ cin 3888 ⊆ wss 3889 ∅c0 4273 ◡ccnv 5630 dom cdm 5631 ran crn 5632 “ cima 5634 ⟶wf 6494 |
| 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 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2708 ax-sep 5231 ax-pr 5375 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-sb 2069 df-clab 2715 df-cleq 2728 df-clel 2811 df-ral 3052 df-rex 3062 df-rab 3390 df-v 3431 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-sn 4568 df-pr 4570 df-op 4574 df-br 5086 df-opab 5148 df-xp 5637 df-cnv 5639 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-f 6502 |
| This theorem is referenced by: vdwmc2 16950 gsumval3a 19878 psrbag0 22040 mbfconstlem 25594 itg1val2 25651 ofpreima2 32739 |
| Copyright terms: Public domain | W3C validator |