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

Theorem f1o00 6856
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 6829 . 2 (𝐹:∅–1-1-onto𝐴 ↔ (𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴))
2 fn0 6666 . . . . 5 (𝐹 Fn ∅ ↔ 𝐹 = ∅)
32birani 508 . . . 4 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → 𝐹 = ∅)
4 cnveq 5859 . . . . . . . . . 10 (𝐹 = ∅ → 𝐹 = ∅)
5 cnv0 5869 . . . . . . . . . 10 ∅ = ∅
64, 5eqtrdi 2814 . . . . . . . . 9 (𝐹 = ∅ → 𝐹 = ∅)
72, 6sylbi 220 . . . . . . . 8 (𝐹 Fn ∅ → 𝐹 = ∅)
87fneq1d 6628 . . . . . . 7 (𝐹 Fn ∅ → (𝐹 Fn 𝐴 ↔ ∅ Fn 𝐴))
98biimpa 481 . . . . . 6 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → ∅ Fn 𝐴)
109fndmd 6640 . . . . 5 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → dom ∅ = 𝐴)
11 dm0 5910 . . . . 5 dom ∅ = ∅
1210, 11eqtr3di 2813 . . . 4 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → 𝐴 = ∅)
133, 12jca 520 . . 3 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → (𝐹 = ∅ ∧ 𝐴 = ∅))
142biranri 510 . . . 4 ((𝐹 = ∅ ∧ 𝐴 = ∅) → 𝐹 Fn ∅)
15 eqid 2763 . . . . . 6 ∅ = ∅
16 fn0 6666 . . . . . 6 (∅ Fn ∅ ↔ ∅ = ∅)
1715, 16mpbir 234 . . . . 5 ∅ Fn ∅
186fneq1d 6628 . . . . . 6 (𝐹 = ∅ → (𝐹 Fn 𝐴 ↔ ∅ Fn 𝐴))
19 fneq2 6627 . . . . . 6 (𝐴 = ∅ → (∅ Fn 𝐴 ↔ ∅ Fn ∅))
2018, 19sylan9bb 518 . . . . 5 ((𝐹 = ∅ ∧ 𝐴 = ∅) → (𝐹 Fn 𝐴 ↔ ∅ Fn ∅))
2117, 20mpbiri 261 . . . 4 ((𝐹 = ∅ ∧ 𝐴 = ∅) → 𝐹 Fn 𝐴)
2214, 21jca 520 . . 3 ((𝐹 = ∅ ∧ 𝐴 = ∅) → (𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴))
2313, 22impbii 212 . 2 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) ↔ (𝐹 = ∅ ∧ 𝐴 = ∅))
241, 23bitri 278 1 (𝐹:∅–1-1-onto𝐴 ↔ (𝐹 = ∅ ∧ 𝐴 = ∅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wb 209  wa 400   = wceq 1570  c0 4286  ccnv 5660  dom cdm 5661   Fn wfn 6531  1-1-ontowf1o 6535
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pr 5404
This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-sb 2097  df-mo 2567  df-clab 2742  df-cleq 2755  df-clel 2838  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-sn 4590  df-pr 4592  df-op 4596  df-br 5110  df-opab 5174  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543
This theorem is used by:  fo00  6857  f1o0  6858  en0  9011  en0ALT  9012  en0r  9013  infn0  9258  symgbas0  19463  derang0  35669  poimirlem28  38327
  Copyright terms: Public domain W3C validator