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

Theorem f1o00 6838
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 6811 . 2 (𝐹:∅–1-1-onto𝐴 ↔ (𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴))
2 fn0 6652 . . . . . 6 (𝐹 Fn ∅ ↔ 𝐹 = ∅)
32biimpi 216 . . . . 5 (𝐹 Fn ∅ → 𝐹 = ∅)
43adantr 480 . . . 4 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → 𝐹 = ∅)
5 cnveq 5840 . . . . . . . . . 10 (𝐹 = ∅ → 𝐹 = ∅)
6 cnv0 6116 . . . . . . . . . 10 ∅ = ∅
75, 6eqtrdi 2781 . . . . . . . . 9 (𝐹 = ∅ → 𝐹 = ∅)
82, 7sylbi 217 . . . . . . . 8 (𝐹 Fn ∅ → 𝐹 = ∅)
98fneq1d 6614 . . . . . . 7 (𝐹 Fn ∅ → (𝐹 Fn 𝐴 ↔ ∅ Fn 𝐴))
109biimpa 476 . . . . . 6 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → ∅ Fn 𝐴)
1110fndmd 6626 . . . . 5 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → dom ∅ = 𝐴)
12 dm0 5887 . . . . 5 dom ∅ = ∅
1311, 12eqtr3di 2780 . . . 4 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → 𝐴 = ∅)
144, 13jca 511 . . 3 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → (𝐹 = ∅ ∧ 𝐴 = ∅))
152biimpri 228 . . . . 5 (𝐹 = ∅ → 𝐹 Fn ∅)
1615adantr 480 . . . 4 ((𝐹 = ∅ ∧ 𝐴 = ∅) → 𝐹 Fn ∅)
17 eqid 2730 . . . . . 6 ∅ = ∅
18 fn0 6652 . . . . . 6 (∅ Fn ∅ ↔ ∅ = ∅)
1917, 18mpbir 231 . . . . 5 ∅ Fn ∅
207fneq1d 6614 . . . . . 6 (𝐹 = ∅ → (𝐹 Fn 𝐴 ↔ ∅ Fn 𝐴))
21 fneq2 6613 . . . . . 6 (𝐴 = ∅ → (∅ Fn 𝐴 ↔ ∅ Fn ∅))
2220, 21sylan9bb 509 . . . . 5 ((𝐹 = ∅ ∧ 𝐴 = ∅) → (𝐹 Fn 𝐴 ↔ ∅ Fn ∅))
2319, 22mpbiri 258 . . . 4 ((𝐹 = ∅ ∧ 𝐴 = ∅) → 𝐹 Fn 𝐴)
2416, 23jca 511 . . 3 ((𝐹 = ∅ ∧ 𝐴 = ∅) → (𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴))
2514, 24impbii 209 . 2 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) ↔ (𝐹 = ∅ ∧ 𝐴 = ∅))
261, 25bitri 275 1 (𝐹:∅–1-1-onto𝐴 ↔ (𝐹 = ∅ ∧ 𝐴 = ∅))
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1540  c0 4299  ccnv 5640  dom cdm 5641   Fn wfn 6509  1-1-ontowf1o 6513
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-12 2178  ax-ext 2702  ax-sep 5254  ax-nul 5264  ax-pr 5390
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-mo 2534  df-clab 2709  df-cleq 2722  df-clel 2804  df-ral 3046  df-rex 3055  df-rab 3409  df-v 3452  df-dif 3920  df-un 3922  df-ss 3934  df-nul 4300  df-if 4492  df-sn 4593  df-pr 4595  df-op 4599  df-br 5111  df-opab 5173  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521
This theorem is referenced by:  fo00  6839  f1o0  6840  en0  8992  en0ALT  8993  en0r  8994  infn0  9258  symgbas0  19326  derang0  35163  poimirlem28  37649
  Copyright terms: Public domain W3C validator