| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > f1o00 | Structured version Visualization version GIF version | ||
| Description: One-to-one onto mapping of the empty set. (Contributed by NM, 15-Apr-1998.) |
| Ref | Expression |
|---|---|
| f1o00 | ⊢ (𝐹:∅⟶1-1onto𝐴 ↔ (𝐹 = ∅ ∧ 𝐴 = ∅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dff1o4 6862 | . 2 ⊢ (𝐹:∅⟶1-1onto𝐴 ↔ (𝐹 Fn ∅ ∧ ◡𝐹 Fn 𝐴)) | |
| 2 | fn0 6699 | . . . . 5 ⊢ (𝐹 Fn ∅ ↔ 𝐹 = ∅) | |
| 3 | 2 | birani 509 | . . . 4 ⊢ ((𝐹 Fn ∅ ∧ ◡𝐹 Fn 𝐴) → 𝐹 = ∅) |
| 4 | cnveq 5862 | . . . . . . . . . 10 ⊢ (𝐹 = ∅ → ◡𝐹 = ◡∅) | |
| 5 | cnv0 5872 | . . . . . . . . . 10 ⊢ ◡∅ = ∅ | |
| 6 | 4, 5 | eqtrdi 2817 | . . . . . . . . 9 ⊢ (𝐹 = ∅ → ◡𝐹 = ∅) |
| 7 | 2, 6 | sylbi 220 | . . . . . . . 8 ⊢ (𝐹 Fn ∅ → ◡𝐹 = ∅) |
| 8 | 7 | fneq1d 6661 | . . . . . . 7 ⊢ (𝐹 Fn ∅ → (◡𝐹 Fn 𝐴 ↔ ∅ Fn 𝐴)) |
| 9 | 8 | biimpa 482 | . . . . . 6 ⊢ ((𝐹 Fn ∅ ∧ ◡𝐹 Fn 𝐴) → ∅ Fn 𝐴) |
| 10 | 9 | fndmd 6673 | . . . . 5 ⊢ ((𝐹 Fn ∅ ∧ ◡𝐹 Fn 𝐴) → dom ∅ = 𝐴) |
| 11 | dm0 5913 | . . . . 5 ⊢ dom ∅ = ∅ | |
| 12 | 10, 11 | eqtr3di 2816 | . . . 4 ⊢ ((𝐹 Fn ∅ ∧ ◡𝐹 Fn 𝐴) → 𝐴 = ∅) |
| 13 | 3, 12 | jca 521 | . . 3 ⊢ ((𝐹 Fn ∅ ∧ ◡𝐹 Fn 𝐴) → (𝐹 = ∅ ∧ 𝐴 = ∅)) |
| 14 | 2 | biranri 511 | . . . 4 ⊢ ((𝐹 = ∅ ∧ 𝐴 = ∅) → 𝐹 Fn ∅) |
| 15 | eqid 2766 | . . . . . 6 ⊢ ∅ = ∅ | |
| 16 | fn0 6699 | . . . . . 6 ⊢ (∅ Fn ∅ ↔ ∅ = ∅) | |
| 17 | 15, 16 | mpbir 234 | . . . . 5 ⊢ ∅ Fn ∅ |
| 18 | 6 | fneq1d 6661 | . . . . . 6 ⊢ (𝐹 = ∅ → (◡𝐹 Fn 𝐴 ↔ ∅ Fn 𝐴)) |
| 19 | fneq2 6660 | . . . . . 6 ⊢ (𝐴 = ∅ → (∅ Fn 𝐴 ↔ ∅ Fn ∅)) | |
| 20 | 18, 19 | sylan9bb 519 | . . . . 5 ⊢ ((𝐹 = ∅ ∧ 𝐴 = ∅) → (◡𝐹 Fn 𝐴 ↔ ∅ Fn ∅)) |
| 21 | 17, 20 | mpbiri 261 | . . . 4 ⊢ ((𝐹 = ∅ ∧ 𝐴 = ∅) → ◡𝐹 Fn 𝐴) |
| 22 | 14, 21 | jca 521 | . . 3 ⊢ ((𝐹 = ∅ ∧ 𝐴 = ∅) → (𝐹 Fn ∅ ∧ ◡𝐹 Fn 𝐴)) |
| 23 | 13, 22 | impbii 212 | . 2 ⊢ ((𝐹 Fn ∅ ∧ ◡𝐹 Fn 𝐴) ↔ (𝐹 = ∅ ∧ 𝐴 = ∅)) |
| 24 | 1, 23 | bitri 278 | 1 ⊢ (𝐹:∅⟶1-1onto𝐴 ↔ (𝐹 = ∅ ∧ 𝐴 = ∅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1572 ∅c0 4280 ◡ccnv 5656 dom cdm 5657 Fn wfn 6560 ⟶1-1ontowf1o 6564 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-ext 2738 ax-sep 5254 ax-nul 5265 ax-pr 5397 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-sb 2104 df-mo 2570 df-clab 2745 df-cleq 2758 df-clel 2842 df-ral 3084 df-rex 3094 df-rab 3416 df-v 3455 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-sn 4588 df-pr 4590 df-op 4840 df-br 5108 df-opab 5173 df-id 5552 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 |
| This theorem is used by: fo00 6891 f1o0 6892 en0 9082 en0ALT 9083 en0r 9084 infn0 9331 symgbas0 19656 derang0 36143 poimirlem28 38836 |
| Copyright terms: Public domain | W3C validator |