Theorem fompt 7128

Description: Express being onto for a mapping operation. (Contributed by Glauco Siliprandi, 17-Aug-2020.)

Hypothesis

Ref	Expression
fompt.1	⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶)

Assertion

Ref	Expression
fompt	⊢ (𝐹:𝐴–onto→𝐵 ↔ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶))

Distinct variable groups:   𝑥,𝐴,𝑦   𝑥,𝐵,𝑦   𝑦,𝐶   𝑦,𝐹

Allowed substitution hints:   𝐶(𝑥)   𝐹(𝑥)

Proof of Theorem fompt

Step	Hyp	Ref	Expression
1		fof 6811	. . . 4 ⊢ (𝐹:𝐴–onto→𝐵 → 𝐹:𝐴⟶𝐵)
2		fompt.1	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶)
3	2	fmpt 7120	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ↔ 𝐹:𝐴⟶𝐵)
4	1, 3	sylibr 233	. . 3 ⊢ (𝐹:𝐴–onto→𝐵 → ∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵)
5		nfmpt1 5256	. . . . . . 7 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐶)
6	2, 5	nfcxfr 2897	. . . . . 6 ⊢ Ⅎ𝑥𝐹
7	6	foelrnf 7118	. . . . 5 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
8		nfcv 2899	. . . . . . . 8 ⊢ Ⅎ𝑥𝐴
9		nfcv 2899	. . . . . . . 8 ⊢ Ⅎ𝑥𝐵
10	6, 8, 9	nffo 6810	. . . . . . 7 ⊢ Ⅎ𝑥 𝐹:𝐴–onto→𝐵
11		simpr 484	. . . . . . . . 9 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 = (𝐹‘𝑥)) → 𝑦 = (𝐹‘𝑥))
12		simpr 484	. . . . . . . . . . 11 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
13	4	r19.21bi 3245	. . . . . . . . . . 11 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝐵)
14	2	fvmpt2 7016	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → (𝐹‘𝑥) = 𝐶)
15	12, 13, 14	syl2anc 583	. . . . . . . . . 10 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐶)
16	15	adantr 480	. . . . . . . . 9 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 = (𝐹‘𝑥)) → (𝐹‘𝑥) = 𝐶)
17	11, 16	eqtrd 2768	. . . . . . . 8 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 = (𝐹‘𝑥)) → 𝑦 = 𝐶)
18	17	exp31 419	. . . . . . 7 ⊢ (𝐹:𝐴–onto→𝐵 → (𝑥 ∈ 𝐴 → (𝑦 = (𝐹‘𝑥) → 𝑦 = 𝐶)))
19	10, 18	reximdai 3255	. . . . . 6 ⊢ (𝐹:𝐴–onto→𝐵 → (∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐶))
20	19	adantr 480	. . . . 5 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑦 ∈ 𝐵) → (∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐶))
21	7, 20	mpd 15	. . . 4 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐶)
22	21	ralrimiva 3143	. . 3 ⊢ (𝐹:𝐴–onto→𝐵 → ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶)
23	4, 22	jca 511	. 2 ⊢ (𝐹:𝐴–onto→𝐵 → (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶))
24	3	biimpi 215	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 → 𝐹:𝐴⟶𝐵)
25	24	adantr 480	. . 3 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) → 𝐹:𝐴⟶𝐵)
26		nfv 1910	. . . . 5 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵
27		nfra1 3278	. . . . 5 ⊢ Ⅎ𝑦∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶
28	26, 27	nfan 1895	. . . 4 ⊢ Ⅎ𝑦(∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶)
29		simpll 766	. . . . 5 ⊢ (((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) ∧ 𝑦 ∈ 𝐵) → ∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵)
30		rspa 3242	. . . . . 6 ⊢ ((∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶 ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐶)
31	30	adantll 713	. . . . 5 ⊢ (((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐶)
32		nfra1 3278	. . . . . 6 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵
33		simp3 1136	. . . . . . . 8 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) → 𝑦 = 𝐶)
34		simpr 484	. . . . . . . . . . 11 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
35		rspa 3242	. . . . . . . . . . 11 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝐵)
36	34, 35, 14	syl2anc 583	. . . . . . . . . 10 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐶)
37	36	eqcomd 2734	. . . . . . . . 9 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → 𝐶 = (𝐹‘𝑥))
38	37	3adant3 1130	. . . . . . . 8 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) → 𝐶 = (𝐹‘𝑥))
39	33, 38	eqtrd 2768	. . . . . . 7 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) → 𝑦 = (𝐹‘𝑥))
40	39	3exp 1117	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 → (𝑥 ∈ 𝐴 → (𝑦 = 𝐶 → 𝑦 = (𝐹‘𝑥))))
41	32, 40	reximdai 3255	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 → (∃𝑥 ∈ 𝐴 𝑦 = 𝐶 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)))
42	29, 31, 41	sylc 65	. . . 4 ⊢ (((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
43	28, 42	ralrimia 3252	. . 3 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) → ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
44	6	dffo3f 7116	. . 3 ⊢ (𝐹:𝐴–onto→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)))
45	25, 43, 44	sylanbrc 582	. 2 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) → 𝐹:𝐴–onto→𝐵)
46	23, 45	impbii 208	1 ⊢ (𝐹:𝐴–onto→𝐵 ↔ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1085   = wceq 1534   ∈ wcel 2099  ∀wral 3058  ∃wrex 3067   ↦ cmpt 5231  ⟶wf 6544  –onto→wfo 6546  ‘cfv 6548

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-sep 5299  ax-nul 5306  ax-pr 5429

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2530  df-eu 2559  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3430  df-v 3473  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4324  df-if 4530  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4909  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5576  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-iota 6500  df-fun 6550  df-fn 6551  df-f 6552  df-fo 6554  df-fv 6556

This theorem is referenced by:  zringfrac  32996  algextdeglem8  33392  disjinfi  44565

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »