Theorem fompt 42344

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		fompt.1	. . . . . . 7 ⊢ 𝐹 = (𝑥 ∈ 𝐴 ↦ 𝐶)
2		nfmpt1 5138	. . . . . . 7 ⊢ Ⅎ𝑥(𝑥 ∈ 𝐴 ↦ 𝐶)
3	1, 2	nfcxfr 2895	. . . . . 6 ⊢ Ⅎ𝑥𝐹
4	3	dffo3f 42331	. . . . 5 ⊢ (𝐹:𝐴–onto→𝐵 ↔ (𝐹:𝐴⟶𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)))
5	4	simplbi 501	. . . 4 ⊢ (𝐹:𝐴–onto→𝐵 → 𝐹:𝐴⟶𝐵)
6	1	fmpt 6905	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ↔ 𝐹:𝐴⟶𝐵)
7	6	bicomi 227	. . . . 5 ⊢ (𝐹:𝐴⟶𝐵 ↔ ∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵)
8	7	biimpi 219	. . . 4 ⊢ (𝐹:𝐴⟶𝐵 → ∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵)
9	5, 8	syl 17	. . 3 ⊢ (𝐹:𝐴–onto→𝐵 → ∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵)
10	3	foelrnf 42338	. . . . 5 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
11		nfcv 2897	. . . . . . . 8 ⊢ Ⅎ𝑥𝐴
12		nfcv 2897	. . . . . . . 8 ⊢ Ⅎ𝑥𝐵
13	3, 11, 12	nffo 6610	. . . . . . 7 ⊢ Ⅎ𝑥 𝐹:𝐴–onto→𝐵
14		simpr 488	. . . . . . . . . 10 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 = (𝐹‘𝑥)) → 𝑦 = (𝐹‘𝑥))
15		simpr 488	. . . . . . . . . . . 12 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
16	9	r19.21bi 3120	. . . . . . . . . . . 12 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝐵)
17	1	fvmpt2 6807	. . . . . . . . . . . 12 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝐶 ∈ 𝐵) → (𝐹‘𝑥) = 𝐶)
18	15, 16, 17	syl2anc 587	. . . . . . . . . . 11 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐶)
19	18	adantr 484	. . . . . . . . . 10 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 = (𝐹‘𝑥)) → (𝐹‘𝑥) = 𝐶)
20	14, 19	eqtrd 2771	. . . . . . . . 9 ⊢ (((𝐹:𝐴–onto→𝐵 ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 = (𝐹‘𝑥)) → 𝑦 = 𝐶)
21	20	ex 416	. . . . . . . 8 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑥 ∈ 𝐴) → (𝑦 = (𝐹‘𝑥) → 𝑦 = 𝐶))
22	21	ex 416	. . . . . . 7 ⊢ (𝐹:𝐴–onto→𝐵 → (𝑥 ∈ 𝐴 → (𝑦 = (𝐹‘𝑥) → 𝑦 = 𝐶)))
23	13, 22	reximdai 3220	. . . . . 6 ⊢ (𝐹:𝐴–onto→𝐵 → (∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐶))
24	23	adantr 484	. . . . 5 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑦 ∈ 𝐵) → (∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐶))
25	10, 24	mpd 15	. . . 4 ⊢ ((𝐹:𝐴–onto→𝐵 ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐶)
26	25	ralrimiva 3095	. . 3 ⊢ (𝐹:𝐴–onto→𝐵 → ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶)
27	9, 26	jca 515	. 2 ⊢ (𝐹:𝐴–onto→𝐵 → (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶))
28	6	biimpi 219	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 → 𝐹:𝐴⟶𝐵)
29	28	adantr 484	. . . 4 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) → 𝐹:𝐴⟶𝐵)
30		nfv 1922	. . . . . 6 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵
31		nfra1 3130	. . . . . 6 ⊢ Ⅎ𝑦∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶
32	30, 31	nfan 1907	. . . . 5 ⊢ Ⅎ𝑦(∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶)
33		simpll 767	. . . . . . 7 ⊢ (((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) ∧ 𝑦 ∈ 𝐵) → ∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵)
34		rspa 3118	. . . . . . . 8 ⊢ ((∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶 ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐶)
35	34	adantll 714	. . . . . . 7 ⊢ (((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 = 𝐶)
36		nfra1 3130	. . . . . . . . 9 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵
37		simp3 1140	. . . . . . . . . . 11 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) → 𝑦 = 𝐶)
38		simpr 488	. . . . . . . . . . . . . 14 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
39		rspa 3118	. . . . . . . . . . . . . 14 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → 𝐶 ∈ 𝐵)
40	38, 39, 17	syl2anc 587	. . . . . . . . . . . . 13 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → (𝐹‘𝑥) = 𝐶)
41	40	eqcomd 2742	. . . . . . . . . . . 12 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴) → 𝐶 = (𝐹‘𝑥))
42	41	3adant3 1134	. . . . . . . . . . 11 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) → 𝐶 = (𝐹‘𝑥))
43	37, 42	eqtrd 2771	. . . . . . . . . 10 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ 𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐶) → 𝑦 = (𝐹‘𝑥))
44	43	3exp 1121	. . . . . . . . 9 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 → (𝑥 ∈ 𝐴 → (𝑦 = 𝐶 → 𝑦 = (𝐹‘𝑥))))
45	36, 44	reximdai 3220	. . . . . . . 8 ⊢ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 → (∃𝑥 ∈ 𝐴 𝑦 = 𝐶 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)))
46	45	imp 410	. . . . . . 7 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
47	33, 35, 46	syl2anc 587	. . . . . 6 ⊢ (((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) ∧ 𝑦 ∈ 𝐵) → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
48	47	ex 416	. . . . 5 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) → (𝑦 ∈ 𝐵 → ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)))
49	32, 48	ralrimi 3127	. . . 4 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) → ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥))
50	29, 49	jca 515	. . 3 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) → (𝐹:𝐴⟶𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = (𝐹‘𝑥)))
51	50, 4	sylibr 237	. 2 ⊢ ((∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶) → 𝐹:𝐴–onto→𝐵)
52	27, 51	impbii 212	1 ⊢ (𝐹:𝐴–onto→𝐵 ↔ (∀𝑥 ∈ 𝐴 𝐶 ∈ 𝐵 ∧ ∀𝑦 ∈ 𝐵 ∃𝑥 ∈ 𝐴 𝑦 = 𝐶))

Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 399   ∧ w3a 1089   = wceq 1543   ∈ wcel 2112  ∀wral 3051  ∃wrex 3052   ↦ cmpt 5120  ⟶wf 6354  –onto→wfo 6356  ‘cfv 6358

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2018  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2160  ax-12 2177  ax-ext 2708  ax-sep 5177  ax-nul 5184  ax-pr 5307

This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2073  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2728  df-clel 2809  df-nfc 2879  df-ne 2933  df-ral 3056  df-rex 3057  df-rab 3060  df-v 3400  df-sbc 3684  df-csb 3799  df-dif 3856  df-un 3858  df-in 3860  df-ss 3870  df-nul 4224  df-if 4426  df-sn 4528  df-pr 4530  df-op 4534  df-uni 4806  df-br 5040  df-opab 5102  df-mpt 5121  df-id 5440  df-xp 5542  df-rel 5543  df-cnv 5544  df-co 5545  df-dm 5546  df-rn 5547  df-res 5548  df-ima 5549  df-iota 6316  df-fun 6360  df-fn 6361  df-f 6362  df-fo 6364  df-fv 6366

This theorem is referenced by:  disjinfi  42345