| 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-1-onto→𝐴 ↔ (𝐹 = ∅ ∧ 𝐴 = ∅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dff1o4 6830 | . 2 ⊢ (𝐹:∅–1-1-onto→𝐴 ↔ (𝐹 Fn ∅ ∧ ◡𝐹 Fn 𝐴)) | |
| 2 | fn0 6667 | . . . . 5 ⊢ (𝐹 Fn ∅ ↔ 𝐹 = ∅) | |
| 3 | 2 | birani 508 | . . . 4 ⊢ ((𝐹 Fn ∅ ∧ ◡𝐹 Fn 𝐴) → 𝐹 = ∅) |
| 4 | cnveq 5860 | . . . . . . . . . 10 ⊢ (𝐹 = ∅ → ◡𝐹 = ◡∅) | |
| 5 | cnv0 5870 | . . . . . . . . . 10 ⊢ ◡∅ = ∅ | |
| 6 | 4, 5 | eqtrdi 2820 | . . . . . . . . 9 ⊢ (𝐹 = ∅ → ◡𝐹 = ∅) |
| 7 | 2, 6 | sylbi 220 | . . . . . . . 8 ⊢ (𝐹 Fn ∅ → ◡𝐹 = ∅) |
| 8 | 7 | fneq1d 6629 | . . . . . . 7 ⊢ (𝐹 Fn ∅ → (◡𝐹 Fn 𝐴 ↔ ∅ Fn 𝐴)) |
| 9 | 8 | biimpa 481 | . . . . . 6 ⊢ ((𝐹 Fn ∅ ∧ ◡𝐹 Fn 𝐴) → ∅ Fn 𝐴) |
| 10 | 9 | fndmd 6641 | . . . . 5 ⊢ ((𝐹 Fn ∅ ∧ ◡𝐹 Fn 𝐴) → dom ∅ = 𝐴) |
| 11 | dm0 5911 | . . . . 5 ⊢ dom ∅ = ∅ | |
| 12 | 10, 11 | eqtr3di 2819 | . . . 4 ⊢ ((𝐹 Fn ∅ ∧ ◡𝐹 Fn 𝐴) → 𝐴 = ∅) |
| 13 | 3, 12 | jca 520 | . . 3 ⊢ ((𝐹 Fn ∅ ∧ ◡𝐹 Fn 𝐴) → (𝐹 = ∅ ∧ 𝐴 = ∅)) |
| 14 | 2 | biranri 510 | . . . 4 ⊢ ((𝐹 = ∅ ∧ 𝐴 = ∅) → 𝐹 Fn ∅) |
| 15 | eqid 2769 | . . . . . 6 ⊢ ∅ = ∅ | |
| 16 | fn0 6667 | . . . . . 6 ⊢ (∅ Fn ∅ ↔ ∅ = ∅) | |
| 17 | 15, 16 | mpbir 234 | . . . . 5 ⊢ ∅ Fn ∅ |
| 18 | 6 | fneq1d 6629 | . . . . . 6 ⊢ (𝐹 = ∅ → (◡𝐹 Fn 𝐴 ↔ ∅ Fn 𝐴)) |
| 19 | fneq2 6628 | . . . . . 6 ⊢ (𝐴 = ∅ → (∅ Fn 𝐴 ↔ ∅ Fn ∅)) | |
| 20 | 18, 19 | sylan9bb 518 | . . . . 5 ⊢ ((𝐹 = ∅ ∧ 𝐴 = ∅) → (◡𝐹 Fn 𝐴 ↔ ∅ Fn ∅)) |
| 21 | 17, 20 | mpbiri 261 | . . . 4 ⊢ ((𝐹 = ∅ ∧ 𝐴 = ∅) → ◡𝐹 Fn 𝐴) |
| 22 | 14, 21 | jca 520 | . . 3 ⊢ ((𝐹 = ∅ ∧ 𝐴 = ∅) → (𝐹 Fn ∅ ∧ ◡𝐹 Fn 𝐴)) |
| 23 | 13, 22 | impbii 212 | . 2 ⊢ ((𝐹 Fn ∅ ∧ ◡𝐹 Fn 𝐴) ↔ (𝐹 = ∅ ∧ 𝐴 = ∅)) |
| 24 | 1, 23 | bitri 278 | 1 ⊢ (𝐹:∅–1-1-onto→𝐴 ↔ (𝐹 = ∅ ∧ 𝐴 = ∅)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 209 ∧ wa 400 = wceq 1567 ∅c0 4294 ◡ccnv 5661 dom cdm 5662 Fn wfn 6532 –1-1-onto→wf1o 6536 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-sb 2098 df-mo 2573 df-clab 2748 df-cleq 2761 df-clel 2844 df-ral 3086 df-rex 3096 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-br 5114 df-opab 5178 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 |
| This theorem is referenced by: fo00 6858 f1o0 6859 en0 9015 en0ALT 9016 en0r 9017 infn0 9262 symgbas0 19459 derang0 35594 poimirlem28 38221 |
| Copyright terms: Public domain | W3C validator |