Theorem tgjustf 28496

Description: Given any function 𝐹, equality of the image by 𝐹 is an equivalence relation. (Contributed by Thierry Arnoux, 25-Jan-2023.)

Assertion

Ref	Expression
tgjustf	⊢ (𝐴 ∈ 𝑉 → ∃𝑟(𝑟 Er 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑟𝑦 ↔ (𝐹‘𝑥) = (𝐹‘𝑦))))

Distinct variable groups:   𝐴,𝑟,𝑥,𝑦   𝐹,𝑟,𝑥,𝑦

Allowed substitution hints:   𝑉(𝑥,𝑦,𝑟)

Proof of Theorem tgjustf

Dummy variables 𝑢 𝑣 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		relopabv 5834	. . 3 ⊢ Rel {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}
2		ancom 460	. . . . . 6 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ↔ (𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴))
3		eqcom 2742	. . . . . 6 ⊢ ((𝐹‘𝑥) = (𝐹‘𝑦) ↔ (𝐹‘𝑦) = (𝐹‘𝑥))
4	2, 3	anbi12i 628	. . . . 5 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) ↔ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑦) = (𝐹‘𝑥)))
5		simpl 482	. . . . . . . 8 ⊢ ((𝑢 = 𝑥 ∧ 𝑣 = 𝑦) → 𝑢 = 𝑥)
6	5	fveq2d 6911	. . . . . . 7 ⊢ ((𝑢 = 𝑥 ∧ 𝑣 = 𝑦) → (𝐹‘𝑢) = (𝐹‘𝑥))
7		simpr 484	. . . . . . . 8 ⊢ ((𝑢 = 𝑥 ∧ 𝑣 = 𝑦) → 𝑣 = 𝑦)
8	7	fveq2d 6911	. . . . . . 7 ⊢ ((𝑢 = 𝑥 ∧ 𝑣 = 𝑦) → (𝐹‘𝑣) = (𝐹‘𝑦))
9	6, 8	eqeq12d 2751	. . . . . 6 ⊢ ((𝑢 = 𝑥 ∧ 𝑣 = 𝑦) → ((𝐹‘𝑢) = (𝐹‘𝑣) ↔ (𝐹‘𝑥) = (𝐹‘𝑦)))
10		eqid 2735	. . . . . 6 ⊢ {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))} = {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}
11	9, 10	brab2a 5782	. . . . 5 ⊢ (𝑥{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑦 ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)))
12		simpl 482	. . . . . . . 8 ⊢ ((𝑢 = 𝑦 ∧ 𝑣 = 𝑥) → 𝑢 = 𝑦)
13	12	fveq2d 6911	. . . . . . 7 ⊢ ((𝑢 = 𝑦 ∧ 𝑣 = 𝑥) → (𝐹‘𝑢) = (𝐹‘𝑦))
14		simpr 484	. . . . . . . 8 ⊢ ((𝑢 = 𝑦 ∧ 𝑣 = 𝑥) → 𝑣 = 𝑥)
15	14	fveq2d 6911	. . . . . . 7 ⊢ ((𝑢 = 𝑦 ∧ 𝑣 = 𝑥) → (𝐹‘𝑣) = (𝐹‘𝑥))
16	13, 15	eqeq12d 2751	. . . . . 6 ⊢ ((𝑢 = 𝑦 ∧ 𝑣 = 𝑥) → ((𝐹‘𝑢) = (𝐹‘𝑣) ↔ (𝐹‘𝑦) = (𝐹‘𝑥)))
17	16, 10	brab2a 5782	. . . . 5 ⊢ (𝑦{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑥 ↔ ((𝑦 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑦) = (𝐹‘𝑥)))
18	4, 11, 17	3bitr4i 303	. . . 4 ⊢ (𝑥{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑦 ↔ 𝑦{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑥)
19	18	biimpi 216	. . 3 ⊢ (𝑥{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑦 → 𝑦{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑥)
20		simplll 775	. . . . 5 ⊢ ((((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) ∧ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) ∧ (𝐹‘𝑦) = (𝐹‘𝑧))) → 𝑥 ∈ 𝐴)
21		simprlr 780	. . . . 5 ⊢ ((((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) ∧ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) ∧ (𝐹‘𝑦) = (𝐹‘𝑧))) → 𝑧 ∈ 𝐴)
22		simplr 769	. . . . . 6 ⊢ ((((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) ∧ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) ∧ (𝐹‘𝑦) = (𝐹‘𝑧))) → (𝐹‘𝑥) = (𝐹‘𝑦))
23		simprr 773	. . . . . 6 ⊢ ((((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) ∧ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) ∧ (𝐹‘𝑦) = (𝐹‘𝑧))) → (𝐹‘𝑦) = (𝐹‘𝑧))
24	22, 23	eqtrd 2775	. . . . 5 ⊢ ((((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) ∧ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) ∧ (𝐹‘𝑦) = (𝐹‘𝑧))) → (𝐹‘𝑥) = (𝐹‘𝑧))
25	20, 21, 24	jca31 514	. . . 4 ⊢ ((((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) ∧ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) ∧ (𝐹‘𝑦) = (𝐹‘𝑧))) → ((𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) ∧ (𝐹‘𝑥) = (𝐹‘𝑧)))
26		simpl 482	. . . . . . . 8 ⊢ ((𝑢 = 𝑦 ∧ 𝑣 = 𝑧) → 𝑢 = 𝑦)
27	26	fveq2d 6911	. . . . . . 7 ⊢ ((𝑢 = 𝑦 ∧ 𝑣 = 𝑧) → (𝐹‘𝑢) = (𝐹‘𝑦))
28		simpr 484	. . . . . . . 8 ⊢ ((𝑢 = 𝑦 ∧ 𝑣 = 𝑧) → 𝑣 = 𝑧)
29	28	fveq2d 6911	. . . . . . 7 ⊢ ((𝑢 = 𝑦 ∧ 𝑣 = 𝑧) → (𝐹‘𝑣) = (𝐹‘𝑧))
30	27, 29	eqeq12d 2751	. . . . . 6 ⊢ ((𝑢 = 𝑦 ∧ 𝑣 = 𝑧) → ((𝐹‘𝑢) = (𝐹‘𝑣) ↔ (𝐹‘𝑦) = (𝐹‘𝑧)))
31	30, 10	brab2a 5782	. . . . 5 ⊢ (𝑦{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑧 ↔ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) ∧ (𝐹‘𝑦) = (𝐹‘𝑧)))
32	11, 31	anbi12i 628	. . . 4 ⊢ ((𝑥{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑦 ∧ 𝑦{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑧) ↔ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) ∧ (𝐹‘𝑥) = (𝐹‘𝑦)) ∧ ((𝑦 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) ∧ (𝐹‘𝑦) = (𝐹‘𝑧))))
33		simpl 482	. . . . . . 7 ⊢ ((𝑢 = 𝑥 ∧ 𝑣 = 𝑧) → 𝑢 = 𝑥)
34	33	fveq2d 6911	. . . . . 6 ⊢ ((𝑢 = 𝑥 ∧ 𝑣 = 𝑧) → (𝐹‘𝑢) = (𝐹‘𝑥))
35		simpr 484	. . . . . . 7 ⊢ ((𝑢 = 𝑥 ∧ 𝑣 = 𝑧) → 𝑣 = 𝑧)
36	35	fveq2d 6911	. . . . . 6 ⊢ ((𝑢 = 𝑥 ∧ 𝑣 = 𝑧) → (𝐹‘𝑣) = (𝐹‘𝑧))
37	34, 36	eqeq12d 2751	. . . . 5 ⊢ ((𝑢 = 𝑥 ∧ 𝑣 = 𝑧) → ((𝐹‘𝑢) = (𝐹‘𝑣) ↔ (𝐹‘𝑥) = (𝐹‘𝑧)))
38	37, 10	brab2a 5782	. . . 4 ⊢ (𝑥{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑧 ↔ ((𝑥 ∈ 𝐴 ∧ 𝑧 ∈ 𝐴) ∧ (𝐹‘𝑥) = (𝐹‘𝑧)))
39	25, 32, 38	3imtr4i 292	. . 3 ⊢ ((𝑥{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑦 ∧ 𝑦{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑧) → 𝑥{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑧)
40		eqid 2735	. . . . 5 ⊢ (𝐹‘𝑥) = (𝐹‘𝑥)
41	40	biantru 529	. . . 4 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑥) = (𝐹‘𝑥)))
42		pm4.24 563	. . . 4 ⊢ (𝑥 ∈ 𝐴 ↔ (𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴))
43		simpl 482	. . . . . . 7 ⊢ ((𝑢 = 𝑥 ∧ 𝑣 = 𝑥) → 𝑢 = 𝑥)
44	43	fveq2d 6911	. . . . . 6 ⊢ ((𝑢 = 𝑥 ∧ 𝑣 = 𝑥) → (𝐹‘𝑢) = (𝐹‘𝑥))
45		simpr 484	. . . . . . 7 ⊢ ((𝑢 = 𝑥 ∧ 𝑣 = 𝑥) → 𝑣 = 𝑥)
46	45	fveq2d 6911	. . . . . 6 ⊢ ((𝑢 = 𝑥 ∧ 𝑣 = 𝑥) → (𝐹‘𝑣) = (𝐹‘𝑥))
47	44, 46	eqeq12d 2751	. . . . 5 ⊢ ((𝑢 = 𝑥 ∧ 𝑣 = 𝑥) → ((𝐹‘𝑢) = (𝐹‘𝑣) ↔ (𝐹‘𝑥) = (𝐹‘𝑥)))
48	47, 10	brab2a 5782	. . . 4 ⊢ (𝑥{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑥 ↔ ((𝑥 ∈ 𝐴 ∧ 𝑥 ∈ 𝐴) ∧ (𝐹‘𝑥) = (𝐹‘𝑥)))
49	41, 42, 48	3bitr4i 303	. . 3 ⊢ (𝑥 ∈ 𝐴 ↔ 𝑥{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑥)
50	1, 19, 39, 49	iseri 8771	. 2 ⊢ {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))} Er 𝐴
51	11	baib 535	. . 3 ⊢ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴) → (𝑥{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑦 ↔ (𝐹‘𝑥) = (𝐹‘𝑦)))
52	51	rgen2 3197	. 2 ⊢ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑦 ↔ (𝐹‘𝑥) = (𝐹‘𝑦))
53		id 22	. . . 4 ⊢ (𝐴 ∈ 𝑉 → 𝐴 ∈ 𝑉)
54		simprll 779	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))) → 𝑢 ∈ 𝐴)
55		simprlr 780	. . . 4 ⊢ ((𝐴 ∈ 𝑉 ∧ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))) → 𝑣 ∈ 𝐴)
56	53, 53, 54, 55	opabex2 8081	. . 3 ⊢ (𝐴 ∈ 𝑉 → {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))} ∈ V)
57		ereq1 8751	. . . . 5 ⊢ (𝑟 = {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))} → (𝑟 Er 𝐴 ↔ {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))} Er 𝐴))
58		simpl 482	. . . . . . . 8 ⊢ ((𝑟 = {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))} ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → 𝑟 = {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))})
59	58	breqd 5159	. . . . . . 7 ⊢ ((𝑟 = {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))} ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → (𝑥𝑟𝑦 ↔ 𝑥{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑦))
60	59	bibi1d 343	. . . . . 6 ⊢ ((𝑟 = {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))} ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐴)) → ((𝑥𝑟𝑦 ↔ (𝐹‘𝑥) = (𝐹‘𝑦)) ↔ (𝑥{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑦 ↔ (𝐹‘𝑥) = (𝐹‘𝑦))))
61	60	2ralbidva 3217	. . . . 5 ⊢ (𝑟 = {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))} → (∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑟𝑦 ↔ (𝐹‘𝑥) = (𝐹‘𝑦)) ↔ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑦 ↔ (𝐹‘𝑥) = (𝐹‘𝑦))))
62	57, 61	anbi12d 632	. . . 4 ⊢ (𝑟 = {⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))} → ((𝑟 Er 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑟𝑦 ↔ (𝐹‘𝑥) = (𝐹‘𝑦))) ↔ ({⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))} Er 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑦 ↔ (𝐹‘𝑥) = (𝐹‘𝑦)))))
63	62	spcegv 3597	. . 3 ⊢ ({⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))} ∈ V → (({⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))} Er 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑦 ↔ (𝐹‘𝑥) = (𝐹‘𝑦))) → ∃𝑟(𝑟 Er 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑟𝑦 ↔ (𝐹‘𝑥) = (𝐹‘𝑦)))))
64	56, 63	syl 17	. 2 ⊢ (𝐴 ∈ 𝑉 → (({⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))} Er 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥{⟨𝑢, 𝑣⟩ ∣ ((𝑢 ∈ 𝐴 ∧ 𝑣 ∈ 𝐴) ∧ (𝐹‘𝑢) = (𝐹‘𝑣))}𝑦 ↔ (𝐹‘𝑥) = (𝐹‘𝑦))) → ∃𝑟(𝑟 Er 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑟𝑦 ↔ (𝐹‘𝑥) = (𝐹‘𝑦)))))
65	50, 52, 64	mp2ani 698	1 ⊢ (𝐴 ∈ 𝑉 → ∃𝑟(𝑟 Er 𝐴 ∧ ∀𝑥 ∈ 𝐴 ∀𝑦 ∈ 𝐴 (𝑥𝑟𝑦 ↔ (𝐹‘𝑥) = (𝐹‘𝑦))))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1537  ∃wex 1776   ∈ wcel 2106  ∀wral 3059  Vcvv 3478   class class class wbr 5148  {copab 5210  ‘cfv 6563   Er wer 8741

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-sb 2063  df-clab 2713  df-cleq 2727  df-clel 2814  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-iota 6516  df-fv 6571  df-er 8744

This theorem is referenced by:  tgjustc1  28498