Theorem fsetsnfo 48067

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

Hypotheses

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

Assertion

Ref	Expression
fsetsnfo	⊢ (𝑆 ∈ 𝑉 → 𝐹:𝐵–onto→𝐴)

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

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

Proof of Theorem fsetsnfo

Dummy variables 𝑚 𝑛 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fsetsnf.a	. . 3 ⊢ 𝐴 = {𝑦 ∣ ∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩}}
2		fsetsnf.f	. . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ {⟨𝑆, 𝑥⟩})
3	1, 2	fsetsnf 48065	. 2 ⊢ (𝑆 ∈ 𝑉 → 𝐹:𝐵⟶𝐴)
4		vex 3455	. . . . . 6 ⊢ 𝑚 ∈ V
5		eqeq1 2765	. . . . . . 7 ⊢ (𝑦 = 𝑚 → (𝑦 = {⟨𝑆, 𝑏⟩} ↔ 𝑚 = {⟨𝑆, 𝑏⟩}))
6	5	rexbidv 3187	. . . . . 6 ⊢ (𝑦 = 𝑚 → (∃𝑏 ∈ 𝐵 𝑦 = {⟨𝑆, 𝑏⟩} ↔ ∃𝑏 ∈ 𝐵 𝑚 = {⟨𝑆, 𝑏⟩}))
7	4, 6, 1	elab2 3636	. . . . 5 ⊢ (𝑚 ∈ 𝐴 ↔ ∃𝑏 ∈ 𝐵 𝑚 = {⟨𝑆, 𝑏⟩})
8		opeq2 4834	. . . . . . . . 9 ⊢ (𝑏 = 𝑛 → ⟨𝑆, 𝑏⟩ = ⟨𝑆, 𝑛⟩)
9	8	sneqd 4596	. . . . . . . 8 ⊢ (𝑏 = 𝑛 → {⟨𝑆, 𝑏⟩} = {⟨𝑆, 𝑛⟩})
10	9	eqeq2d 2772	. . . . . . 7 ⊢ (𝑏 = 𝑛 → (𝑚 = {⟨𝑆, 𝑏⟩} ↔ 𝑚 = {⟨𝑆, 𝑛⟩}))
11	10	cbvrexvw 3242	. . . . . 6 ⊢ (∃𝑏 ∈ 𝐵 𝑚 = {⟨𝑆, 𝑏⟩} ↔ ∃𝑛 ∈ 𝐵 𝑚 = {⟨𝑆, 𝑛⟩})
12		simpr 490	. . . . . . . . 9 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑛 ∈ 𝐵) ∧ 𝑚 = {⟨𝑆, 𝑛⟩}) → 𝑚 = {⟨𝑆, 𝑛⟩})
13	2	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑛 ∈ 𝐵) → 𝐹 = (𝑥 ∈ 𝐵 ↦ {⟨𝑆, 𝑥⟩}))
14		opeq2 4834	. . . . . . . . . . . . . 14 ⊢ (𝑥 = 𝑛 → ⟨𝑆, 𝑥⟩ = ⟨𝑆, 𝑛⟩)
15	14	sneqd 4596	. . . . . . . . . . . . 13 ⊢ (𝑥 = 𝑛 → {⟨𝑆, 𝑥⟩} = {⟨𝑆, 𝑛⟩})
16	15	adantl 487	. . . . . . . . . . . 12 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑛 ∈ 𝐵) ∧ 𝑥 = 𝑛) → {⟨𝑆, 𝑥⟩} = {⟨𝑆, 𝑛⟩})
17		simpr 490	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑛 ∈ 𝐵) → 𝑛 ∈ 𝐵)
18		snex 5397	. . . . . . . . . . . . 13 ⊢ {⟨𝑆, 𝑛⟩} ∈ V
19	18	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑛 ∈ 𝐵) → {⟨𝑆, 𝑛⟩} ∈ V)
20	13, 16, 17, 19	fvmptd 6993	. . . . . . . . . . 11 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑛 ∈ 𝐵) → (𝐹‘𝑛) = {⟨𝑆, 𝑛⟩})
21	20	eqcomd 2767	. . . . . . . . . 10 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑛 ∈ 𝐵) → {⟨𝑆, 𝑛⟩} = (𝐹‘𝑛))
22	21	adantr 486	. . . . . . . . 9 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑛 ∈ 𝐵) ∧ 𝑚 = {⟨𝑆, 𝑛⟩}) → {⟨𝑆, 𝑛⟩} = (𝐹‘𝑛))
23	12, 22	eqtrd 2796	. . . . . . . 8 ⊢ (((𝑆 ∈ 𝑉 ∧ 𝑛 ∈ 𝐵) ∧ 𝑚 = {⟨𝑆, 𝑛⟩}) → 𝑚 = (𝐹‘𝑛))
24	23	ex 418	. . . . . . 7 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑛 ∈ 𝐵) → (𝑚 = {⟨𝑆, 𝑛⟩} → 𝑚 = (𝐹‘𝑛)))
25	24	reximdva 3176	. . . . . 6 ⊢ (𝑆 ∈ 𝑉 → (∃𝑛 ∈ 𝐵 𝑚 = {⟨𝑆, 𝑛⟩} → ∃𝑛 ∈ 𝐵 𝑚 = (𝐹‘𝑛)))
26	11, 25	biimtrid 245	. . . . 5 ⊢ (𝑆 ∈ 𝑉 → (∃𝑏 ∈ 𝐵 𝑚 = {⟨𝑆, 𝑏⟩} → ∃𝑛 ∈ 𝐵 𝑚 = (𝐹‘𝑛)))
27	7, 26	biimtrid 245	. . . 4 ⊢ (𝑆 ∈ 𝑉 → (𝑚 ∈ 𝐴 → ∃𝑛 ∈ 𝐵 𝑚 = (𝐹‘𝑛)))
28	27	imp 412	. . 3 ⊢ ((𝑆 ∈ 𝑉 ∧ 𝑚 ∈ 𝐴) → ∃𝑛 ∈ 𝐵 𝑚 = (𝐹‘𝑛))
29	28	ralrimiva 3155	. 2 ⊢ (𝑆 ∈ 𝑉 → ∀𝑚 ∈ 𝐴 ∃𝑛 ∈ 𝐵 𝑚 = (𝐹‘𝑛))
30		dffo3 7094	. 2 ⊢ (𝐹:𝐵–onto→𝐴 ↔ (𝐹:𝐵⟶𝐴 ∧ ∀𝑚 ∈ 𝐴 ∃𝑛 ∈ 𝐵 𝑚 = (𝐹‘𝑛)))
31	3, 29, 30	sylanbrc 595	1 ⊢ (𝑆 ∈ 𝑉 → 𝐹:𝐵–onto→𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  {cab 2739  ∀wral 3077  ∃wrex 3087  Vcvv 3451  {csn 4584  ⟨cop 4590   ↦ cmpt 5186  ⟶wf 6527  –onto→wfo 6529  ‘cfv 6531

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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391

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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  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 6487  df-fun 6533  df-fn 6534  df-f 6535  df-fo 6537  df-fv 6539

This theorem is used by:  fsetsnf1o  48068