Theorem eqvreltr 39426

Description: An equivalence relation is transitive. (Contributed by NM, 4-Jun-1995.) (Revised by Mario Carneiro, 12-Aug-2015.) (Revised by Peter Mazsa, 2-Jun-2019.)

Hypothesis

Ref	Expression
eqvreltr.1	⊢ (𝜑 → EqvRel 𝑅)

Assertion

Ref	Expression
eqvreltr	⊢ (𝜑 → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶))

Proof of Theorem eqvreltr

Dummy variable 𝑥 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqvreltr.1	. . . . . . 7 ⊢ (𝜑 → EqvRel 𝑅)
2		eqvrelrel 39416	. . . . . . 7 ⊢ ( EqvRel 𝑅 → Rel 𝑅)
3	1, 2	syl 18	. . . . . 6 ⊢ (𝜑 → Rel 𝑅)
4		simpr 490	. . . . . 6 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐵𝑅𝐶)
5		brrelex1 5712	. . . . . 6 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐶) → 𝐵 ∈ V)
6	3, 4, 5	syl2an 608	. . . . 5 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐵 ∈ V)
7		simpr 490	. . . . 5 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶))
8		breq2 5111	. . . . . 6 ⊢ (𝑥 = 𝐵 → (𝐴𝑅𝑥 ↔ 𝐴𝑅𝐵))
9		breq1 5110	. . . . . 6 ⊢ (𝑥 = 𝐵 → (𝑥𝑅𝐶 ↔ 𝐵𝑅𝐶))
10	8, 9	anbi12d 644	. . . . 5 ⊢ (𝑥 = 𝐵 → ((𝐴𝑅𝑥 ∧ 𝑥𝑅𝐶) ↔ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)))
11	6, 7, 10	spcedv 3555	. . . 4 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥𝑅𝐶))
12		simpl 488	. . . . . 6 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐵)
13		brrelex1 5712	. . . . . 6 ⊢ ((Rel 𝑅 ∧ 𝐴𝑅𝐵) → 𝐴 ∈ V)
14	3, 12, 13	syl2an 608	. . . . 5 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐴 ∈ V)
15		brrelex2 5713	. . . . . 6 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐶) → 𝐶 ∈ V)
16	3, 4, 15	syl2an 608	. . . . 5 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐶 ∈ V)
17		brcog 5850	. . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐶 ∈ V) → (𝐴(𝑅 ∘ 𝑅)𝐶 ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥𝑅𝐶)))
18	14, 16, 17	syl2anc 596	. . . 4 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → (𝐴(𝑅 ∘ 𝑅)𝐶 ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥𝑅𝐶)))
19	11, 18	mpbird 260	. . 3 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐴(𝑅 ∘ 𝑅)𝐶)
20	19	ex 418	. 2 ⊢ (𝜑 → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴(𝑅 ∘ 𝑅)𝐶))
21		dfeqvrel2 39409	. . . . . 6 ⊢ ( EqvRel 𝑅 ↔ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅 ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅) ∧ Rel 𝑅))
22	21	simplbi 502	. . . . 5 ⊢ ( EqvRel 𝑅 → (( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ◡𝑅 ⊆ 𝑅 ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅))
23	22	simp3d 1162	. . . 4 ⊢ ( EqvRel 𝑅 → (𝑅 ∘ 𝑅) ⊆ 𝑅)
24	1, 23	syl 18	. . 3 ⊢ (𝜑 → (𝑅 ∘ 𝑅) ⊆ 𝑅)
25	24	ssbrd 5152	. 2 ⊢ (𝜑 → (𝐴(𝑅 ∘ 𝑅)𝐶 → 𝐴𝑅𝐶))
26	20, 25	syld 48	1 ⊢ (𝜑 → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2145  Vcvv 3453   ⊆ wss 3902   class class class wbr 5107   I cid 5553  ^◡ccnv 5658  dom cdm 5659   ↾ cres 5661   ∘ ccom 5663  Rel wrel 5664   EqvRel weqvrel 38935

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 2147  ax-9 2155  ax-ext 2734  ax-sep 5255  ax-pr 5402

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-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-refrel 39327  df-symrel 39359  df-trrel 39393  df-eqvrel 39404

This theorem is used by:  eqvreltrd  39427  eqvrelth  39430