Theorem erlval 33609

Description: Value of the ring localization equivalence relation. (Contributed by Thierry Arnoux, 4-May-2025.)

Hypotheses

Ref	Expression
rlocval.1	⊢ 𝐵 = (Base‘𝑅)
rlocval.2	⊢ 0 = (0g‘𝑅)
rlocval.3	⊢ · = (.r‘𝑅)
rlocval.4	⊢ − = (-g‘𝑅)
erlval.w	⊢ 𝑊 = (𝐵 × 𝑆)
erlval.q	⊢ ∼ = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ 𝑊) ∧ ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎)))) = 0 )}
erlval.20	⊢ (𝜑 → 𝑆 ⊆ 𝐵)

Assertion

Ref	Expression
erlval	⊢ (𝜑 → (𝑅 ~RL 𝑆) = ∼ )

Distinct variable groups:   · ,𝑎,𝑏,𝑡   𝑅,𝑎,𝑏,𝑡   𝑆,𝑎,𝑏,𝑡   𝑊,𝑎,𝑏,𝑡   𝜑,𝑎,𝑏

Allowed substitution hints:   𝜑(𝑡)   𝐵(𝑡, 𝑎, 𝑏)   ∼ (𝑡, 𝑎, 𝑏)   − (𝑡, 𝑎, 𝑏)   0 (𝑡, 𝑎, 𝑏)

Proof of Theorem erlval

