Theorem dirtr 18826

Description: A direction is transitive. (Contributed by Jeff Hankins, 25-Nov-2009.) (Revised by Mario Carneiro, 22-Nov-2013.)

Assertion

Ref	Expression
dirtr	⊢ (((𝑅 ∈ DirRel ∧ 𝐶 ∈ 𝑉) ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐴𝑅𝐶)

Proof of Theorem dirtr

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		reldir 18823	. . . . 5 ⊢ (𝑅 ∈ DirRel → Rel 𝑅)
2		brrelex1 5711	. . . . . . 7 ⊢ ((Rel 𝑅 ∧ 𝐴𝑅𝐵) → 𝐴 ∈ V)
3	2	ex 418	. . . . . 6 ⊢ (Rel 𝑅 → (𝐴𝑅𝐵 → 𝐴 ∈ V))
4		brrelex1 5711	. . . . . . 7 ⊢ ((Rel 𝑅 ∧ 𝐵𝑅𝐶) → 𝐵 ∈ V)
5	4	ex 418	. . . . . 6 ⊢ (Rel 𝑅 → (𝐵𝑅𝐶 → 𝐵 ∈ V))
6	3, 5	anim12d 621	. . . . 5 ⊢ (Rel 𝑅 → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → (𝐴 ∈ V ∧ 𝐵 ∈ V)))
7	1, 6	syl 18	. . . 4 ⊢ (𝑅 ∈ DirRel → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → (𝐴 ∈ V ∧ 𝐵 ∈ V)))
8		eqid 2763	. . . . . . . . . . 11 ⊢ ∪ ∪ 𝑅 = ∪ ∪ 𝑅
9	8	isdir 18822	. . . . . . . . . 10 ⊢ (𝑅 ∈ DirRel → (𝑅 ∈ DirRel ↔ ((Rel 𝑅 ∧ ( I ↾ ∪ ∪ 𝑅) ⊆ 𝑅) ∧ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ∧ (∪ ∪ 𝑅 × ∪ ∪ 𝑅) ⊆ (◡𝑅 ∘ 𝑅)))))
10	9	ibi 270	. . . . . . . . 9 ⊢ (𝑅 ∈ DirRel → ((Rel 𝑅 ∧ ( I ↾ ∪ ∪ 𝑅) ⊆ 𝑅) ∧ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ∧ (∪ ∪ 𝑅 × ∪ ∪ 𝑅) ⊆ (◡𝑅 ∘ 𝑅))))
11	10	simprld 784	. . . . . . . 8 ⊢ (𝑅 ∈ DirRel → (𝑅 ∘ 𝑅) ⊆ 𝑅)
12		cotr 6124	. . . . . . . 8 ⊢ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ↔ ∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
13	11, 12	sylib 221	. . . . . . 7 ⊢ (𝑅 ∈ DirRel → ∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧))
14		breq12 5113	. . . . . . . . . . 11 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵) → (𝑥𝑅𝑦 ↔ 𝐴𝑅𝐵))
15	14	3adant3 1150	. . . . . . . . . 10 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝑥𝑅𝑦 ↔ 𝐴𝑅𝐵))
16		breq12 5113	. . . . . . . . . . 11 ⊢ ((𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝑦𝑅𝑧 ↔ 𝐵𝑅𝐶))
17	16	3adant1 1148	. . . . . . . . . 10 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝑦𝑅𝑧 ↔ 𝐵𝑅𝐶))
18	15, 17	anbi12d 644	. . . . . . . . 9 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → ((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) ↔ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)))
19		breq12 5113	. . . . . . . . . 10 ⊢ ((𝑥 = 𝐴 ∧ 𝑧 = 𝐶) → (𝑥𝑅𝑧 ↔ 𝐴𝑅𝐶))
20	19	3adant2 1149	. . . . . . . . 9 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (𝑥𝑅𝑧 ↔ 𝐴𝑅𝐶))
21	18, 20	imbi12d 347	. . . . . . . 8 ⊢ ((𝑥 = 𝐴 ∧ 𝑦 = 𝐵 ∧ 𝑧 = 𝐶) → (((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧) ↔ ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶)))
22	21	spc3gv 3562	. . . . . . 7 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ 𝑉) → (∀𝑥∀𝑦∀𝑧((𝑥𝑅𝑦 ∧ 𝑦𝑅𝑧) → 𝑥𝑅𝑧) → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶)))
23	13, 22	syl5 35	. . . . . 6 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V ∧ 𝐶 ∈ 𝑉) → (𝑅 ∈ DirRel → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶)))
24	23	3expia 1139	. . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐶 ∈ 𝑉 → (𝑅 ∈ DirRel → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → 𝐴𝑅𝐶))))
25	24	com4t 94	. . . 4 ⊢ (𝑅 ∈ DirRel → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐶 ∈ 𝑉 → 𝐴𝑅𝐶))))
26	7, 25	mpdd 44	. . 3 ⊢ (𝑅 ∈ DirRel → ((𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶) → (𝐶 ∈ 𝑉 → 𝐴𝑅𝐶)))
27	26	imp31 423	. 2 ⊢ (((𝑅 ∈ DirRel ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) ∧ 𝐶 ∈ 𝑉) → 𝐴𝑅𝐶)
28	27	an32s 665	1 ⊢ (((𝑅 ∈ DirRel ∧ 𝐶 ∈ 𝑉) ∧ (𝐴𝑅𝐵 ∧ 𝐵𝑅𝐶)) → 𝐴𝑅𝐶)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103  ∀wal 1568   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900  ∪ cuni 4872   class class class wbr 5108   I cid 5552   × cxp 5656  ^◡ccnv 5657   ↾ cres 5660   ∘ ccom 5662  Rel wrel 5663  DirRelcdir 18818

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-sep 5255  ax-pr 5398

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-res 5670  df-dir 18820

This theorem is used by:  tailfb  37380