Users' Mathboxes Mathbox for Zhi Wang < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  slotresfo Structured version   Visualization version   GIF version

Theorem slotresfo 49718
Description: The condition of a structure component extractor restricted to a class being a surjection. This combined with fonex 49686 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
StepHypRef Expression
1 slotresfo.e . . . 4 𝐸 Fn V
2 ssv 3964 . . . 4 𝐴 ⊆ V
3 fnssres 6665 . . . 4 ((𝐸 Fn V ∧ 𝐴 ⊆ V) → (𝐸𝐴) Fn 𝐴)
41, 2, 3mp2an 705 . . 3 (𝐸𝐴) Fn 𝐴
5 fvres 6907 . . . . . 6 (𝑘𝐴 → ((𝐸𝐴)‘𝑘) = (𝐸𝑘))
6 slotresfo.v . . . . . 6 (𝑘𝐴 → (𝐸𝑘) ∈ 𝑉)
75, 6eqeltrd 2866 . . . . 5 (𝑘𝐴 → ((𝐸𝐴)‘𝑘) ∈ 𝑉)
87rgen 3084 . . . 4 𝑘𝐴 ((𝐸𝐴)‘𝑘) ∈ 𝑉
9 fnfvrnss 7123 . . . 4 (((𝐸𝐴) Fn 𝐴 ∧ ∀𝑘𝐴 ((𝐸𝐴)‘𝑘) ∈ 𝑉) → ran (𝐸𝐴) ⊆ 𝑉)
104, 8, 9mp2an 705 . . 3 ran (𝐸𝐴) ⊆ 𝑉
11 df-f 6547 . . 3 ((𝐸𝐴):𝐴𝑉 ↔ ((𝐸𝐴) Fn 𝐴 ∧ ran (𝐸𝐴) ⊆ 𝑉))
124, 10, 11mpbir2an 724 . 2 (𝐸𝐴):𝐴𝑉
13 fveq2 6888 . . . . . 6 (𝑘 = 𝐾 → (𝐸𝑘) = (𝐸𝐾))
1413eqeq2d 2777 . . . . 5 (𝑘 = 𝐾 → (𝑏 = (𝐸𝑘) ↔ 𝑏 = (𝐸𝐾)))
15 slotresfo.k . . . . 5 (𝑏𝑉𝐾𝐴)
16 slotresfo.b . . . . 5 (𝑏𝑉𝑏 = (𝐸𝐾))
1714, 15, 16rspcedvdw 3587 . . . 4 (𝑏𝑉 → ∃𝑘𝐴 𝑏 = (𝐸𝑘))
185eqeq2d 2777 . . . . 5 (𝑘𝐴 → (𝑏 = ((𝐸𝐴)‘𝑘) ↔ 𝑏 = (𝐸𝑘)))
1918rexbiia 3113 . . . 4 (∃𝑘𝐴 𝑏 = ((𝐸𝐴)‘𝑘) ↔ ∃𝑘𝐴 𝑏 = (𝐸𝑘))
2017, 19sylibr 237 . . 3 (𝑏𝑉 → ∃𝑘𝐴 𝑏 = ((𝐸𝐴)‘𝑘))
2120rgen 3084 . 2 𝑏𝑉𝑘𝐴 𝑏 = ((𝐸𝐴)‘𝑘)
22 dffo3 7104 . 2 ((𝐸𝐴):𝐴onto𝑉 ↔ ((𝐸𝐴):𝐴𝑉 ∧ ∀𝑏𝑉𝑘𝐴 𝑏 = ((𝐸𝐴)‘𝑘)))
2312, 21, 22mpbir2an 724 1 (𝐸𝐴):𝐴onto𝑉
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4   = wceq 1570  wcel 2146  wral 3082  wrex 3092  Vcvv 3458  wss 3908  ran crn 5667  cres 5668   Fn wfn 6538  wf 6539  ontowfo 6541  cfv 6543
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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pr 5409
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 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-mpt 5198  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-fo 6549  df-fv 6551
This theorem is used by:  basresprsfo  49798  basrestermcfo  50394
  Copyright terms: Public domain W3C validator