Dummy variables 𝑤 𝑟 𝑠 𝑥 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpr 490	. . 3 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → 𝑅 ∈ V)
2		rlocval.1	. . . . . 6 ⊢ 𝐵 = (Base‘𝑅)
3	2	fvexi 6902	. . . . 5 ⊢ 𝐵 ∈ V
4	3	a1i 11	. . . 4 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → 𝐵 ∈ V)
5		erlval.20	. . . . 5 ⊢ (𝜑 → 𝑆 ⊆ 𝐵)
6	5	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → 𝑆 ⊆ 𝐵)
7	4, 6	ssexd 5300	. . 3 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → 𝑆 ∈ V)
8		erlval.q	. . . 4 ⊢ ∼ = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ 𝑊) ∧ ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎)))) = 0 )}
9		erlval.w	. . . . . . 7 ⊢ 𝑊 = (𝐵 × 𝑆)
10	4, 7	xpexd 7759	. . . . . . 7 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → (𝐵 × 𝑆) ∈ V)
11	9, 10	eqeltrid 2870	. . . . . 6 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → 𝑊 ∈ V)
12	11, 11	xpexd 7759	. . . . 5 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → (𝑊 × 𝑊) ∈ V)
13		simprll 791	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ 𝑊) ∧ ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎)))) = 0 )) → 𝑎 ∈ 𝑊)
14		simprlr 792	. . . . . . 7 ⊢ ((𝜑 ∧ ((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ 𝑊) ∧ ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎)))) = 0 )) → 𝑏 ∈ 𝑊)
15	13, 14	opabssxpd 5713	. . . . . 6 ⊢ (𝜑 → {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ 𝑊) ∧ ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎)))) = 0 )} ⊆ (𝑊 × 𝑊))
16	15	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ 𝑊) ∧ ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎)))) = 0 )} ⊆ (𝑊 × 𝑊))
17	12, 16	ssexd 5300	. . . 4 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ 𝑊) ∧ ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎)))) = 0 )} ∈ V)
18	8, 17	eqeltrid 2870	. . 3 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → ∼ ∈ V)
19		fvexd 6903	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → (.r‘𝑟) ∈ V)
20		fveq2 6888	. . . . . . 7 ⊢ (𝑟 = 𝑅 → (.r‘𝑟) = (.r‘𝑅))
21	20	adantr 486	. . . . . 6 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → (.r‘𝑟) = (.r‘𝑅))
22		rlocval.3	. . . . . 6 ⊢ · = (.r‘𝑅)
23	21, 22	eqtr4di 2819	. . . . 5 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → (.r‘𝑟) = · )
24		fvexd 6903	. . . . . . 7 ⊢ (((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) → (Base‘𝑟) ∈ V)
25		vex 3462	. . . . . . . 8 ⊢ 𝑠 ∈ V
26	25	a1i 11	. . . . . . 7 ⊢ (((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) → 𝑠 ∈ V)
27	24, 26	xpexd 7759	. . . . . 6 ⊢ (((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) → ((Base‘𝑟) × 𝑠) ∈ V)
28		fveq2 6888	. . . . . . . . . 10 ⊢ (𝑟 = 𝑅 → (Base‘𝑟) = (Base‘𝑅))
29	28	ad2antrr 739	. . . . . . . . 9 ⊢ (((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) → (Base‘𝑟) = (Base‘𝑅))
30	29, 2	eqtr4di 2819	. . . . . . . 8 ⊢ (((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) → (Base‘𝑟) = 𝐵)
31		simplr 781	. . . . . . . 8 ⊢ (((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) → 𝑠 = 𝑆)
32	30, 31	xpeq12d 5697	. . . . . . 7 ⊢ (((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) → ((Base‘𝑟) × 𝑠) = (𝐵 × 𝑆))
33	32, 9	eqtr4di 2819	. . . . . 6 ⊢ (((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) → ((Base‘𝑟) × 𝑠) = 𝑊)
34		simpr 490	. . . . . . . . . . 11 ⊢ ((((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) ∧ 𝑤 = 𝑊) → 𝑤 = 𝑊)
35	34	eleq2d 2852	. . . . . . . . . 10 ⊢ ((((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) ∧ 𝑤 = 𝑊) → (𝑎 ∈ 𝑤 ↔ 𝑎 ∈ 𝑊))
36	34	eleq2d 2852	. . . . . . . . . 10 ⊢ ((((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) ∧ 𝑤 = 𝑊) → (𝑏 ∈ 𝑤 ↔ 𝑏 ∈ 𝑊))
37	35, 36	anbi12d 644	. . . . . . . . 9 ⊢ ((((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) ∧ 𝑤 = 𝑊) → ((𝑎 ∈ 𝑤 ∧ 𝑏 ∈ 𝑤) ↔ (𝑎 ∈ 𝑊 ∧ 𝑏 ∈ 𝑊)))
38	31	adantr 486	. . . . . . . . . 10 ⊢ ((((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) ∧ 𝑤 = 𝑊) → 𝑠 = 𝑆)
39		simplr 781	. . . . . . . . . . . 12 ⊢ ((((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) ∧ 𝑤 = 𝑊) → 𝑥 = · )
40		eqidd 2767	. . . . . . . . . . . 12 ⊢ ((((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) ∧ 𝑤 = 𝑊) → 𝑡 = 𝑡)
41		fveq2 6888	. . . . . . . . . . . . . . 15 ⊢ (𝑟 = 𝑅 → (-g‘𝑟) = (-g‘𝑅))
42	41	ad3antrrr 743	. . . . . . . . . . . . . 14 ⊢ ((((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) ∧ 𝑤 = 𝑊) → (-g‘𝑟) = (-g‘𝑅))
43		rlocval.4	. . . . . . . . . . . . . 14 ⊢ − = (-g‘𝑅)
44	42, 43	eqtr4di 2819	. . . . . . . . . . . . 13 ⊢ ((((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) ∧ 𝑤 = 𝑊) → (-g‘𝑟) = − )
45	39	oveqd 7440	. . . . . . . . . . . . 13 ⊢ ((((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) ∧ 𝑤 = 𝑊) → ((1st ‘𝑎)𝑥(2nd ‘𝑏)) = ((1st ‘𝑎) · (2nd ‘𝑏)))
46	39	oveqd 7440	. . . . . . . . . . . . 13 ⊢ ((((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) ∧ 𝑤 = 𝑊) → ((1st ‘𝑏)𝑥(2nd ‘𝑎)) = ((1st ‘𝑏) · (2nd ‘𝑎)))
47	44, 45, 46	oveq123d 7444	. . . . . . . . . . . 12 ⊢ ((((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) ∧ 𝑤 = 𝑊) → (((1st ‘𝑎)𝑥(2nd ‘𝑏))(-g‘𝑟)((1st ‘𝑏)𝑥(2nd ‘𝑎))) = (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎))))
48	39, 40, 47	oveq123d 7444	. . . . . . . . . . 11 ⊢ ((((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) ∧ 𝑤 = 𝑊) → (𝑡𝑥(((1st ‘𝑎)𝑥(2nd ‘𝑏))(-g‘𝑟)((1st ‘𝑏)𝑥(2nd ‘𝑎)))) = (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎)))))
49		fveq2 6888	. . . . . . . . . . . . 13 ⊢ (𝑟 = 𝑅 → (0g‘𝑟) = (0g‘𝑅))
50	49	ad3antrrr 743	. . . . . . . . . . . 12 ⊢ ((((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) ∧ 𝑤 = 𝑊) → (0g‘𝑟) = (0g‘𝑅))
51		rlocval.2	. . . . . . . . . . . 12 ⊢ 0 = (0g‘𝑅)
52	50, 51	eqtr4di 2819	. . . . . . . . . . 11 ⊢ ((((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) ∧ 𝑤 = 𝑊) → (0g‘𝑟) = 0 )
53	48, 52	eqeq12d 2782	. . . . . . . . . 10 ⊢ ((((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) ∧ 𝑤 = 𝑊) → ((𝑡𝑥(((1st ‘𝑎)𝑥(2nd ‘𝑏))(-g‘𝑟)((1st ‘𝑏)𝑥(2nd ‘𝑎)))) = (0g‘𝑟) ↔ (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎)))) = 0 ))
54	38, 53	rexeqbidv 3342	. . . . . . . . 9 ⊢ ((((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) ∧ 𝑤 = 𝑊) → (∃𝑡 ∈ 𝑠 (𝑡𝑥(((1st ‘𝑎)𝑥(2nd ‘𝑏))(-g‘𝑟)((1st ‘𝑏)𝑥(2nd ‘𝑎)))) = (0g‘𝑟) ↔ ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎)))) = 0 ))
55	37, 54	anbi12d 644	. . . . . . . 8 ⊢ ((((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) ∧ 𝑤 = 𝑊) → (((𝑎 ∈ 𝑤 ∧ 𝑏 ∈ 𝑤) ∧ ∃𝑡 ∈ 𝑠 (𝑡𝑥(((1st ‘𝑎)𝑥(2nd ‘𝑏))(-g‘𝑟)((1st ‘𝑏)𝑥(2nd ‘𝑎)))) = (0g‘𝑟)) ↔ ((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ 𝑊) ∧ ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎)))) = 0 )))
56	55	opabbidv 5182	. . . . . . 7 ⊢ ((((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) ∧ 𝑤 = 𝑊) → {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑤 ∧ 𝑏 ∈ 𝑤) ∧ ∃𝑡 ∈ 𝑠 (𝑡𝑥(((1st ‘𝑎)𝑥(2nd ‘𝑏))(-g‘𝑟)((1st ‘𝑏)𝑥(2nd ‘𝑎)))) = (0g‘𝑟))} = {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑊 ∧ 𝑏 ∈ 𝑊) ∧ ∃𝑡 ∈ 𝑆 (𝑡 · (((1st ‘𝑎) · (2nd ‘𝑏)) − ((1st ‘𝑏) · (2nd ‘𝑎)))) = 0 )})
57	56, 8	eqtr4di 2819	. . . . . 6 ⊢ ((((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) ∧ 𝑤 = 𝑊) → {⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑤 ∧ 𝑏 ∈ 𝑤) ∧ ∃𝑡 ∈ 𝑠 (𝑡𝑥(((1st ‘𝑎)𝑥(2nd ‘𝑏))(-g‘𝑟)((1st ‘𝑏)𝑥(2nd ‘𝑎)))) = (0g‘𝑟))} = ∼ )
58	27, 33, 57	csbied2 3893	. . . . 5 ⊢ (((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) ∧ 𝑥 = · ) → ⦋((Base‘𝑟) × 𝑠) / 𝑤⦌{⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑤 ∧ 𝑏 ∈ 𝑤) ∧ ∃𝑡 ∈ 𝑠 (𝑡𝑥(((1st ‘𝑎)𝑥(2nd ‘𝑏))(-g‘𝑟)((1st ‘𝑏)𝑥(2nd ‘𝑎)))) = (0g‘𝑟))} = ∼ )
59	19, 23, 58	csbied2 3893	. . . 4 ⊢ ((𝑟 = 𝑅 ∧ 𝑠 = 𝑆) → ⦋(.r‘𝑟) / 𝑥⦌⦋((Base‘𝑟) × 𝑠) / 𝑤⦌{⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑤 ∧ 𝑏 ∈ 𝑤) ∧ ∃𝑡 ∈ 𝑠 (𝑡𝑥(((1st ‘𝑎)𝑥(2nd ‘𝑏))(-g‘𝑟)((1st ‘𝑏)𝑥(2nd ‘𝑎)))) = (0g‘𝑟))} = ∼ )
60		df-erl 33606	. . . 4 ⊢ ~RL = (𝑟 ∈ V, 𝑠 ∈ V ↦ ⦋(.r‘𝑟) / 𝑥⦌⦋((Base‘𝑟) × 𝑠) / 𝑤⦌{⟨𝑎, 𝑏⟩ ∣ ((𝑎 ∈ 𝑤 ∧ 𝑏 ∈ 𝑤) ∧ ∃𝑡 ∈ 𝑠 (𝑡𝑥(((1st ‘𝑎)𝑥(2nd ‘𝑏))(-g‘𝑟)((1st ‘𝑏)𝑥(2nd ‘𝑎)))) = (0g‘𝑟))})
61	59, 60	ovmpoga 7577	. . 3 ⊢ ((𝑅 ∈ V ∧ 𝑆 ∈ V ∧ ∼ ∈ V) → (𝑅 ~RL 𝑆) = ∼ )
62	1, 7, 18, 61	syl3anc 1398	. 2 ⊢ ((𝜑 ∧ 𝑅 ∈ V) → (𝑅 ~RL 𝑆) = ∼ )
63	60	reldmmpo 7557	. . . . 5 ⊢ Rel dom ~RL
64	63	ovprc1 7462	. . . 4 ⊢ (¬ 𝑅 ∈ V → (𝑅 ~RL 𝑆) = ∅)
65	64	adantl 487	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑅 ∈ V) → (𝑅 ~RL 𝑆) = ∅)
66	8, 15	eqsstrid 3978	. . . . . 6 ⊢ (𝜑 → ∼ ⊆ (𝑊 × 𝑊))
67	66	adantr 486	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝑅 ∈ V) → ∼ ⊆ (𝑊 × 𝑊))
68		fvprc 6880	. . . . . . . . . . 11 ⊢ (¬ 𝑅 ∈ V → (Base‘𝑅) = ∅)
69	2, 68	eqtrid 2813	. . . . . . . . . 10 ⊢ (¬ 𝑅 ∈ V → 𝐵 = ∅)
70	69	xpeq1d 5695	. . . . . . . . 9 ⊢ (¬ 𝑅 ∈ V → (𝐵 × 𝑆) = (∅ × 𝑆))
71		0xp 5765	. . . . . . . . 9 ⊢ (∅ × 𝑆) = ∅
72	70, 71	eqtrdi 2817	. . . . . . . 8 ⊢ (¬ 𝑅 ∈ V → (𝐵 × 𝑆) = ∅)
73	9, 72	eqtrid 2813	. . . . . . 7 ⊢ (¬ 𝑅 ∈ V → 𝑊 = ∅)
74		id 23	. . . . . . . . 9 ⊢ (𝑊 = ∅ → 𝑊 = ∅)
75	74, 74	xpeq12d 5697	. . . . . . . 8 ⊢ (𝑊 = ∅ → (𝑊 × 𝑊) = (∅ × ∅))
76		0xp 5765	. . . . . . . 8 ⊢ (∅ × ∅) = ∅
77	75, 76	eqtrdi 2817	. . . . . . 7 ⊢ (𝑊 = ∅ → (𝑊 × 𝑊) = ∅)
78	73, 77	syl 18	. . . . . 6 ⊢ (¬ 𝑅 ∈ V → (𝑊 × 𝑊) = ∅)
79	78	adantl 487	. . . . 5 ⊢ ((𝜑 ∧ ¬ 𝑅 ∈ V) → (𝑊 × 𝑊) = ∅)
80	67, 79	sseqtrd 3976	. . . 4 ⊢ ((𝜑 ∧ ¬ 𝑅 ∈ V) → ∼ ⊆ ∅)
81		ss0 4362	. . . 4 ⊢ ( ∼ ⊆ ∅ → ∼ = ∅)
82	80, 81	syl 18	. . 3 ⊢ ((𝜑 ∧ ¬ 𝑅 ∈ V) → ∼ = ∅)
83	65, 82	eqtr4d 2804	. 2 ⊢ ((𝜑 ∧ ¬ 𝑅 ∈ V) → (𝑅 ~RL 𝑆) = ∼ )
84	62, 83	pm2.61dan 825	1 ⊢ (𝜑 → (𝑅 ~RL 𝑆) = ∼ )

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∃wrex 3092  Vcvv 3458  ⦋csb 3856   ⊆ wss 3908  ∅c0 4289  {copab 5178   × cxp 5664  ‘cfv 6543  (class class class)co 7423  1^st c1st 7993  2^nd c2nd 7994  Basecbs 17294  ._rcmulr 17336  0_gc0g 17517  -_gcsg 19033   ~_RL cerl 33604

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-opab 5179  df-id 5561  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-iota 6499  df-fun 6545  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-erl 33606

This theorem is used by:  erlcl1  33611  erlcl2  33612  erldi  33613  erlbrd  33614  erler  33616  fracerl  33658