Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > f0cli | Structured version Visualization version GIF version |
Description: Unconditional closure of a function when the range includes the empty set. (Contributed by Mario Carneiro, 12-Sep-2013.) |
Ref | Expression |
---|---|
f0cl.1 | ⊢ 𝐹:𝐴⟶𝐵 |
f0cl.2 | ⊢ ∅ ∈ 𝐵 |
Ref | Expression |
---|---|
f0cli | ⊢ (𝐹‘𝐶) ∈ 𝐵 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | f0cl.1 | . . 3 ⊢ 𝐹:𝐴⟶𝐵 | |
2 | 1 | ffvelrni 6849 | . 2 ⊢ (𝐶 ∈ 𝐴 → (𝐹‘𝐶) ∈ 𝐵) |
3 | 1 | fdmi 6523 | . . . 4 ⊢ dom 𝐹 = 𝐴 |
4 | 3 | eleq2i 2904 | . . 3 ⊢ (𝐶 ∈ dom 𝐹 ↔ 𝐶 ∈ 𝐴) |
5 | ndmfv 6699 | . . . 4 ⊢ (¬ 𝐶 ∈ dom 𝐹 → (𝐹‘𝐶) = ∅) | |
6 | f0cl.2 | . . . 4 ⊢ ∅ ∈ 𝐵 | |
7 | 5, 6 | eqeltrdi 2921 | . . 3 ⊢ (¬ 𝐶 ∈ dom 𝐹 → (𝐹‘𝐶) ∈ 𝐵) |
8 | 4, 7 | sylnbir 333 | . 2 ⊢ (¬ 𝐶 ∈ 𝐴 → (𝐹‘𝐶) ∈ 𝐵) |
9 | 2, 8 | pm2.61i 184 | 1 ⊢ (𝐹‘𝐶) ∈ 𝐵 |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 ∈ wcel 2110 ∅c0 4290 dom cdm 5554 ⟶wf 6350 ‘cfv 6354 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5202 ax-nul 5209 ax-pow 5265 ax-pr 5329 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3772 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4567 df-pr 4569 df-op 4573 df-uni 4838 df-br 5066 df-opab 5128 df-id 5459 df-xp 5560 df-rel 5561 df-cnv 5562 df-co 5563 df-dm 5564 df-rn 5565 df-iota 6313 df-fun 6356 df-fn 6357 df-f 6358 df-fv 6362 |
This theorem is referenced by: harcl 9024 cantnfvalf 9127 rankon 9223 cardon 9372 alephon 9494 ackbij1lem13 9653 ackbij1b 9660 ixxssxr 12749 sadcf 15801 smupf 15826 iccordt 21821 nodense 33196 bdayelon 33246 |
Copyright terms: Public domain | W3C validator |