Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  foresf1o Structured version   Visualization version   GIF version

Theorem foresf1o 33199
Description: From a surjective function, *choose* a subset of the domain, such that the restricted function is bijective. (Contributed by Thierry Arnoux, 27-Jan-2020.) Remove dependency on ax-reg 9623 and ax-inf2 9679. (Revised by Timothy J. O'Malley, 15-Oct-2026.)
Assertion
Ref Expression
foresf1o ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) → ∃𝑥 ∈ 𝒫 𝐴(𝐹 ↾ 𝑥):𝑥⟶1-1onto𝐵)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝐹
Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem foresf1o
Dummy variables 𝑔 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 focdmex 8002 . . . 4 (𝐴 ∈ 𝑉 → (𝐹:𝐴⟶onto𝐵 → 𝐵 ∈ V))
21imp 412 . . 3 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) → 𝐵 ∈ V)
3 simpl 488 . . 3 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) → 𝐴 ∈ 𝑉)
4 foelrn 7139 . . . . . 6 ((𝐹:𝐴⟶onto𝐵 ∧ 𝑦 ∈ 𝐵) → ∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧))
5 fofn 6828 . . . . . . . . . 10 (𝐹:𝐴⟶onto𝐵 → 𝐹 Fn 𝐴)
6 eqcom 2770 . . . . . . . . . . 11 ((𝐹‘𝑧) = 𝑦 ↔ 𝑦 = (𝐹‘𝑧))
7 fniniseg 7091 . . . . . . . . . . . . 13 (𝐹 Fn 𝐴 → (𝑧 ∈ (◡𝐹 “ {𝑦}) ↔ (𝑧 ∈ 𝐴 ∧ (𝐹‘𝑧) = 𝑦)))
87biimpar 483 . . . . . . . . . . . 12 ((𝐹 Fn 𝐴 ∧ (𝑧 ∈ 𝐴 ∧ (𝐹‘𝑧) = 𝑦)) → 𝑧 ∈ (◡𝐹 “ {𝑦}))
98anassrs 473 . . . . . . . . . . 11 (((𝐹 Fn 𝐴 ∧ 𝑧 ∈ 𝐴) ∧ (𝐹‘𝑧) = 𝑦) → 𝑧 ∈ (◡𝐹 “ {𝑦}))
106, 9sylan2br 607 . . . . . . . . . 10 (((𝐹 Fn 𝐴 ∧ 𝑧 ∈ 𝐴) ∧ 𝑦 = (𝐹‘𝑧)) → 𝑧 ∈ (◡𝐹 “ {𝑦}))
115, 10sylanl1 693 . . . . . . . . 9 (((𝐹:𝐴⟶onto𝐵 ∧ 𝑧 ∈ 𝐴) ∧ 𝑦 = (𝐹‘𝑧)) → 𝑧 ∈ (◡𝐹 “ {𝑦}))
1211ex 418 . . . . . . . 8 ((𝐹:𝐴⟶onto𝐵 ∧ 𝑧 ∈ 𝐴) → (𝑦 = (𝐹‘𝑧) → 𝑧 ∈ (◡𝐹 “ {𝑦})))
1312reximdva 3179 . . . . . . 7 (𝐹:𝐴⟶onto𝐵 → (∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧) → ∃𝑧 ∈ 𝐴 𝑧 ∈ (◡𝐹 “ {𝑦})))
1413adantr 486 . . . . . 6 ((𝐹:𝐴⟶onto𝐵 ∧ 𝑦 ∈ 𝐵) → (∃𝑧 ∈ 𝐴 𝑦 = (𝐹‘𝑧) → ∃𝑧 ∈ 𝐴 𝑧 ∈ (◡𝐹 “ {𝑦})))
154, 14mpd 16 . . . . 5 ((𝐹:𝐴⟶onto𝐵 ∧ 𝑦 ∈ 𝐵) → ∃𝑧 ∈ 𝐴 𝑧 ∈ (◡𝐹 “ {𝑦}))
1615adantll 727 . . . 4 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ 𝑦 ∈ 𝐵) → ∃𝑧 ∈ 𝐴 𝑧 ∈ (◡𝐹 “ {𝑦}))
1716ralrimiva 3158 . . 3 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) → ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑧 ∈ (◡𝐹 “ {𝑦}))
18 eleq1 2852 . . . 4 (𝑧 = (𝑔‘𝑦) → (𝑧 ∈ (◡𝐹 “ {𝑦}) ↔ (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦})))
1918ac6 10597 . . 3 ((𝐵 ∈ V ∧ 𝐴 ∈ 𝑉 ∧ ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐴 𝑧 ∈ (◡𝐹 “ {𝑦})) → ∃𝑔(𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦})))
202, 3, 17, 19syl3anc 1399 . 2 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) → ∃𝑔(𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦})))
21 reseq2 5981 . . . 4 (𝑥 = ran 𝑔 → (𝐹 ↾ 𝑥) = (𝐹 ↾ ran 𝑔))
22 id 23 . . . 4 (𝑥 = ran 𝑔 → 𝑥 = ran 𝑔)
23 eqidd 2764 . . . 4 (𝑥 = ran 𝑔 → 𝐵 = 𝐵)
2421, 22, 23f1oeq123d 6848 . . 3 (𝑥 = ran 𝑔 → ((𝐹 ↾ 𝑥):𝑥⟶1-1onto𝐵 ↔ (𝐹 ↾ ran 𝑔):ran 𝑔⟶1-1onto𝐵))
25 frn 6747 . . . . 5 (𝑔:𝐵⟶𝐴 → ran 𝑔 ⊆ 𝐴)
2625ad2antrl 741 . . . 4 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) → ran 𝑔 ⊆ 𝐴)
27 vex 3458 . . . . . 6 𝑔 ∈ V
2827rnex 7956 . . . . 5 ran 𝑔 ∈ V
2928elpw 4564 . . . 4 (ran 𝑔 ∈ 𝒫 𝐴 ↔ ran 𝑔 ⊆ 𝐴)
3026, 29sylibr 237 . . 3 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) → ran 𝑔 ∈ 𝒫 𝐴)
31 fof 6826 . . . . . 6 (𝐹:𝐴⟶onto𝐵 → 𝐹:𝐴⟶𝐵)
3231ad2antlr 740 . . . . 5 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) → 𝐹:𝐴⟶𝐵)
3332, 26fssresd 6779 . . . 4 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) → (𝐹 ↾ ran 𝑔):ran 𝑔⟶𝐵)
34 ffn 6739 . . . . . 6 (𝑔:𝐵⟶𝐴 → 𝑔 Fn 𝐵)
3534ad2antrl 741 . . . . 5 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) → 𝑔 Fn 𝐵)
36 dffn3 6752 . . . . 5 (𝑔 Fn 𝐵 ↔ 𝑔:𝐵⟶ran 𝑔)
3735, 36sylib 221 . . . 4 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) → 𝑔:𝐵⟶ran 𝑔)
38 fvres 6935 . . . . . . . 8 (𝑧 ∈ ran 𝑔 → ((𝐹 ↾ ran 𝑔)‘𝑧) = (𝐹‘𝑧))
3938adantl 487 . . . . . . 7 ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑧 ∈ ran 𝑔) → ((𝐹 ↾ ran 𝑔)‘𝑧) = (𝐹‘𝑧))
4039fveq2d 6920 . . . . . 6 ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑧 ∈ ran 𝑔) → (𝑔‘((𝐹 ↾ ran 𝑔)‘𝑧)) = (𝑔‘(𝐹‘𝑧)))
41 nfv 1949 . . . . . . . . 9 Ⅎ𝑦(𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵)
42 nfv 1949 . . . . . . . . . 10 Ⅎ𝑦 𝑔:𝐵⟶𝐴
43 nfra1 3290 . . . . . . . . . 10 Ⅎ𝑦∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦})
4442, 43nfan 1934 . . . . . . . . 9 Ⅎ𝑦(𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))
4541, 44nfan 1934 . . . . . . . 8 Ⅎ𝑦((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦})))
46 nfv 1949 . . . . . . . 8 Ⅎ𝑦 𝑧 ∈ ran 𝑔
4745, 46nfan 1934 . . . . . . 7 Ⅎ𝑦(((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑧 ∈ ran 𝑔)
48 simpr 490 . . . . . . . . . . 11 ((((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑧 ∈ ran 𝑔) ∧ 𝑦 ∈ 𝐵) ∧ (𝑔‘𝑦) = 𝑧) → (𝑔‘𝑦) = 𝑧)
4948fveq2d 6920 . . . . . . . . . 10 ((((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑧 ∈ ran 𝑔) ∧ 𝑦 ∈ 𝐵) ∧ (𝑔‘𝑦) = 𝑧) → (𝐹‘(𝑔‘𝑦)) = (𝐹‘𝑧))
505ad5antlr 748 . . . . . . . . . . 11 ((((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑧 ∈ ran 𝑔) ∧ 𝑦 ∈ 𝐵) ∧ (𝑔‘𝑦) = 𝑧) → 𝐹 Fn 𝐴)
51 simplrr 790 . . . . . . . . . . . . 13 ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑧 ∈ ran 𝑔) → ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))
5251ad2antrr 739 . . . . . . . . . . . 12 ((((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑧 ∈ ran 𝑔) ∧ 𝑦 ∈ 𝐵) ∧ (𝑔‘𝑦) = 𝑧) → ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))
53 simplr 781 . . . . . . . . . . . 12 ((((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑧 ∈ ran 𝑔) ∧ 𝑦 ∈ 𝐵) ∧ (𝑔‘𝑦) = 𝑧) → 𝑦 ∈ 𝐵)
54 rspa 3255 . . . . . . . . . . . 12 ((∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}) ∧ 𝑦 ∈ 𝐵) → (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))
5552, 53, 54syl2anc 596 . . . . . . . . . . 11 ((((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑧 ∈ ran 𝑔) ∧ 𝑦 ∈ 𝐵) ∧ (𝑔‘𝑦) = 𝑧) → (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))
56 fniniseg 7091 . . . . . . . . . . . 12 (𝐹 Fn 𝐴 → ((𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}) ↔ ((𝑔‘𝑦) ∈ 𝐴 ∧ (𝐹‘(𝑔‘𝑦)) = 𝑦)))
5756simplbda 505 . . . . . . . . . . 11 ((𝐹 Fn 𝐴 ∧ (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦})) → (𝐹‘(𝑔‘𝑦)) = 𝑦)
5850, 55, 57syl2anc 596 . . . . . . . . . 10 ((((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑧 ∈ ran 𝑔) ∧ 𝑦 ∈ 𝐵) ∧ (𝑔‘𝑦) = 𝑧) → (𝐹‘(𝑔‘𝑦)) = 𝑦)
5949, 58eqtr3d 2800 . . . . . . . . 9 ((((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑧 ∈ ran 𝑔) ∧ 𝑦 ∈ 𝐵) ∧ (𝑔‘𝑦) = 𝑧) → (𝐹‘𝑧) = 𝑦)
6059fveq2d 6920 . . . . . . . 8 ((((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑧 ∈ ran 𝑔) ∧ 𝑦 ∈ 𝐵) ∧ (𝑔‘𝑦) = 𝑧) → (𝑔‘(𝐹‘𝑧)) = (𝑔‘𝑦))
6160, 48eqtrd 2798 . . . . . . 7 ((((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑧 ∈ ran 𝑔) ∧ 𝑦 ∈ 𝐵) ∧ (𝑔‘𝑦) = 𝑧) → (𝑔‘(𝐹‘𝑧)) = 𝑧)
62 fvelrnb 6976 . . . . . . . . 9 (𝑔 Fn 𝐵 → (𝑧 ∈ ran 𝑔 ↔ ∃𝑦 ∈ 𝐵 (𝑔‘𝑦) = 𝑧))
6362biimpa 482 . . . . . . . 8 ((𝑔 Fn 𝐵 ∧ 𝑧 ∈ ran 𝑔) → ∃𝑦 ∈ 𝐵 (𝑔‘𝑦) = 𝑧)
6435, 63sylan 592 . . . . . . 7 ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑧 ∈ ran 𝑔) → ∃𝑦 ∈ 𝐵 (𝑔‘𝑦) = 𝑧)
6547, 61, 64r19.29af 3275 . . . . . 6 ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑧 ∈ ran 𝑔) → (𝑔‘(𝐹‘𝑧)) = 𝑧)
6640, 65eqtrd 2798 . . . . 5 ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑧 ∈ ran 𝑔) → (𝑔‘((𝐹 ↾ ran 𝑔)‘𝑧)) = 𝑧)
6766ralrimiva 3158 . . . 4 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) → ∀𝑧 ∈ ran 𝑔(𝑔‘((𝐹 ↾ ran 𝑔)‘𝑧)) = 𝑧)
6837ffvelcdmda 7116 . . . . . . 7 ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑦 ∈ 𝐵) → (𝑔‘𝑦) ∈ ran 𝑔)
6968fvresd 6936 . . . . . 6 ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑦 ∈ 𝐵) → ((𝐹 ↾ ran 𝑔)‘(𝑔‘𝑦)) = (𝐹‘(𝑔‘𝑦)))
705ad3antlr 744 . . . . . . 7 ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑦 ∈ 𝐵) → 𝐹 Fn 𝐴)
71 simplrr 790 . . . . . . . 8 ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑦 ∈ 𝐵) → ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))
72 simpr 490 . . . . . . . 8 ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑦 ∈ 𝐵) → 𝑦 ∈ 𝐵)
7371, 72, 54syl2anc 596 . . . . . . 7 ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑦 ∈ 𝐵) → (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))
7470, 73, 57syl2anc 596 . . . . . 6 ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑦 ∈ 𝐵) → (𝐹‘(𝑔‘𝑦)) = 𝑦)
7569, 74eqtrd 2798 . . . . 5 ((((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) ∧ 𝑦 ∈ 𝐵) → ((𝐹 ↾ ran 𝑔)‘(𝑔‘𝑦)) = 𝑦)
7645, 75ralrimia 3265 . . . 4 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) → ∀𝑦 ∈ 𝐵 ((𝐹 ↾ ran 𝑔)‘(𝑔‘𝑦)) = 𝑦)
7733, 37, 67, 762fvidf1od 7337 . . 3 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) → (𝐹 ↾ ran 𝑔):ran 𝑔⟶1-1onto𝐵)
7824, 30, 77rspcedvdw 3583 . 2 (((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) ∧ (𝑔:𝐵⟶𝐴 ∧ ∀𝑦 ∈ 𝐵 (𝑔‘𝑦) ∈ (◡𝐹 “ {𝑦}))) → ∃𝑥 ∈ 𝒫 𝐴(𝐹 ↾ 𝑥):𝑥⟶1-1onto𝐵)
7920, 78exlimddv 1970 1 ((𝐴 ∈ 𝑉 ∧ 𝐹:𝐴⟶onto𝐵) → ∃𝑥 ∈ 𝒫 𝐴(𝐹 ↾ 𝑥):𝑥⟶1-1onto𝐵)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∀wral 3080  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900  𝒫 cpw 4560  {csn 4588  ◡ccnv 5657  ran crn 5659   ↾ cres 5660   “ cima 5661   Fn wfn 6561  ⟶wf 6562  ⟶ontowfo 6564  ⟶1-1ontowf1o 6565  ‘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-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783  ax-ac2 10580
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  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-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-se 5612  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-isom 6575  df-riota 7408  df-ov 7454  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-en 9012  df-card 10057  df-ac 10234
This theorem is used by:  rabfodom  33200
  Copyright terms: Public domain W3C validator