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 36002

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 35992	. . . . . . 7 ⊢ ( EqvRel 𝑅 → Rel 𝑅)
3	1, 2	syl 17	. . . . . 6 ⊢ (𝜑 → Rel 𝑅)
4		simpr 488	. . . . . 6 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐵𝑅𝐶)
5		brrelex1 5569	. . . . . 6 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐶) → 𝐵 ∈ V)
6	3, 4, 5	syl2an 598	. . . . 5 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐵 ∈ V)
7		simpr 488	. . . . 5 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶))
8		breq2 5034	. . . . . 6 ⊢ (𝑥 = 𝐵 → (𝐴𝑅𝑥 ↔ 𝐴𝑅𝐵))
9		breq1 5033	. . . . . 6 ⊢ (𝑥 = 𝐵 → (𝑥𝑅𝐶 ↔ 𝐵𝑅𝐶))
10	8, 9	anbi12d 633	. . . . 5 ⊢ (𝑥 = 𝐵 → ((𝐴𝑅𝑥 ∧ 𝑥𝑅𝐶) ↔ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)))
11	6, 7, 10	spcedv 3547	. . . 4 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥𝑅𝐶))
12		simpl 486	. . . . . 6 ⊢ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐵)
13		brrelex1 5569	. . . . . 6 ⊢ ((Rel 𝑅 ∧ 𝐴𝑅𝐵) → 𝐴 ∈ V)
14	3, 12, 13	syl2an 598	. . . . 5 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐴 ∈ V)
15		brrelex2 5570	. . . . . 6 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐶) → 𝐶 ∈ V)
16	3, 4, 15	syl2an 598	. . . . 5 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐶 ∈ V)
17		brcog 5701	. . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐶 ∈ V) → (𝐴(𝑅 ∘ 𝑅)𝐶 ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥𝑅𝐶)))
18	14, 16, 17	syl2anc 587	. . . 4 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → (𝐴(𝑅 ∘ 𝑅)𝐶 ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝑥𝑅𝐶)))
19	11, 18	mpbird 260	. . 3 ⊢ ((𝜑 ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐴(𝑅 ∘ 𝑅)𝐶)
20	19	ex 416	. 2 ⊢ (𝜑 → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴(𝑅 ∘ 𝑅)𝐶))
21		dfeqvrel2 35985	. . . . . 6 ⊢ ( EqvRel 𝑅 ↔ ((( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ^◡𝑅 ⊆ 𝑅 ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅) ∧ Rel 𝑅))
22	21	simplbi 501	. . . . 5 ⊢ ( EqvRel 𝑅 → (( I ↾ dom 𝑅) ⊆ 𝑅 ∧ ^◡𝑅 ⊆ 𝑅 ∧ (𝑅 ∘ 𝑅) ⊆ 𝑅))
23	22	simp3d 1141	. . . 4 ⊢ ( EqvRel 𝑅 → (𝑅 ∘ 𝑅) ⊆ 𝑅)
24	1, 23	syl 17	. . 3 ⊢ (𝜑 → (𝑅 ∘ 𝑅) ⊆ 𝑅)
25	24	ssbrd 5073	. 2 ⊢ (𝜑 → (𝐴(𝑅 ∘ 𝑅)𝐶 → 𝐴𝑅𝐶))
26	20, 25	syld 47	1 ⊢ (𝜑 → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 209 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∃wex 1781 ∈ wcel 2111 Vcvv 3441 ⊆ wss 3881 class class class wbr 5030 I cid 5424 ^◡ccnv 5518 dom cdm 5519 ↾ cres 5521 ∘ ccom 5523 Rel wrel 5524 EqvRel weqvrel 35630

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-sep 5167 ax-nul 5174 ax-pr 5295

This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ral 3111 df-rex 3112 df-rab 3115 df-v 3443 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-sn 4526 df-pr 4528 df-op 4532 df-br 5031 df-opab 5093 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-refrel 35912 df-symrel 35940 df-trrel 35970 df-eqvrel 35980

This theorem is referenced by: eqvreltrd 36003 eqvrelth 36006

W3C validator