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

Theorem f1cdmsn 7321
Description: If a one-to-one function with a nonempty domain has a singleton as its codomain, its domain must also be a singleton. (Contributed by BTernaryTau, 1-Dec-2024.)
Assertion
Ref Expression
f1cdmsn ((𝐹:𝐴⟶1-1{𝐵} ∧ 𝐴 ≠ ∅) → ∃𝑥 𝐴 = {𝑥})
Distinct variable group:   𝑥,𝐴
Allowed substitution hints:   𝐵(𝑥)   𝐹(𝑥)

Proof of Theorem f1cdmsn
Dummy variables 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 f1f 6808 . . . . . . 7 (𝐹:𝐴⟶1-1{𝐵} → 𝐹:𝐴⟶{𝐵})
2 fvconst 7199 . . . . . . . . 9 ((𝐹:𝐴⟶{𝐵} ∧ 𝑦 ∈ 𝐴) → (𝐹‘𝑦) = 𝐵)
323adant3 1150 . . . . . . . 8 ((𝐹:𝐴⟶{𝐵} ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝐹‘𝑦) = 𝐵)
4 fvconst 7199 . . . . . . . . 9 ((𝐹:𝐴⟶{𝐵} ∧ 𝑧 ∈ 𝐴) → (𝐹‘𝑧) = 𝐵)
543adant2 1149 . . . . . . . 8 ((𝐹:𝐴⟶{𝐵} ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝐹‘𝑧) = 𝐵)
63, 5eqtr4d 2801 . . . . . . 7 ((𝐹:𝐴⟶{𝐵} ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝐹‘𝑦) = (𝐹‘𝑧))
71, 6syl3an1 1181 . . . . . 6 ((𝐹:𝐴⟶1-1{𝐵} ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → (𝐹‘𝑦) = (𝐹‘𝑧))
8 f1veqaeq 7291 . . . . . . 7 ((𝐹:𝐴⟶1-1{𝐵} ∧ (𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴)) → ((𝐹‘𝑦) = (𝐹‘𝑧) → 𝑦 = 𝑧))
983impb 1132 . . . . . 6 ((𝐹:𝐴⟶1-1{𝐵} ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → ((𝐹‘𝑦) = (𝐹‘𝑧) → 𝑦 = 𝑧))
107, 9mpd 16 . . . . 5 ((𝐹:𝐴⟶1-1{𝐵} ∧ 𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) → 𝑦 = 𝑧)
11103expia 1139 . . . 4 ((𝐹:𝐴⟶1-1{𝐵} ∧ 𝑦 ∈ 𝐴) → (𝑧 ∈ 𝐴 → 𝑦 = 𝑧))
1211ralrimiv 3157 . . 3 ((𝐹:𝐴⟶1-1{𝐵} ∧ 𝑦 ∈ 𝐴) → ∀𝑧 ∈ 𝐴 𝑦 = 𝑧)
1312reximdva0 4306 . 2 ((𝐹:𝐴⟶1-1{𝐵} ∧ 𝐴 ≠ ∅) → ∃𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 𝑦 = 𝑧)
14 issn 4792 . 2 (∃𝑦 ∈ 𝐴 ∀𝑧 ∈ 𝐴 𝑦 = 𝑧 → ∃𝑥 𝐴 = {𝑥})
1513, 14syl 18 1 ((𝐹:𝐴⟶1-1{𝐵} ∧ 𝐴 ≠ ∅) → ∃𝑥 𝐴 = {𝑥})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∃wrex 3090  ∅c0 4281  {csn 4588  ⟶wf 6562  ⟶1-1wf1 6563  ‘cfv 6566
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pr 5398
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-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fv 6574
This theorem is used by:  snnen2o  9274  sdom1  9279  1sdom2dom  9283
  Copyright terms: Public domain W3C validator