Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  eufsnlem Structured version   Visualization version   GIF version

Theorem eufsnlem 50283
Description: There is exactly one function into a singleton. For a simpler hypothesis, see eufsn 50284 assuming ax-rep 5238, or eufsn2 50285 assuming ax-pow 5334 and ax-un 7783. (Contributed by Zhi Wang, 19-Sep-2024.)
Hypotheses
Ref Expression
eufsn.1 (𝜑 → 𝐵 ∈ 𝑊)
eufsnlem.2 (𝜑 → (𝐴 × {𝐵}) ∈ 𝑉)
Assertion
Ref Expression
eufsnlem (𝜑 → ∃!𝑓 𝑓:𝐴⟶{𝐵})
Distinct variable groups:   𝐴,𝑓   𝐵,𝑓   𝜑,𝑓
Allowed substitution hints:   𝑉(𝑓)   𝑊(𝑓)

Proof of Theorem eufsnlem
Dummy variable 𝑔 is distinct from all other variables.
StepHypRef Expression
1 eufsnlem.2 . . 3 (𝜑 → (𝐴 × {𝐵}) ∈ 𝑉)
2 eufsn.1 . . . . 5 (𝜑 → 𝐵 ∈ 𝑊)
3 fconst2g 7240 . . . . 5 (𝐵 ∈ 𝑊 → (𝑓:𝐴⟶{𝐵} ↔ 𝑓 = (𝐴 × {𝐵})))
42, 3syl 18 . . . 4 (𝜑 → (𝑓:𝐴⟶{𝐵} ↔ 𝑓 = (𝐴 × {𝐵})))
54alrimiv 1962 . . 3 (𝜑 → ∀𝑓(𝑓:𝐴⟶{𝐵} ↔ 𝑓 = (𝐴 × {𝐵})))
6 eqeq2 2775 . . . . 5 (𝑔 = (𝐴 × {𝐵}) → (𝑓 = 𝑔 ↔ 𝑓 = (𝐴 × {𝐵})))
76bibi2d 345 . . . 4 (𝑔 = (𝐴 × {𝐵}) → ((𝑓:𝐴⟶{𝐵} ↔ 𝑓 = 𝑔) ↔ (𝑓:𝐴⟶{𝐵} ↔ 𝑓 = (𝐴 × {𝐵}))))
87albidv 1955 . . 3 (𝑔 = (𝐴 × {𝐵}) → (∀𝑓(𝑓:𝐴⟶{𝐵} ↔ 𝑓 = 𝑔) ↔ ∀𝑓(𝑓:𝐴⟶{𝐵} ↔ 𝑓 = (𝐴 × {𝐵}))))
91, 5, 8spcedv 3556 . 2 (𝜑 → ∃𝑔∀𝑓(𝑓:𝐴⟶{𝐵} ↔ 𝑓 = 𝑔))
10 eu6im 2603 . 2 (∃𝑔∀𝑓(𝑓:𝐴⟶{𝐵} ↔ 𝑓 = 𝑔) → ∃!𝑓 𝑓:𝐴⟶{𝐵})
119, 10syl 18 1 (𝜑 → ∃!𝑓 𝑓:𝐴⟶{𝐵})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1568   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∃!weu 2596  {csn 4588   × cxp 5656  ⟶wf 6562
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-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  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-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574
This theorem is used by:  eufsn  50284  eufsn2  50285
  Copyright terms: Public domain W3C validator