Theorem fsetsnf1o 47066

Description: The mapping of an element of a class to a singleton function is a bijection. (Contributed by AV, 13-Sep-2024.)

Hypotheses

Ref	Expression
fsetsnf.a	⊢ 𝐴 = {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}}
fsetsnf.f	⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ {⟨𝑆, 𝑥⟩})

Assertion

Ref	Expression
fsetsnf1o	⊢ (𝑆 ∈ 𝑉 → 𝐹:𝐵–1-1-onto→𝐴)

Distinct variable groups:   𝑥,𝐴   𝐵,𝑏,𝑥,𝑦   𝑆,𝑏,𝑥,𝑦   𝑉,𝑏,𝑥

Allowed substitution hints:   𝐴(𝑦,𝑏)   𝐹(𝑥,𝑦,𝑏)   𝑉(𝑦)

Proof of Theorem fsetsnf1o

Step	Hyp	Ref	Expression
1		fsetsnf.a	. . 3 ⊢ 𝐴 = {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}}
2		fsetsnf.f	. . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ {⟨𝑆, 𝑥⟩})
3	1, 2	fsetsnf1 47064	. 2 ⊢ (𝑆 ∈ 𝑉 → 𝐹:𝐵–1-1→𝐴)
4	1, 2	fsetsnfo 47065	. 2 ⊢ (𝑆 ∈ 𝑉 → 𝐹:𝐵–onto→𝐴)
5		df-f1o 6568	. 2 ⊢ (𝐹:𝐵–1-1-onto→𝐴 ↔ (𝐹:𝐵–1-1→𝐴 ∧ 𝐹:𝐵–onto→𝐴))
6	3, 4, 5	sylanbrc 583	1 ⊢ (𝑆 ∈ 𝑉 → 𝐹:𝐵–1-1-onto→𝐴)

Syntax hints:   → wi 4   = wceq 1540   ∈ wcel 2108  {cab 2714  ∃wrex 3070  {csn 4626  ⟨cop 4632   ↦ cmpt 5225  –1-1→wf1 6558  –onto→wfo 6559  –1-1-onto→wf1o 6560

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-sep 5296  ax-nul 5306  ax-pr 5432

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569

This theorem is referenced by:  fsetsnprcnex  47067