Theorem dirge 18660

Description: For any two elements of a directed set, there exists a third element greater than or equal to both. Note that this does not say that the two elements have a least upper bound. (Contributed by Jeff Hankins, 25-Nov-2009.) (Revised by Mario Carneiro, 22-Nov-2013.)

Hypothesis

Ref	Expression
dirge.1	⊢ 𝑋 = dom 𝑅

Assertion

Ref	Expression
dirge	⊢ ((𝑅 ∈ DirRel ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ∃𝑥 ∈ 𝑋 (𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥))

Distinct variable groups:   𝑥,𝐴   𝑥,𝐵   𝑥,𝑅   𝑥,𝑋

Proof of Theorem dirge

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

Step	Hyp	Ref	Expression
1		dirge.1	. . . . . . 7 ⊢ 𝑋 = dom 𝑅
2		dirdm 18657	. . . . . . 7 ⊢ (𝑅 ∈ DirRel → dom 𝑅 = ∪ ∪ 𝑅)
3	1, 2	eqtrid 2786	. . . . . 6 ⊢ (𝑅 ∈ DirRel → 𝑋 = ∪ ∪ 𝑅)
4	3	eleq2d 2824	. . . . 5 ⊢ (𝑅 ∈ DirRel → (𝐴 ∈ 𝑋 ↔ 𝐴 ∈ ∪ ∪ 𝑅))
5	3	eleq2d 2824	. . . . 5 ⊢ (𝑅 ∈ DirRel → (𝐵 ∈ 𝑋 ↔ 𝐵 ∈ ∪ ∪ 𝑅))
6	4, 5	anbi12d 632	. . . 4 ⊢ (𝑅 ∈ DirRel → ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ↔ (𝐴 ∈ ∪ ∪ 𝑅 ∧ 𝐵 ∈ ∪ ∪ 𝑅)))
7		eqid 2734	. . . . . . . . 9 ⊢ ∪ ∪ 𝑅 = ∪ ∪ 𝑅
8	7	isdir 18655	. . . . . . . 8 ⊢ (𝑅 ∈ DirRel → (𝑅 ∈ DirRel ↔ ((Rel 𝑅 ∧ ( I ↾ ∪ ∪ 𝑅) ⊆ 𝑅) ∧ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ∧ (∪ ∪ 𝑅 × ∪ ∪ 𝑅) ⊆ (◡𝑅 ∘ 𝑅)))))
9	8	ibi 267	. . . . . . 7 ⊢ (𝑅 ∈ DirRel → ((Rel 𝑅 ∧ ( I ↾ ∪ ∪ 𝑅) ⊆ 𝑅) ∧ ((𝑅 ∘ 𝑅) ⊆ 𝑅 ∧ (∪ ∪ 𝑅 × ∪ ∪ 𝑅) ⊆ (◡𝑅 ∘ 𝑅))))
10	9	simprrd 774	. . . . . 6 ⊢ (𝑅 ∈ DirRel → (∪ ∪ 𝑅 × ∪ ∪ 𝑅) ⊆ (◡𝑅 ∘ 𝑅))
11		codir 6142	. . . . . 6 ⊢ ((∪ ∪ 𝑅 × ∪ ∪ 𝑅) ⊆ (◡𝑅 ∘ 𝑅) ↔ ∀𝑦 ∈ ∪ ∪ 𝑅∀𝑧 ∈ ∪ ∪ 𝑅∃𝑥(𝑦𝑅𝑥 ∧ 𝑧𝑅𝑥))
12	10, 11	sylib 218	. . . . 5 ⊢ (𝑅 ∈ DirRel → ∀𝑦 ∈ ∪ ∪ 𝑅∀𝑧 ∈ ∪ ∪ 𝑅∃𝑥(𝑦𝑅𝑥 ∧ 𝑧𝑅𝑥))
13		breq1 5150	. . . . . . . 8 ⊢ (𝑦 = 𝐴 → (𝑦𝑅𝑥 ↔ 𝐴𝑅𝑥))
14	13	anbi1d 631	. . . . . . 7 ⊢ (𝑦 = 𝐴 → ((𝑦𝑅𝑥 ∧ 𝑧𝑅𝑥) ↔ (𝐴𝑅𝑥 ∧ 𝑧𝑅𝑥)))
15	14	exbidv 1918	. . . . . 6 ⊢ (𝑦 = 𝐴 → (∃𝑥(𝑦𝑅𝑥 ∧ 𝑧𝑅𝑥) ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝑧𝑅𝑥)))
16		breq1 5150	. . . . . . . 8 ⊢ (𝑧 = 𝐵 → (𝑧𝑅𝑥 ↔ 𝐵𝑅𝑥))
17	16	anbi2d 630	. . . . . . 7 ⊢ (𝑧 = 𝐵 → ((𝐴𝑅𝑥 ∧ 𝑧𝑅𝑥) ↔ (𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥)))
18	17	exbidv 1918	. . . . . 6 ⊢ (𝑧 = 𝐵 → (∃𝑥(𝐴𝑅𝑥 ∧ 𝑧𝑅𝑥) ↔ ∃𝑥(𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥)))
19	15, 18	rspc2v 3632	. . . . 5 ⊢ ((𝐴 ∈ ∪ ∪ 𝑅 ∧ 𝐵 ∈ ∪ ∪ 𝑅) → (∀𝑦 ∈ ∪ ∪ 𝑅∀𝑧 ∈ ∪ ∪ 𝑅∃𝑥(𝑦𝑅𝑥 ∧ 𝑧𝑅𝑥) → ∃𝑥(𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥)))
20	12, 19	syl5com 31	. . . 4 ⊢ (𝑅 ∈ DirRel → ((𝐴 ∈ ∪ ∪ 𝑅 ∧ 𝐵 ∈ ∪ ∪ 𝑅) → ∃𝑥(𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥)))
21	6, 20	sylbid 240	. . 3 ⊢ (𝑅 ∈ DirRel → ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ∃𝑥(𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥)))
22		reldir 18656	. . . . . . . . . 10 ⊢ (𝑅 ∈ DirRel → Rel 𝑅)
23		relelrn 5958	. . . . . . . . . 10 ⊢ ((Rel 𝑅 ∧ 𝐴𝑅𝑥) → 𝑥 ∈ ran 𝑅)
24	22, 23	sylan 580	. . . . . . . . 9 ⊢ ((𝑅 ∈ DirRel ∧ 𝐴𝑅𝑥) → 𝑥 ∈ ran 𝑅)
25	24	ex 412	. . . . . . . 8 ⊢ (𝑅 ∈ DirRel → (𝐴𝑅𝑥 → 𝑥 ∈ ran 𝑅))
26		ssun2 4188	. . . . . . . . . . 11 ⊢ ran 𝑅 ⊆ (dom 𝑅 ∪ ran 𝑅)
27		dmrnssfld 5986	. . . . . . . . . . 11 ⊢ (dom 𝑅 ∪ ran 𝑅) ⊆ ∪ ∪ 𝑅
28	26, 27	sstri 4004	. . . . . . . . . 10 ⊢ ran 𝑅 ⊆ ∪ ∪ 𝑅
29	28, 3	sseqtrrid 4048	. . . . . . . . 9 ⊢ (𝑅 ∈ DirRel → ran 𝑅 ⊆ 𝑋)
30	29	sseld 3993	. . . . . . . 8 ⊢ (𝑅 ∈ DirRel → (𝑥 ∈ ran 𝑅 → 𝑥 ∈ 𝑋))
31	25, 30	syld 47	. . . . . . 7 ⊢ (𝑅 ∈ DirRel → (𝐴𝑅𝑥 → 𝑥 ∈ 𝑋))
32	31	adantrd 491	. . . . . 6 ⊢ (𝑅 ∈ DirRel → ((𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥) → 𝑥 ∈ 𝑋))
33	32	ancrd 551	. . . . 5 ⊢ (𝑅 ∈ DirRel → ((𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥) → (𝑥 ∈ 𝑋 ∧ (𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥))))
34	33	eximdv 1914	. . . 4 ⊢ (𝑅 ∈ DirRel → (∃𝑥(𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥) → ∃𝑥(𝑥 ∈ 𝑋 ∧ (𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥))))
35		df-rex 3068	. . . 4 ⊢ (∃𝑥 ∈ 𝑋 (𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥) ↔ ∃𝑥(𝑥 ∈ 𝑋 ∧ (𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥)))
36	34, 35	imbitrrdi 252	. . 3 ⊢ (𝑅 ∈ DirRel → (∃𝑥(𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥) → ∃𝑥 ∈ 𝑋 (𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥)))
37	21, 36	syld 47	. 2 ⊢ (𝑅 ∈ DirRel → ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ∃𝑥 ∈ 𝑋 (𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥)))
38	37	3impib 1115	1 ⊢ ((𝑅 ∈ DirRel ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ∃𝑥 ∈ 𝑋 (𝐴𝑅𝑥 ∧ 𝐵𝑅𝑥))

Syntax hints:   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1536  ∃wex 1775   ∈ wcel 2105  ∀wral 3058  ∃wrex 3067   ∪ cun 3960   ⊆ wss 3962  ∪ cuni 4911   class class class wbr 5147   I cid 5581   × cxp 5686  ^◡ccnv 5687  dom cdm 5688  ran crn 5689   ↾ cres 5690   ∘ ccom 5692  Rel wrel 5693  DirRelcdir 18651

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1791  ax-4 1805  ax-5 1907  ax-6 1964  ax-7 2004  ax-8 2107  ax-9 2115  ax-ext 2705  ax-sep 5301  ax-nul 5311  ax-pr 5437

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1539  df-fal 1549  df-ex 1776  df-sb 2062  df-clab 2712  df-cleq 2726  df-clel 2813  df-ral 3059  df-rex 3068  df-rab 3433  df-v 3479  df-dif 3965  df-un 3967  df-in 3969  df-ss 3979  df-nul 4339  df-if 4531  df-sn 4631  df-pr 4633  df-op 4637  df-uni 4912  df-br 5148  df-opab 5210  df-id 5582  df-xp 5694  df-rel 5695  df-cnv 5696  df-co 5697  df-dm 5698  df-rn 5699  df-res 5700  df-dir 18653

This theorem is referenced by:  tailfb  36359