ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  f1o00 GIF version

Theorem f1o00 5214
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 5187 . 2 (𝐹:∅–1-1-onto𝐴 ↔ (𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴))
2 fn0 5070 . . . . . 6 (𝐹 Fn ∅ ↔ 𝐹 = ∅)
32biimpi 118 . . . . 5 (𝐹 Fn ∅ → 𝐹 = ∅)
43adantr 270 . . . 4 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → 𝐹 = ∅)
5 dm0 4598 . . . . 5 dom ∅ = ∅
6 cnveq 4558 . . . . . . . . . 10 (𝐹 = ∅ → 𝐹 = ∅)
7 cnv0 4778 . . . . . . . . . 10 ∅ = ∅
86, 7syl6eq 2131 . . . . . . . . 9 (𝐹 = ∅ → 𝐹 = ∅)
92, 8sylbi 119 . . . . . . . 8 (𝐹 Fn ∅ → 𝐹 = ∅)
109fneq1d 5041 . . . . . . 7 (𝐹 Fn ∅ → (𝐹 Fn 𝐴 ↔ ∅ Fn 𝐴))
1110biimpa 290 . . . . . 6 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → ∅ Fn 𝐴)
12 fndm 5050 . . . . . 6 (∅ Fn 𝐴 → dom ∅ = 𝐴)
1311, 12syl 14 . . . . 5 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → dom ∅ = 𝐴)
145, 13syl5reqr 2130 . . . 4 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → 𝐴 = ∅)
154, 14jca 300 . . 3 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) → (𝐹 = ∅ ∧ 𝐴 = ∅))
162biimpri 131 . . . . 5 (𝐹 = ∅ → 𝐹 Fn ∅)
1716adantr 270 . . . 4 ((𝐹 = ∅ ∧ 𝐴 = ∅) → 𝐹 Fn ∅)
18 eqid 2083 . . . . . 6 ∅ = ∅
19 fn0 5070 . . . . . 6 (∅ Fn ∅ ↔ ∅ = ∅)
2018, 19mpbir 144 . . . . 5 ∅ Fn ∅
218fneq1d 5041 . . . . . 6 (𝐹 = ∅ → (𝐹 Fn 𝐴 ↔ ∅ Fn 𝐴))
22 fneq2 5040 . . . . . 6 (𝐴 = ∅ → (∅ Fn 𝐴 ↔ ∅ Fn ∅))
2321, 22sylan9bb 450 . . . . 5 ((𝐹 = ∅ ∧ 𝐴 = ∅) → (𝐹 Fn 𝐴 ↔ ∅ Fn ∅))
2420, 23mpbiri 166 . . . 4 ((𝐹 = ∅ ∧ 𝐴 = ∅) → 𝐹 Fn 𝐴)
2517, 24jca 300 . . 3 ((𝐹 = ∅ ∧ 𝐴 = ∅) → (𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴))
2615, 25impbii 124 . 2 ((𝐹 Fn ∅ ∧ 𝐹 Fn 𝐴) ↔ (𝐹 = ∅ ∧ 𝐴 = ∅))
271, 26bitri 182 1 (𝐹:∅–1-1-onto𝐴 ↔ (𝐹 = ∅ ∧ 𝐴 = ∅))
Colors of variables: wff set class
Syntax hints:  wa 102  wb 103   = wceq 1285  c0 3268  ccnv 4391  dom cdm 4392   Fn wfn 4948  1-1-ontowf1o 4952
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-in1 577  ax-in2 578  ax-io 663  ax-5 1377  ax-7 1378  ax-gen 1379  ax-ie1 1423  ax-ie2 1424  ax-8 1436  ax-10 1437  ax-11 1438  ax-i12 1439  ax-bndl 1440  ax-4 1441  ax-14 1446  ax-17 1460  ax-i9 1464  ax-ial 1468  ax-i5r 1469  ax-ext 2065  ax-sep 3917  ax-nul 3925  ax-pow 3969  ax-pr 3993
This theorem depends on definitions:  df-bi 115  df-3an 922  df-tru 1288  df-fal 1291  df-nf 1391  df-sb 1688  df-eu 1946  df-mo 1947  df-clab 2070  df-cleq 2076  df-clel 2079  df-nfc 2212  df-ral 2358  df-rex 2359  df-v 2613  df-dif 2985  df-un 2987  df-in 2989  df-ss 2996  df-nul 3269  df-pw 3403  df-sn 3423  df-pr 3424  df-op 3426  df-br 3807  df-opab 3861  df-id 4077  df-xp 4398  df-rel 4399  df-cnv 4400  df-co 4401  df-dm 4402  df-rn 4403  df-fun 4955  df-fn 4956  df-f 4957  df-f1 4958  df-fo 4959  df-f1o 4960
This theorem is referenced by:  fo00  5215  f1o0  5216  en0  6365
  Copyright terms: Public domain W3C validator