Theorem fdmeu 6972

Description: There is exactly one codomain element for each element of the domain of a function. (Contributed by AV, 20-Apr-2025.)

Assertion

Ref	Expression
fdmeu	⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ 𝐴) → ∃!𝑦 ∈ 𝐵 (𝐹‘𝑋) = 𝑦)

Distinct variable groups:   𝑦,𝐴   𝑦,𝐵   𝑦,𝐹   𝑦,𝑋

Proof of Theorem fdmeu

Step	Hyp	Ref	Expression
1		feu 6788	. 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ 𝐴) → ∃!𝑦 ∈ 𝐵 ⟨𝑋, 𝑦⟩ ∈ 𝐹)
2		ffn 6739	. . . . . 6 ⊢ (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴)
3	2	anim1i 627	. . . . 5 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ 𝐴) → (𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴))
4	3	adantr 486	. . . 4 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → (𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴))
5		fnopfvb 6967	. . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝑋 ∈ 𝐴) → ((𝐹‘𝑋) = 𝑦 ↔ ⟨𝑋, 𝑦⟩ ∈ 𝐹))
6	4, 5	syl 18	. . 3 ⊢ (((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ 𝐴) ∧ 𝑦 ∈ 𝐵) → ((𝐹‘𝑋) = 𝑦 ↔ ⟨𝑋, 𝑦⟩ ∈ 𝐹))
7	6	reubidva 3383	. 2 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ 𝐴) → (∃!𝑦 ∈ 𝐵 (𝐹‘𝑋) = 𝑦 ↔ ∃!𝑦 ∈ 𝐵 ⟨𝑋, 𝑦⟩ ∈ 𝐹))
8	1, 7	mpbird 260	1 ⊢ ((𝐹:𝐴⟶𝐵 ∧ 𝑋 ∈ 𝐴) → ∃!𝑦 ∈ 𝐵 (𝐹‘𝑋) = 𝑦)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃!wreu 3367  ⟨cop 4840   Fn wfn 6561  ⟶wf 6562  ‘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-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-reu 3370  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-fv 6574

This theorem is used by:  uspgriedgedg  29814