MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  f1o00 Structured version   Visualization version   GIF version

Theorem f1o00 6806
Description: One-to-one onto mapping of the empty set. (Contributed by NM, 15-Apr-1998.)
Assertion
Ref Expression
f1o00 (𝐹:∅–1-1-onto𝐴 ↔ (𝐹 = ∅ ∧ 𝐴 = ∅))

Proof of Theorem f1o00
StepHypRef Expression
1 dff1o4 6779 . 2 (𝐹:∅–1-1-onto𝐴 ↔ (𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴))
2 fn0 6620 . . . . 5 (𝐹 Fn ∅ ↔ 𝐹 = ∅)
32birani 505 . . . 4 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → 𝐹 = ∅)
4 cnveq 5818 . . . . . . . . . 10 (𝐹 = ∅ → 𝐹 = ∅)
5 cnv0 5828 . . . . . . . . . 10 ∅ = ∅
64, 5eqtrdi 2792 . . . . . . . . 9 (𝐹 = ∅ → 𝐹 = ∅)
72, 6sylbi 219 . . . . . . . 8 (𝐹 Fn ∅ → 𝐹 = ∅)
87fneq1d 6582 . . . . . . 7 (𝐹 Fn ∅ → (𝐹 Fn 𝐴 ↔ ∅ Fn 𝐴))
98biimpa 478 . . . . . 6 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → ∅ Fn 𝐴)
109fndmd 6594 . . . . 5 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → dom ∅ = 𝐴)
11 dm0 5869 . . . . 5 dom ∅ = ∅
1210, 11eqtr3di 2791 . . . 4 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → 𝐴 = ∅)
133, 12jca 517 . . 3 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → (𝐹 = ∅ ∧ 𝐴 = ∅))
142biranri 507 . . . 4 ((𝐹 = ∅ ∧ 𝐴 = ∅) → 𝐹 Fn ∅)
15 eqid 2741 . . . . . 6 ∅ = ∅
16 fn0 6620 . . . . . 6 (∅ Fn ∅ ↔ ∅ = ∅)
1715, 16mpbir 233 . . . . 5 ∅ Fn ∅
186fneq1d 6582 . . . . . 6 (𝐹 = ∅ → (𝐹 Fn 𝐴 ↔ ∅ Fn 𝐴))
19 fneq2 6581 . . . . . 6 (𝐴 = ∅ → (∅ Fn 𝐴 ↔ ∅ Fn ∅))
2018, 19sylan9bb 515 . . . . 5 ((𝐹 = ∅ ∧ 𝐴 = ∅) → (𝐹 Fn 𝐴 ↔ ∅ Fn ∅))
2117, 20mpbiri 260 . . . 4 ((𝐹 = ∅ ∧ 𝐴 = ∅) → 𝐹 Fn 𝐴)
2214, 21jca 517 . . 3 ((𝐹 = ∅ ∧ 𝐴 = ∅) → (𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴))
2313, 22impbii 211 . 2 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) ↔ (𝐹 = ∅ ∧ 𝐴 = ∅))
241, 23bitri 277 1 (𝐹:∅–1-1-onto𝐴 ↔ (𝐹 = ∅ ∧ 𝐴 = ∅))
Colors of variables: wff setvar class
Syntax hints:  wb 208  wa 397   = wceq 1548  c0 4264  ccnv 5620  dom cdm 5621   Fn wfn 6484  1-1-ontowf1o 6488
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1975  ax-7 2016  ax-8 2123  ax-9 2131  ax-ext 2713  ax-sep 5221  ax-nul 5231  ax-pr 5365
This theorem depends on definitions:  df-bi 209  df-an 398  df-or 855  df-3an 1095  df-tru 1551  df-fal 1561  df-ex 1788  df-sb 2075  df-mo 2545  df-clab 2720  df-cleq 2733  df-clel 2816  df-ral 3056  df-rex 3066  df-rab 3394  df-v 3435  df-dif 3888  df-un 3890  df-in 3892  df-ss 3902  df-nul 4265  df-if 4458  df-sn 4559  df-pr 4561  df-op 4565  df-br 5076  df-opab 5138  df-id 5516  df-xp 5627  df-rel 5628  df-cnv 5629  df-co 5630  df-dm 5631  df-rn 5632  df-fun 6491  df-fn 6492  df-f 6493  df-f1 6494  df-fo 6495  df-f1o 6496
This theorem is referenced by:  fo00  6807  f1o0  6808  en0  8959  en0ALT  8960  en0r  8961  infn0  9206  symgbas0  19359  derang0  35412  poimirlem28  38030
  Copyright terms: Public domain W3C validator