eqvreltr - Mathbox for Peter Mazsa

	Mathbox for Peter Mazsa		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > eqvreltr		Structured version Visualization version GIF version

Theorem eqvreltr 35834

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 35824	. . . . . . 7 ⊢ ( EqvRel 𝑅 → Rel 𝑅)
3	1, 2	syl 17	. . . . . 6 ⊢ (𝜑 → Rel 𝑅)
4		simpr 487	. . . . . 6 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐵𝑅𝐶)
5		brrelex1 5598	. . . . . 6 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐶) → 𝐵 ∈ V)
6	3, 4, 5	syl2an 597	. . . . 5 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐵 ∈ V)
7		simpr 487	. . . . 5 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶))
8		breq2 5061	. . . . . 6 ⊢ (𝑥 = 𝐵 → (𝐴𝑅𝑥 ↔ 𝐴𝑅𝐵))
9		breq1 5060	. . . . . 6 ⊢ (𝑥 = 𝐵 → (𝑥𝑅𝐶 ↔ 𝐵𝑅𝐶))
10	8, 9	anbi12d 632	. . . . 5 ⊢ (𝑥 = 𝐵 → ((𝐴𝑅𝑥 ∧ 𝑥𝑅𝐶) ↔ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)))
11	6, 7, 10	spcedv 3597	. . . 4 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥𝑅𝐶))
12		simpl 485	. . . . . 6 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐵)
13		brrelex1 5598	. . . . . 6 ⊢ ((Rel 𝑅 ∧ 𝐴𝑅𝐵) → 𝐴 ∈ V)
14	3, 12, 13	syl2an 597	. . . . 5 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐴 ∈ V)
15		brrelex2 5599	. . . . . 6 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐶) → 𝐶 ∈ V)
16	3, 4, 15	syl2an 597	. . . . 5 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐶 ∈ V)
17		brcog 5730	. . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐶 ∈ V) → (𝐴(𝑅 ∘ 𝑅)𝐶 ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥𝑅𝐶)))
18	14, 16, 17	syl2anc 586	. . . 4 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → (𝐴(𝑅 ∘ 𝑅)𝐶 ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥𝑅𝐶)))
19	11, 18	mpbird 259	. . 3 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐴(𝑅 ∘ 𝑅)𝐶)
20	19	ex 415	. 2 ⊢ (𝜑 → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴(𝑅 ∘ 𝑅)𝐶))
21		dfeqvrel2 35817	. . . . . 6 ⊢ ( EqvRel 𝑅 ↔ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ^◡𝑅 ⊆ 𝑅 ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅) ∧ Rel 𝑅))
22	21	simplbi 500	. . . . 5 ⊢ ( EqvRel 𝑅 → (( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ^◡𝑅 ⊆ 𝑅 ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅))
23	22	simp3d 1139	. . . 4 ⊢ ( EqvRel 𝑅 → (𝑅 ∘ 𝑅) ⊆ 𝑅)
24	1, 23	syl 17	. . 3 ⊢ (𝜑 → (𝑅 ∘ 𝑅) ⊆ 𝑅)
25	24	ssbrd 5100	. 2 ⊢ (𝜑 → (𝐴(𝑅 ∘ 𝑅)𝐶 → 𝐴𝑅𝐶))
26	20, 25	syld 47	1 ⊢ (𝜑 → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 ∧ w3a 1082 = wceq 1531 ∃wex 1774 ∈ wcel 2108 Vcvv 3493 ⊆ wss 3934 class class class wbr 5057 I cid 5452 ^◡ccnv 5547 dom cdm 5548 ↾ cres 5550 ∘ ccom 5552 Rel wrel 5553 EqvRel weqvrel 35462

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1905 ax-6 1964 ax-7 2009 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2154 ax-12 2170 ax-ext 2791 ax-sep 5194 ax-nul 5201 ax-pr 5320

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1084 df-tru 1534 df-ex 1775 df-nf 1779 df-sb 2064 df-mo 2616 df-eu 2648 df-clab 2798 df-cleq 2812 df-clel 2891 df-nfc 2961 df-ral 3141 df-rex 3142 df-rab 3145 df-v 3495 df-dif 3937 df-un 3939 df-in 3941 df-ss 3950 df-nul 4290 df-if 4466 df-sn 4560 df-pr 4562 df-op 4566 df-br 5058 df-opab 5120 df-id 5453 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-refrel 35744 df-symrel 35772 df-trrel 35802 df-eqvrel 35812

This theorem is referenced by: eqvreltrd 35835 eqvrelth 35838

W3C validator