Theorem slotresfo 49374

Description: The condition of a structure component extractor restricted to a class being a surjection. This combined with fonex 49342 can be used to prove a class being proper. (Contributed by Zhi Wang, 20-Oct-2025.)

Hypotheses

Ref	Expression
slotresfo.e	⊢ 𝐸 Fn V
slotresfo.v	⊢ (𝑘 ∈ 𝐴 → (𝐸‘𝑘) ∈ 𝑉)
slotresfo.k	⊢ (𝑏 ∈ 𝑉 → 𝐾 ∈ 𝐴)
slotresfo.b	⊢ (𝑏 ∈ 𝑉 → 𝑏 = (𝐸‘𝐾))

Assertion

Ref	Expression
slotresfo	⊢ (𝐸 ↾ 𝐴):𝐴–onto→𝑉

Distinct variable groups:   𝐴,𝑏,𝑘   𝐸,𝑏,𝑘   𝑘,𝐾   𝑉,𝑏,𝑘

Allowed substitution hint:   𝐾(𝑏)

Proof of Theorem slotresfo

Step	Hyp	Ref	Expression
1		slotresfo.e	. . . 4 ⊢ 𝐸 Fn V
2		ssv 3946	. . . 4 ⊢ 𝐴 ⊆ V
3		fnssres 6621	. . . 4 ⊢ ((𝐸 Fn V ∧ 𝐴 ⊆ V) → (𝐸 ↾ 𝐴) Fn 𝐴)
4	1, 2, 3	mp2an 693	. . 3 ⊢ (𝐸 ↾ 𝐴) Fn 𝐴
5		fvres 6859	. . . . . 6 ⊢ (𝑘 ∈ 𝐴 → ((𝐸 ↾ 𝐴)‘𝑘) = (𝐸‘𝑘))
6		slotresfo.v	. . . . . 6 ⊢ (𝑘 ∈ 𝐴 → (𝐸‘𝑘) ∈ 𝑉)
7	5, 6	eqeltrd 2836	. . . . 5 ⊢ (𝑘 ∈ 𝐴 → ((𝐸 ↾ 𝐴)‘𝑘) ∈ 𝑉)
8	7	rgen 3053	. . . 4 ⊢ ∀𝑘 ∈ 𝐴 ((𝐸 ↾ 𝐴)‘𝑘) ∈ 𝑉
9		fnfvrnss 7073	. . . 4 ⊢ (((𝐸 ↾ 𝐴) Fn 𝐴 ∧ ∀𝑘 ∈ 𝐴 ((𝐸 ↾ 𝐴)‘𝑘) ∈ 𝑉) → ran (𝐸 ↾ 𝐴) ⊆ 𝑉)
10	4, 8, 9	mp2an 693	. . 3 ⊢ ran (𝐸 ↾ 𝐴) ⊆ 𝑉
11		df-f 6502	. . 3 ⊢ ((𝐸 ↾ 𝐴):𝐴⟶𝑉 ↔ ((𝐸 ↾ 𝐴) Fn 𝐴 ∧ ran (𝐸 ↾ 𝐴) ⊆ 𝑉))
12	4, 10, 11	mpbir2an 712	. 2 ⊢ (𝐸 ↾ 𝐴):𝐴⟶𝑉
13		fveq2 6840	. . . . . 6 ⊢ (𝑘 = 𝐾 → (𝐸‘𝑘) = (𝐸‘𝐾))
14	13	eqeq2d 2747	. . . . 5 ⊢ (𝑘 = 𝐾 → (𝑏 = (𝐸‘𝑘) ↔ 𝑏 = (𝐸‘𝐾)))
15		slotresfo.k	. . . . 5 ⊢ (𝑏 ∈ 𝑉 → 𝐾 ∈ 𝐴)
16		slotresfo.b	. . . . 5 ⊢ (𝑏 ∈ 𝑉 → 𝑏 = (𝐸‘𝐾))
17	14, 15, 16	rspcedvdw 3567	. . . 4 ⊢ (𝑏 ∈ 𝑉 → ∃𝑘 ∈ 𝐴 𝑏 = (𝐸‘𝑘))
18	5	eqeq2d 2747	. . . . 5 ⊢ (𝑘 ∈ 𝐴 → (𝑏 = ((𝐸 ↾ 𝐴)‘𝑘) ↔ 𝑏 = (𝐸‘𝑘)))
19	18	rexbiia 3082	. . . 4 ⊢ (∃𝑘 ∈ 𝐴 𝑏 = ((𝐸 ↾ 𝐴)‘𝑘) ↔ ∃𝑘 ∈ 𝐴 𝑏 = (𝐸‘𝑘))
20	17, 19	sylibr 234	. . 3 ⊢ (𝑏 ∈ 𝑉 → ∃𝑘 ∈ 𝐴 𝑏 = ((𝐸 ↾ 𝐴)‘𝑘))
21	20	rgen 3053	. 2 ⊢ ∀𝑏 ∈ 𝑉 ∃𝑘 ∈ 𝐴 𝑏 = ((𝐸 ↾ 𝐴)‘𝑘)
22		dffo3 7054	. 2 ⊢ ((𝐸 ↾ 𝐴):𝐴–onto→𝑉 ↔ ((𝐸 ↾ 𝐴):𝐴⟶𝑉 ∧ ∀𝑏 ∈ 𝑉 ∃𝑘 ∈ 𝐴 𝑏 = ((𝐸 ↾ 𝐴)‘𝑘)))
23	12, 21, 22	mpbir2an 712	1 ⊢ (𝐸 ↾ 𝐴):𝐴–onto→𝑉

Syntax hints:   → wi 4   = wceq 1542   ∈ wcel 2114  ∀wral 3051  ∃wrex 3061  Vcvv 3429   ⊆ wss 3889  ran crn 5632   ↾ cres 5633   Fn wfn 6493  ⟶wf 6494  –onto→wfo 6496  ‘cfv 6498

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pr 5375

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-fo 6504  df-fv 6506

This theorem is referenced by:  basresprsfo  49454  basrestermcfo  50050