Users' Mathboxes Mathbox for Alexander van der Vekens < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  fundcmpsurbijinjpreimafv Structured version   Visualization version   GIF version

Theorem fundcmpsurbijinjpreimafv 48489
Description: Every function 𝐹:𝐴⟶𝐵 can be decomposed into a surjective function onto 𝑃, a bijective function from 𝑃 and an injective function into the codomain of 𝐹. (Contributed by AV, 22-Mar-2024.)
Hypothesis
Ref Expression
fundcmpsurinj.p 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}
Assertion
Ref Expression
fundcmpsurbijinjpreimafv ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)))
Distinct variable groups:   𝑥,𝐴,𝑧   𝑥,𝐹,𝑧   𝐴,𝑖,𝑔,ℎ   𝐵,𝑔,ℎ,𝑖   𝑥,𝐵,𝑧   𝑖,𝐹,𝑔,ℎ   𝑃,𝑖,𝑔,ℎ   𝑥,𝑃,𝑔,ℎ   𝑥,𝑉
Allowed substitution hints:   𝑃(𝑧)   𝑉(𝑧, 𝑔, ℎ, 𝑖)

Proof of Theorem fundcmpsurbijinjpreimafv
Dummy variables 𝑎 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpr 490 . . . 4 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → 𝐴 ∈ 𝑉)
21mptexd 7230 . . 3 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})) ∈ V)
3 fundcmpsurinj.p . . . . . 6 𝑃 = {𝑧 ∣ ∃𝑥 ∈ 𝐴 𝑧 = (◡𝐹 “ {(𝐹‘𝑥)})}
43setpreimafvex 48465 . . . . 5 (𝐴 ∈ 𝑉 → 𝑃 ∈ V)
54adantl 487 . . . 4 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → 𝑃 ∈ V)
65mptexd 7230 . . 3 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)) ∈ V)
7 ffun 6712 . . . . 5 (𝐹:𝐴⟶𝐵 → Fun 𝐹)
8 funimaexg 6626 . . . . 5 ((Fun 𝐹 ∧ 𝐴 ∈ 𝑉) → (𝐹 “ 𝐴) ∈ V)
97, 8sylan 592 . . . 4 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → (𝐹 “ 𝐴) ∈ V)
109resiexd 7222 . . 3 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ( I ↾ (𝐹 “ 𝐴)) ∈ V)
112, 6, 103jca 1146 . 2 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ((𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})) ∈ V ∧ (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)) ∈ V ∧ ( I ↾ (𝐹 “ 𝐴)) ∈ V))
12 ffn 6709 . . . . 5 (𝐹:𝐴⟶𝐵 → 𝐹 Fn 𝐴)
13 fveq2 6885 . . . . . . . . 9 (𝑎 = 𝑥 → (𝐹‘𝑎) = (𝐹‘𝑥))
1413sneqd 4595 . . . . . . . 8 (𝑎 = 𝑥 → {(𝐹‘𝑎)} = {(𝐹‘𝑥)})
1514imaeq2d 6051 . . . . . . 7 (𝑎 = 𝑥 → (◡𝐹 “ {(𝐹‘𝑎)}) = (◡𝐹 “ {(𝐹‘𝑥)}))
1615cbvmptv 5208 . . . . . 6 (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})) = (𝑥 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑥)}))
173, 16fundcmpsurinjlem2 48481 . . . . 5 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})):𝐴–onto→𝑃)
1812, 17sylan 592 . . . 4 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})):𝐴–onto→𝑃)
19 eqid 2760 . . . . . 6 (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)) = (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦))
203, 19imasetpreimafvbij 48488 . . . . 5 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉) → (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)):𝑃–1-1-onto→(𝐹 “ 𝐴))
2112, 20sylan 592 . . . 4 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)):𝑃–1-1-onto→(𝐹 “ 𝐴))
22 f1oi 6863 . . . . . 6 ( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)–1-1-onto→(𝐹 “ 𝐴)
23 f1of1 6823 . . . . . 6 (( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)–1-1-onto→(𝐹 “ 𝐴) → ( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)–1-1→(𝐹 “ 𝐴))
24 fimass 6730 . . . . . . . 8 (𝐹:𝐴⟶𝐵 → (𝐹 “ 𝐴) ⊆ 𝐵)
25 f1ss 6785 . . . . . . . 8 ((( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)–1-1→(𝐹 “ 𝐴) ∧ (𝐹 “ 𝐴) ⊆ 𝐵) → ( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)–1-1→𝐵)
2624, 25sylan2 605 . . . . . . 7 ((( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)–1-1→(𝐹 “ 𝐴) ∧ 𝐹:𝐴⟶𝐵) → ( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)–1-1→𝐵)
2726ex 418 . . . . . 6 (( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)–1-1→(𝐹 “ 𝐴) → (𝐹:𝐴⟶𝐵 → ( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)–1-1→𝐵))
2822, 23, 27mp2b 10 . . . . 5 (𝐹:𝐴⟶𝐵 → ( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)–1-1→𝐵)
2928adantr 486 . . . 4 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)–1-1→𝐵)
3018, 21, 293jca 1146 . . 3 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ((𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})):𝐴–onto→𝑃 ∧ (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)):𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ ( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)–1-1→𝐵))
3112adantr 486 . . . . . . . . 9 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → 𝐹 Fn 𝐴)
32 uniimaprimaeqfv 48464 . . . . . . . . 9 ((𝐹 Fn 𝐴 ∧ 𝑎 ∈ 𝐴) → ∪ (𝐹 “ (◡𝐹 “ {(𝐹‘𝑎)})) = (𝐹‘𝑎))
3331, 32sylan 592 . . . . . . . 8 (((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) ∧ 𝑎 ∈ 𝐴) → ∪ (𝐹 “ (◡𝐹 “ {(𝐹‘𝑎)})) = (𝐹‘𝑎))
3433fveq2d 6889 . . . . . . 7 (((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) ∧ 𝑎 ∈ 𝐴) → (( I ↾ (𝐹 “ 𝐴))‘∪ (𝐹 “ (◡𝐹 “ {(𝐹‘𝑎)}))) = (( I ↾ (𝐹 “ 𝐴))‘(𝐹‘𝑎)))
3534mpteq2dva 5197 . . . . . 6 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → (𝑎 ∈ 𝐴 ↦ (( I ↾ (𝐹 “ 𝐴))‘∪ (𝐹 “ (◡𝐹 “ {(𝐹‘𝑎)})))) = (𝑎 ∈ 𝐴 ↦ (( I ↾ (𝐹 “ 𝐴))‘(𝐹‘𝑎))))
36 ffrn 6723 . . . . . . . . . 10 (𝐹:𝐴⟶𝐵 → 𝐹:𝐴⟶ran 𝐹)
3736adantr 486 . . . . . . . . 9 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → 𝐹:𝐴⟶ran 𝐹)
3837funfvima2d 7238 . . . . . . . 8 (((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) ∧ 𝑎 ∈ 𝐴) → (𝐹‘𝑎) ∈ (𝐹 “ 𝐴))
39 fvresi 7178 . . . . . . . 8 ((𝐹‘𝑎) ∈ (𝐹 “ 𝐴) → (( I ↾ (𝐹 “ 𝐴))‘(𝐹‘𝑎)) = (𝐹‘𝑎))
4038, 39syl 18 . . . . . . 7 (((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) ∧ 𝑎 ∈ 𝐴) → (( I ↾ (𝐹 “ 𝐴))‘(𝐹‘𝑎)) = (𝐹‘𝑎))
4140mpteq2dva 5197 . . . . . 6 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → (𝑎 ∈ 𝐴 ↦ (( I ↾ (𝐹 “ 𝐴))‘(𝐹‘𝑎))) = (𝑎 ∈ 𝐴 ↦ (𝐹‘𝑎)))
4235, 41eqtrd 2795 . . . . 5 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → (𝑎 ∈ 𝐴 ↦ (( I ↾ (𝐹 “ 𝐴))‘∪ (𝐹 “ (◡𝐹 “ {(𝐹‘𝑎)})))) = (𝑎 ∈ 𝐴 ↦ (𝐹‘𝑎)))
4312ad2antrr 739 . . . . . . 7 (((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) ∧ 𝑎 ∈ 𝐴) → 𝐹 Fn 𝐴)
441adantr 486 . . . . . . 7 (((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) ∧ 𝑎 ∈ 𝐴) → 𝐴 ∈ 𝑉)
45 simpr 490 . . . . . . 7 (((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) ∧ 𝑎 ∈ 𝐴) → 𝑎 ∈ 𝐴)
463preimafvelsetpreimafv 48470 . . . . . . 7 ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝑉 ∧ 𝑎 ∈ 𝐴) → (◡𝐹 “ {(𝐹‘𝑎)}) ∈ 𝑃)
4743, 44, 45, 46syl3anc 1398 . . . . . 6 (((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) ∧ 𝑎 ∈ 𝐴) → (◡𝐹 “ {(𝐹‘𝑎)}) ∈ 𝑃)
48 eqidd 2761 . . . . . 6 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})) = (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})))
49 eqidd 2761 . . . . . 6 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → (𝑦 ∈ 𝑃 ↦ (( I ↾ (𝐹 “ 𝐴))‘∪ (𝐹 “ 𝑦))) = (𝑦 ∈ 𝑃 ↦ (( I ↾ (𝐹 “ 𝐴))‘∪ (𝐹 “ 𝑦))))
50 imaeq2 6047 . . . . . . . 8 (𝑦 = (◡𝐹 “ {(𝐹‘𝑎)}) → (𝐹 “ 𝑦) = (𝐹 “ (◡𝐹 “ {(𝐹‘𝑎)})))
5150unieqd 4879 . . . . . . 7 (𝑦 = (◡𝐹 “ {(𝐹‘𝑎)}) → ∪ (𝐹 “ 𝑦) = ∪ (𝐹 “ (◡𝐹 “ {(𝐹‘𝑎)})))
5251fveq2d 6889 . . . . . 6 (𝑦 = (◡𝐹 “ {(𝐹‘𝑎)}) → (( I ↾ (𝐹 “ 𝐴))‘∪ (𝐹 “ 𝑦)) = (( I ↾ (𝐹 “ 𝐴))‘∪ (𝐹 “ (◡𝐹 “ {(𝐹‘𝑎)}))))
5347, 48, 49, 52fmptco 7130 . . . . 5 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ((𝑦 ∈ 𝑃 ↦ (( I ↾ (𝐹 “ 𝐴))‘∪ (𝐹 “ 𝑦))) ∘ (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)}))) = (𝑎 ∈ 𝐴 ↦ (( I ↾ (𝐹 “ 𝐴))‘∪ (𝐹 “ (◡𝐹 “ {(𝐹‘𝑎)})))))
54 dffn5 6943 . . . . . . 7 (𝐹 Fn 𝐴 ↔ 𝐹 = (𝑎 ∈ 𝐴 ↦ (𝐹‘𝑎)))
5512, 54sylib 221 . . . . . 6 (𝐹:𝐴⟶𝐵 → 𝐹 = (𝑎 ∈ 𝐴 ↦ (𝐹‘𝑎)))
5655adantr 486 . . . . 5 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → 𝐹 = (𝑎 ∈ 𝐴 ↦ (𝐹‘𝑎)))
5742, 53, 563eqtr4rd 2806 . . . 4 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → 𝐹 = ((𝑦 ∈ 𝑃 ↦ (( I ↾ (𝐹 “ 𝐴))‘∪ (𝐹 “ 𝑦))) ∘ (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)}))))
58 f1of 6824 . . . . . . . . . 10 (( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)–1-1-onto→(𝐹 “ 𝐴) → ( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)⟶(𝐹 “ 𝐴))
5922, 58mp1i 14 . . . . . . . . 9 (𝐹 Fn 𝐴 → ( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)⟶(𝐹 “ 𝐴))
60 fnima 6669 . . . . . . . . . . 11 (𝐹 Fn 𝐴 → (𝐹 “ 𝐴) = ran 𝐹)
6160eqcomd 2766 . . . . . . . . . 10 (𝐹 Fn 𝐴 → ran 𝐹 = (𝐹 “ 𝐴))
6261feq2d 6693 . . . . . . . . 9 (𝐹 Fn 𝐴 → (( I ↾ (𝐹 “ 𝐴)):ran 𝐹⟶(𝐹 “ 𝐴) ↔ ( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)⟶(𝐹 “ 𝐴)))
6359, 62mpbird 260 . . . . . . . 8 (𝐹 Fn 𝐴 → ( I ↾ (𝐹 “ 𝐴)):ran 𝐹⟶(𝐹 “ 𝐴))
643uniimaelsetpreimafv 48478 . . . . . . . 8 ((𝐹 Fn 𝐴 ∧ 𝑦 ∈ 𝑃) → ∪ (𝐹 “ 𝑦) ∈ ran 𝐹)
6563, 64cofmpt 7133 . . . . . . 7 (𝐹 Fn 𝐴 → (( I ↾ (𝐹 “ 𝐴)) ∘ (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦))) = (𝑦 ∈ 𝑃 ↦ (( I ↾ (𝐹 “ 𝐴))‘∪ (𝐹 “ 𝑦))))
6665eqcomd 2766 . . . . . 6 (𝐹 Fn 𝐴 → (𝑦 ∈ 𝑃 ↦ (( I ↾ (𝐹 “ 𝐴))‘∪ (𝐹 “ 𝑦))) = (( I ↾ (𝐹 “ 𝐴)) ∘ (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦))))
6731, 66syl 18 . . . . 5 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → (𝑦 ∈ 𝑃 ↦ (( I ↾ (𝐹 “ 𝐴))‘∪ (𝐹 “ 𝑦))) = (( I ↾ (𝐹 “ 𝐴)) ∘ (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦))))
6867coeq1d 5838 . . . 4 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ((𝑦 ∈ 𝑃 ↦ (( I ↾ (𝐹 “ 𝐴))‘∪ (𝐹 “ 𝑦))) ∘ (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)}))) = ((( I ↾ (𝐹 “ 𝐴)) ∘ (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦))) ∘ (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)}))))
6957, 68eqtrd 2795 . . 3 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → 𝐹 = ((( I ↾ (𝐹 “ 𝐴)) ∘ (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦))) ∘ (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)}))))
7030, 69jca 521 . 2 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → (((𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})):𝐴–onto→𝑃 ∧ (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)):𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ ( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((( I ↾ (𝐹 “ 𝐴)) ∘ (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦))) ∘ (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})))))
71 foeq1 6792 . . . . . 6 (𝑔 = (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})) → (𝑔:𝐴–onto→𝑃 ↔ (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})):𝐴–onto→𝑃))
72713ad2ant1 1151 . . . . 5 ((𝑔 = (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})) ∧ ℎ = (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)) ∧ 𝑖 = ( I ↾ (𝐹 “ 𝐴))) → (𝑔:𝐴–onto→𝑃 ↔ (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})):𝐴–onto→𝑃))
73 f1oeq1 6812 . . . . . 6 (ℎ = (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)) → (ℎ:𝑃–1-1-onto→(𝐹 “ 𝐴) ↔ (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)):𝑃–1-1-onto→(𝐹 “ 𝐴)))
74733ad2ant2 1152 . . . . 5 ((𝑔 = (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})) ∧ ℎ = (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)) ∧ 𝑖 = ( I ↾ (𝐹 “ 𝐴))) → (ℎ:𝑃–1-1-onto→(𝐹 “ 𝐴) ↔ (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)):𝑃–1-1-onto→(𝐹 “ 𝐴)))
75 f1eq1 6773 . . . . . 6 (𝑖 = ( I ↾ (𝐹 “ 𝐴)) → (𝑖:(𝐹 “ 𝐴)–1-1→𝐵 ↔ ( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)–1-1→𝐵))
76753ad2ant3 1153 . . . . 5 ((𝑔 = (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})) ∧ ℎ = (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)) ∧ 𝑖 = ( I ↾ (𝐹 “ 𝐴))) → (𝑖:(𝐹 “ 𝐴)–1-1→𝐵 ↔ ( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)–1-1→𝐵))
7772, 74, 763anbi123d 1464 . . . 4 ((𝑔 = (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})) ∧ ℎ = (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)) ∧ 𝑖 = ( I ↾ (𝐹 “ 𝐴))) → ((𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵) ↔ ((𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})):𝐴–onto→𝑃 ∧ (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)):𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ ( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)–1-1→𝐵)))
78 simp3 1156 . . . . . . 7 ((𝑔 = (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})) ∧ ℎ = (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)) ∧ 𝑖 = ( I ↾ (𝐹 “ 𝐴))) → 𝑖 = ( I ↾ (𝐹 “ 𝐴)))
79 simp2 1155 . . . . . . 7 ((𝑔 = (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})) ∧ ℎ = (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)) ∧ 𝑖 = ( I ↾ (𝐹 “ 𝐴))) → ℎ = (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)))
8078, 79coeq12d 5841 . . . . . 6 ((𝑔 = (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})) ∧ ℎ = (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)) ∧ 𝑖 = ( I ↾ (𝐹 “ 𝐴))) → (𝑖 ∘ ℎ) = (( I ↾ (𝐹 “ 𝐴)) ∘ (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦))))
81 simp1 1154 . . . . . 6 ((𝑔 = (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})) ∧ ℎ = (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)) ∧ 𝑖 = ( I ↾ (𝐹 “ 𝐴))) → 𝑔 = (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})))
8280, 81coeq12d 5841 . . . . 5 ((𝑔 = (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})) ∧ ℎ = (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)) ∧ 𝑖 = ( I ↾ (𝐹 “ 𝐴))) → ((𝑖 ∘ ℎ) ∘ 𝑔) = ((( I ↾ (𝐹 “ 𝐴)) ∘ (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦))) ∘ (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)}))))
8382eqeq2d 2771 . . . 4 ((𝑔 = (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})) ∧ ℎ = (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)) ∧ 𝑖 = ( I ↾ (𝐹 “ 𝐴))) → (𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔) ↔ 𝐹 = ((( I ↾ (𝐹 “ 𝐴)) ∘ (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦))) ∘ (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})))))
8477, 83anbi12d 644 . . 3 ((𝑔 = (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})) ∧ ℎ = (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)) ∧ 𝑖 = ( I ↾ (𝐹 “ 𝐴))) → (((𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)) ↔ (((𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})):𝐴–onto→𝑃 ∧ (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)):𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ ( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((( I ↾ (𝐹 “ 𝐴)) ∘ (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦))) ∘ (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)}))))))
8584spc3egv 3557 . 2 (((𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})) ∈ V ∧ (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)) ∈ V ∧ ( I ↾ (𝐹 “ 𝐴)) ∈ V) → ((((𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})):𝐴–onto→𝑃 ∧ (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦)):𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ ( I ↾ (𝐹 “ 𝐴)):(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((( I ↾ (𝐹 “ 𝐴)) ∘ (𝑦 ∈ 𝑃 ↦ ∪ (𝐹 “ 𝑦))) ∘ (𝑎 ∈ 𝐴 ↦ (◡𝐹 “ {(𝐹‘𝑎)})))) → ∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔))))
8611, 70, 85sylc 66 1 ((𝐹:𝐴⟶𝐵 ∧ 𝐴 ∈ 𝑉) → ∃𝑔∃ℎ∃𝑖((𝑔:𝐴–onto→𝑃 ∧ ℎ:𝑃–1-1-onto→(𝐹 “ 𝐴) ∧ 𝑖:(𝐹 “ 𝐴)–1-1→𝐵) ∧ 𝐹 = ((𝑖 ∘ ℎ) ∘ 𝑔)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569  ∃wex 1811   ∈ wcel 2144  {cab 2738  ∃wrex 3086  Vcvv 3450   ⊆ wss 3895  {csn 4583  ∪ cuni 4866   ↦ cmpt 5185   I cid 5544  ◡ccnv 5649  ran crn 5651   ↾ cres 5652   “ cima 5653   ∘ ccom 5654  Fun wfun 6532   Fn wfn 6533  ⟶wf 6534  –1-1→wf1 6535  –onto→wfo 6536  –1-1-onto→wf1o 6537  ‘cfv 6538
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-nel 3062  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546
This theorem is used by:  fundcmpsurinjpreimafv  48490  fundcmpsurbijinj  48492
  Copyright terms: Public domain W3C validator