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

Theorem f1o00 6857
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 6830 . 2 (𝐹:∅–1-1-onto𝐴 ↔ (𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴))
2 fn0 6667 . . . . 5 (𝐹 Fn ∅ ↔ 𝐹 = ∅)
32birani 509 . . . 4 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → 𝐹 = ∅)
4 cnveq 5857 . . . . . . . . . 10 (𝐹 = ∅ → 𝐹 = ∅)
5 cnv0 5867 . . . . . . . . . 10 ∅ = ∅
64, 5eqtrdi 2813 . . . . . . . . 9 (𝐹 = ∅ → 𝐹 = ∅)
72, 6sylbi 220 . . . . . . . 8 (𝐹 Fn ∅ → 𝐹 = ∅)
87fneq1d 6629 . . . . . . 7 (𝐹 Fn ∅ → (𝐹 Fn 𝐴 ↔ ∅ Fn 𝐴))
98biimpa 482 . . . . . 6 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → ∅ Fn 𝐴)
109fndmd 6641 . . . . 5 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → dom ∅ = 𝐴)
11 dm0 5908 . . . . 5 dom ∅ = ∅
1210, 11eqtr3di 2812 . . . 4 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → 𝐴 = ∅)
133, 12jca 521 . . 3 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → (𝐹 = ∅ ∧ 𝐴 = ∅))
142biranri 511 . . . 4 ((𝐹 = ∅ ∧ 𝐴 = ∅) → 𝐹 Fn ∅)
15 eqid 2762 . . . . . 6 ∅ = ∅
16 fn0 6667 . . . . . 6 (∅ Fn ∅ ↔ ∅ = ∅)
1715, 16mpbir 234 . . . . 5 ∅ Fn ∅
186fneq1d 6629 . . . . . 6 (𝐹 = ∅ → (𝐹 Fn 𝐴 ↔ ∅ Fn 𝐴))
19 fneq2 6628 . . . . . 6 (𝐴 = ∅ → (∅ Fn 𝐴 ↔ ∅ Fn ∅))
2018, 19sylan9bb 519 . . . . 5 ((𝐹 = ∅ ∧ 𝐴 = ∅) → (𝐹 Fn 𝐴 ↔ ∅ Fn ∅))
2117, 20mpbiri 261 . . . 4 ((𝐹 = ∅ ∧ 𝐴 = ∅) → 𝐹 Fn 𝐴)
2214, 21jca 521 . . 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 401   = wceq 1570  c0 4282  ccnv 5658  dom cdm 5659   Fn wfn 6532  1-1-ontowf1o 6536
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-mo 2566  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544
This theorem is used by:  fo00  6858  f1o0  6859  en0  9027  en0ALT  9028  en0r  9029  infn0  9275  symgbas0  19515  derang0  35733  poimirlem28  38382
  Copyright terms: Public domain W3C validator