![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > f0dom0 | GIF version |
Description: A function is empty iff it has an empty domain. (Contributed by AV, 10-Feb-2019.) |
Ref | Expression |
---|---|
f0dom0 | ⊢ (𝐹:𝑋⟶𝑌 → (𝑋 = ∅ ↔ 𝐹 = ∅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | feq2 5344 | . . . 4 ⊢ (𝑋 = ∅ → (𝐹:𝑋⟶𝑌 ↔ 𝐹:∅⟶𝑌)) | |
2 | f0bi 5403 | . . . . 5 ⊢ (𝐹:∅⟶𝑌 ↔ 𝐹 = ∅) | |
3 | 2 | biimpi 120 | . . . 4 ⊢ (𝐹:∅⟶𝑌 → 𝐹 = ∅) |
4 | 1, 3 | syl6bi 163 | . . 3 ⊢ (𝑋 = ∅ → (𝐹:𝑋⟶𝑌 → 𝐹 = ∅)) |
5 | 4 | com12 30 | . 2 ⊢ (𝐹:𝑋⟶𝑌 → (𝑋 = ∅ → 𝐹 = ∅)) |
6 | feq1 5343 | . . . 4 ⊢ (𝐹 = ∅ → (𝐹:𝑋⟶𝑌 ↔ ∅:𝑋⟶𝑌)) | |
7 | fdm 5366 | . . . . 5 ⊢ (∅:𝑋⟶𝑌 → dom ∅ = 𝑋) | |
8 | dm0 4836 | . . . . 5 ⊢ dom ∅ = ∅ | |
9 | 7, 8 | eqtr3di 2225 | . . . 4 ⊢ (∅:𝑋⟶𝑌 → 𝑋 = ∅) |
10 | 6, 9 | syl6bi 163 | . . 3 ⊢ (𝐹 = ∅ → (𝐹:𝑋⟶𝑌 → 𝑋 = ∅)) |
11 | 10 | com12 30 | . 2 ⊢ (𝐹:𝑋⟶𝑌 → (𝐹 = ∅ → 𝑋 = ∅)) |
12 | 5, 11 | impbid 129 | 1 ⊢ (𝐹:𝑋⟶𝑌 → (𝑋 = ∅ ↔ 𝐹 = ∅)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ↔ wb 105 = wceq 1353 ∅c0 3422 dom cdm 4622 ⟶wf 5207 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 614 ax-in2 615 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-14 2151 ax-ext 2159 ax-sep 4118 ax-nul 4126 ax-pow 4171 ax-pr 4205 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-fal 1359 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rex 2461 df-v 2739 df-dif 3131 df-un 3133 df-in 3135 df-ss 3142 df-nul 3423 df-pw 3576 df-sn 3597 df-pr 3598 df-op 3600 df-br 4001 df-opab 4062 df-id 4289 df-xp 4628 df-rel 4629 df-cnv 4630 df-co 4631 df-dm 4632 df-rn 4633 df-fun 5213 df-fn 5214 df-f 5215 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |