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 50060
Description: There is exactly one function into a singleton. For a simpler hypothesis, see eufsn 50061 assuming ax-rep 5231, or eufsn2 50062 assuming ax-pow 5327 and ax-un 7755. (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 7213 . . . . 5 (𝐵 ∈ 𝑊 → (𝑓:𝐴⟶{𝐵} ↔ 𝑓 = (𝐴 × {𝐵})))
42, 3syl 18 . . . 4 (𝜑 → (𝑓:𝐴⟶{𝐵} ↔ 𝑓 = (𝐴 × {𝐵})))
54alrimiv 1959 . . 3 (𝜑 → ∀𝑓(𝑓:𝐴⟶{𝐵} ↔ 𝑓 = (𝐴 × {𝐵})))
6 eqeq2 2772 . . . . 5 (𝑔 = (𝐴 × {𝐵}) → (𝑓 = 𝑔 ↔ 𝑓 = (𝐴 × {𝐵})))
76bibi2d 345 . . . 4 (𝑔 = (𝐴 × {𝐵}) → ((𝑓:𝐴⟶{𝐵} ↔ 𝑓 = 𝑔) ↔ (𝑓:𝐴⟶{𝐵} ↔ 𝑓 = (𝐴 × {𝐵}))))
87albidv 1952 . . 3 (𝑔 = (𝐴 × {𝐵}) → (∀𝑓(𝑓:𝐴⟶{𝐵} ↔ 𝑓 = 𝑔) ↔ ∀𝑓(𝑓:𝐴⟶{𝐵} ↔ 𝑓 = (𝐴 × {𝐵}))))
91, 5, 8spcedv 3552 . 2 (𝜑 → ∃𝑔∀𝑓(𝑓:𝐴⟶{𝐵} ↔ 𝑓 = 𝑔))
10 eu6im 2600 . 2 (∃𝑔∀𝑓(𝑓:𝐴⟶{𝐵} ↔ 𝑓 = 𝑔) → ∃!𝑓 𝑓:𝐴⟶{𝐵})
119, 10syl 18 1 (𝜑 → ∃!𝑓 𝑓:𝐴⟶{𝐵})
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209  ∀wal 1567   = wceq 1569  ∃wex 1811   ∈ wcel 2144  ∃!weu 2593  {csn 4584   × cxp 5649  ⟶wf 6539
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5391
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-fv 6551
This theorem is used by:  eufsn  50061  eufsn2  50062
  Copyright terms: Public domain W3C validator