Theorem tgjustr 28948

Description: Given any equivalence relation 𝑅, one can define a function 𝑓 such that all elements of an equivalence classe of 𝑅 have the same image by 𝑓. (Contributed by Thierry Arnoux, 25-Jan-2023.)

Assertion

Ref	Expression
tgjustr	⊢ ((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) → ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝑓‘𝑥) = (𝑓‘𝑦))))

Distinct variable groups:   𝐴,𝑓,𝑥,𝑦   𝑅,𝑓,𝑥,𝑦   𝑥,𝑉,𝑦

Allowed substitution hint:   𝑉(𝑓)

Proof of Theorem tgjustr

Dummy variable 𝑢 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		erex 8753	. . . . . . 7 ⊢ (𝑅 Er 𝐴 → (𝐴 ∈ 𝑉 → 𝑅 ∈ V))
2	1	impcom 413	. . . . . 6 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) → 𝑅 ∈ V)
3		ecexg 8732	. . . . . 6 ⊢ (𝑅 ∈ V → [𝑢]𝑅 ∈ V)
4	2, 3	syl 18	. . . . 5 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) → [𝑢]𝑅 ∈ V)
5	4	adantr 486	. . . 4 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) ∧ 𝑢 ∈ 𝐴) → [𝑢]𝑅 ∈ V)
6	5	ralrimiva 3157	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) → ∀𝑢 ∈ 𝐴 [𝑢]𝑅 ∈ V)
7		eqid 2763	. . . 4 ⊢ (𝑢 ∈ 𝐴 ↦ [𝑢]𝑅) = (𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)
8	7	fnmpt 6687	. . 3 ⊢ (∀𝑢 ∈ 𝐴 [𝑢]𝑅 ∈ V → (𝑢 ∈ 𝐴 ↦ [𝑢]𝑅) Fn 𝐴)
9	6, 8	syl 18	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) → (𝑢 ∈ 𝐴 ↦ [𝑢]𝑅) Fn 𝐴)
10		simpllr 788	. . . . . 6 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → 𝑅 Er 𝐴)
11		simpr 490	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) ∧ 𝑥 ∈ 𝐴) → 𝑥 ∈ 𝐴)
12	11	adantr 486	. . . . . 6 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → 𝑥 ∈ 𝐴)
13	10, 12	erth 8783	. . . . 5 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → (𝑥𝑅𝑦 ↔ [𝑥]𝑅 = [𝑦]𝑅))
14		eceq1 8768	. . . . . . . 8 ⊢ (𝑢 = 𝑥 → [𝑢]𝑅 = [𝑥]𝑅)
15		ecelqsw 8800	. . . . . . . . 9 ⊢ ((𝑅 ∈ V ∧ 𝑥 ∈ 𝐴) → [𝑥]𝑅 ∈ (𝐴 / 𝑅))
16	2, 15	sylan 592	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) ∧ 𝑥 ∈ 𝐴) → [𝑥]𝑅 ∈ (𝐴 / 𝑅))
17	7, 14, 11, 16	fvmptd3 7025	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) ∧ 𝑥 ∈ 𝐴) → ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑥) = [𝑥]𝑅)
18	17	adantr 486	. . . . . 6 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑥) = [𝑥]𝑅)
19		eceq1 8768	. . . . . . . 8 ⊢ (𝑢 = 𝑦 → [𝑢]𝑅 = [𝑦]𝑅)
20		simpr 490	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) ∧ 𝑦 ∈ 𝐴) → 𝑦 ∈ 𝐴)
21		ecelqsw 8800	. . . . . . . . 9 ⊢ ((𝑅 ∈ V ∧ 𝑦 ∈ 𝐴) → [𝑦]𝑅 ∈ (𝐴 / 𝑅))
22	2, 21	sylan 592	. . . . . . . 8 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) ∧ 𝑦 ∈ 𝐴) → [𝑦]𝑅 ∈ (𝐴 / 𝑅))
23	7, 19, 20, 22	fvmptd3 7025	. . . . . . 7 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) ∧ 𝑦 ∈ 𝐴) → ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑦) = [𝑦]𝑅)
24	23	adantlr 728	. . . . . 6 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑦) = [𝑦]𝑅)
25	18, 24	eqeq12d 2779	. . . . 5 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → (((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑥) = ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑦) ↔ [𝑥]𝑅 = [𝑦]𝑅))
26	13, 25	bitr4d 285	. . . 4 ⊢ ((((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) ∧ 𝑥 ∈ 𝐴) ∧ 𝑦 ∈ 𝐴) → (𝑥𝑅𝑦 ↔ ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑥) = ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑦)))
27	26	ralrimiva 3157	. . 3 ⊢ (((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) ∧ 𝑥 ∈ 𝐴) → ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑥) = ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑦)))
28	27	ralrimiva 3157	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) → ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑥) = ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑦)))
29		mptexg 7234	. . . 4 ⊢ (𝐴 ∈ 𝑉 → (𝑢 ∈ 𝐴 ↦ [𝑢]𝑅) ∈ V)
30	29	adantr 486	. . 3 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) → (𝑢 ∈ 𝐴 ↦ [𝑢]𝑅) ∈ V)
31		fneq1 6638	. . . . 5 ⊢ (𝑓 = (𝑢 ∈ 𝐴 ↦ [𝑢]𝑅) → (𝑓 Fn 𝐴 ↔ (𝑢 ∈ 𝐴 ↦ [𝑢]𝑅) Fn 𝐴))
32		simpl 488	. . . . . . . . 9 ⊢ ((𝑓 = (𝑢 ∈ 𝐴 ↦ [𝑢]𝑅) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → 𝑓 = (𝑢 ∈ 𝐴 ↦ [𝑢]𝑅))
33	32	fveq1d 6895	. . . . . . . 8 ⊢ ((𝑓 = (𝑢 ∈ 𝐴 ↦ [𝑢]𝑅) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑓‘𝑥) = ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑥))
34	32	fveq1d 6895	. . . . . . . 8 ⊢ ((𝑓 = (𝑢 ∈ 𝐴 ↦ [𝑢]𝑅) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑓‘𝑦) = ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑦))
35	33, 34	eqeq12d 2779	. . . . . . 7 ⊢ ((𝑓 = (𝑢 ∈ 𝐴 ↦ [𝑢]𝑅) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝑓‘𝑥) = (𝑓‘𝑦) ↔ ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑥) = ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑦)))
36	35	bibi2d 345	. . . . . 6 ⊢ ((𝑓 = (𝑢 ∈ 𝐴 ↦ [𝑢]𝑅) ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝑥𝑅𝑦 ↔ (𝑓‘𝑥) = (𝑓‘𝑦)) ↔ (𝑥𝑅𝑦 ↔ ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑥) = ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑦))))
37	36	2ralbidva 3227	. . . . 5 ⊢ (𝑓 = (𝑢 ∈ 𝐴 ↦ [𝑢]𝑅) → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝑓‘𝑥) = (𝑓‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑥) = ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑦))))
38	31, 37	anbi12d 644	. . . 4 ⊢ (𝑓 = (𝑢 ∈ 𝐴 ↦ [𝑢]𝑅) → ((𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝑓‘𝑥) = (𝑓‘𝑦))) ↔ ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅) Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑥) = ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑦)))))
39	38	spcegv 3554	. . 3 ⊢ ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅) ∈ V → (((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅) Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑥) = ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑦))) → ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝑓‘𝑥) = (𝑓‘𝑦)))))
40	30, 39	syl 18	. 2 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) → (((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅) Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑥) = ((𝑢 ∈ 𝐴 ↦ [𝑢]𝑅)‘𝑦))) → ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝑓‘𝑥) = (𝑓‘𝑦)))))
41	9, 28, 40	mp2and 712	1 ⊢ ((𝐴 ∈ 𝑉 ∧ 𝑅 Er 𝐴) → ∃𝑓(𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑅𝑦 ↔ (𝑓‘𝑥) = (𝑓‘𝑦))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1569  ∃wex 1811   ∈ wcel 2146  ∀wral 3079  Vcvv 3453   class class class wbr 5105   ↦ cmpt 5188   Fn wfn 6541  ‘cfv 6546   Er wer 8725  [cec 8726   / cqs 8727

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 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5234  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758

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 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-iun 4955  df-br 5106  df-opab 5170  df-mpt 5189  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-f1 6551  df-fo 6552  df-f1o 6553  df-fv 6554  df-er 8728  df-ec 8730  df-qs 8734

This theorem is used by:  tgjustc2  28950