MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dirge Structured version   Visualization version   GIF version

Theorem dirge 17284
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.
StepHypRef Expression
1 dirge.1 . . . . . . 7 𝑋 = dom 𝑅
2 dirdm 17281 . . . . . . 7 (𝑅 ∈ DirRel → dom 𝑅 = 𝑅)
31, 2syl5eq 2697 . . . . . 6 (𝑅 ∈ DirRel → 𝑋 = 𝑅)
43eleq2d 2716 . . . . 5 (𝑅 ∈ DirRel → (𝐴𝑋𝐴 𝑅))
53eleq2d 2716 . . . . 5 (𝑅 ∈ DirRel → (𝐵𝑋𝐵 𝑅))
64, 5anbi12d 747 . . . 4 (𝑅 ∈ DirRel → ((𝐴𝑋𝐵𝑋) ↔ (𝐴 𝑅𝐵 𝑅)))
7 eqid 2651 . . . . . . . . 9 𝑅 = 𝑅
87isdir 17279 . . . . . . . 8 (𝑅 ∈ DirRel → (𝑅 ∈ DirRel ↔ ((Rel 𝑅 ∧ ( I ↾ 𝑅) ⊆ 𝑅) ∧ ((𝑅𝑅) ⊆ 𝑅 ∧ ( 𝑅 × 𝑅) ⊆ (𝑅𝑅)))))
98ibi 256 . . . . . . 7 (𝑅 ∈ DirRel → ((Rel 𝑅 ∧ ( I ↾ 𝑅) ⊆ 𝑅) ∧ ((𝑅𝑅) ⊆ 𝑅 ∧ ( 𝑅 × 𝑅) ⊆ (𝑅𝑅))))
109simprrd 812 . . . . . 6 (𝑅 ∈ DirRel → ( 𝑅 × 𝑅) ⊆ (𝑅𝑅))
11 codir 5551 . . . . . 6 (( 𝑅 × 𝑅) ⊆ (𝑅𝑅) ↔ ∀𝑦 𝑅𝑧 𝑅𝑥(𝑦𝑅𝑥𝑧𝑅𝑥))
1210, 11sylib 208 . . . . 5 (𝑅 ∈ DirRel → ∀𝑦 𝑅𝑧 𝑅𝑥(𝑦𝑅𝑥𝑧𝑅𝑥))
13 breq1 4688 . . . . . . . 8 (𝑦 = 𝐴 → (𝑦𝑅𝑥𝐴𝑅𝑥))
1413anbi1d 741 . . . . . . 7 (𝑦 = 𝐴 → ((𝑦𝑅𝑥𝑧𝑅𝑥) ↔ (𝐴𝑅𝑥𝑧𝑅𝑥)))
1514exbidv 1890 . . . . . 6 (𝑦 = 𝐴 → (∃𝑥(𝑦𝑅𝑥𝑧𝑅𝑥) ↔ ∃𝑥(𝐴𝑅𝑥𝑧𝑅𝑥)))
16 breq1 4688 . . . . . . . 8 (𝑧 = 𝐵 → (𝑧𝑅𝑥𝐵𝑅𝑥))
1716anbi2d 740 . . . . . . 7 (𝑧 = 𝐵 → ((𝐴𝑅𝑥𝑧𝑅𝑥) ↔ (𝐴𝑅𝑥𝐵𝑅𝑥)))
1817exbidv 1890 . . . . . 6 (𝑧 = 𝐵 → (∃𝑥(𝐴𝑅𝑥𝑧𝑅𝑥) ↔ ∃𝑥(𝐴𝑅𝑥𝐵𝑅𝑥)))
1915, 18rspc2v 3353 . . . . 5 ((𝐴 𝑅𝐵 𝑅) → (∀𝑦 𝑅𝑧 𝑅𝑥(𝑦𝑅𝑥𝑧𝑅𝑥) → ∃𝑥(𝐴𝑅𝑥𝐵𝑅𝑥)))
2012, 19syl5com 31 . . . 4 (𝑅 ∈ DirRel → ((𝐴 𝑅𝐵 𝑅) → ∃𝑥(𝐴𝑅𝑥𝐵𝑅𝑥)))
216, 20sylbid 230 . . 3 (𝑅 ∈ DirRel → ((𝐴𝑋𝐵𝑋) → ∃𝑥(𝐴𝑅𝑥𝐵𝑅𝑥)))
22 reldir 17280 . . . . . . . . . 10 (𝑅 ∈ DirRel → Rel 𝑅)
23 relelrn 5391 . . . . . . . . . 10 ((Rel 𝑅𝐴𝑅𝑥) → 𝑥 ∈ ran 𝑅)
2422, 23sylan 487 . . . . . . . . 9 ((𝑅 ∈ DirRel ∧ 𝐴𝑅𝑥) → 𝑥 ∈ ran 𝑅)
2524ex 449 . . . . . . . 8 (𝑅 ∈ DirRel → (𝐴𝑅𝑥𝑥 ∈ ran 𝑅))
26 ssun2 3810 . . . . . . . . . . 11 ran 𝑅 ⊆ (dom 𝑅 ∪ ran 𝑅)
27 dmrnssfld 5416 . . . . . . . . . . 11 (dom 𝑅 ∪ ran 𝑅) ⊆ 𝑅
2826, 27sstri 3645 . . . . . . . . . 10 ran 𝑅 𝑅
2928, 3syl5sseqr 3687 . . . . . . . . 9 (𝑅 ∈ DirRel → ran 𝑅𝑋)
3029sseld 3635 . . . . . . . 8 (𝑅 ∈ DirRel → (𝑥 ∈ ran 𝑅𝑥𝑋))
3125, 30syld 47 . . . . . . 7 (𝑅 ∈ DirRel → (𝐴𝑅𝑥𝑥𝑋))
3231adantrd 483 . . . . . 6 (𝑅 ∈ DirRel → ((𝐴𝑅𝑥𝐵𝑅𝑥) → 𝑥𝑋))
3332ancrd 576 . . . . 5 (𝑅 ∈ DirRel → ((𝐴𝑅𝑥𝐵𝑅𝑥) → (𝑥𝑋 ∧ (𝐴𝑅𝑥𝐵𝑅𝑥))))
3433eximdv 1886 . . . 4 (𝑅 ∈ DirRel → (∃𝑥(𝐴𝑅𝑥𝐵𝑅𝑥) → ∃𝑥(𝑥𝑋 ∧ (𝐴𝑅𝑥𝐵𝑅𝑥))))
35 df-rex 2947 . . . 4 (∃𝑥𝑋 (𝐴𝑅𝑥𝐵𝑅𝑥) ↔ ∃𝑥(𝑥𝑋 ∧ (𝐴𝑅𝑥𝐵𝑅𝑥)))
3634, 35syl6ibr 242 . . 3 (𝑅 ∈ DirRel → (∃𝑥(𝐴𝑅𝑥𝐵𝑅𝑥) → ∃𝑥𝑋 (𝐴𝑅𝑥𝐵𝑅𝑥)))
3721, 36syld 47 . 2 (𝑅 ∈ DirRel → ((𝐴𝑋𝐵𝑋) → ∃𝑥𝑋 (𝐴𝑅𝑥𝐵𝑅𝑥)))
38373impib 1281 1 ((𝑅 ∈ DirRel ∧ 𝐴𝑋𝐵𝑋) → ∃𝑥𝑋 (𝐴𝑅𝑥𝐵𝑅𝑥))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 383  w3a 1054   = wceq 1523  wex 1744  wcel 2030  wral 2941  wrex 2942  cun 3605  wss 3607   cuni 4468   class class class wbr 4685   I cid 5052   × cxp 5141  ccnv 5142  dom cdm 5143  ran crn 5144  cres 5145  ccom 5147  Rel wrel 5148  DirRelcdir 17275
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1762  ax-4 1777  ax-5 1879  ax-6 1945  ax-7 1981  ax-9 2039  ax-10 2059  ax-11 2074  ax-12 2087  ax-13 2282  ax-ext 2631  ax-sep 4814  ax-nul 4822  ax-pr 4936
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3an 1056  df-tru 1526  df-ex 1745  df-nf 1750  df-sb 1938  df-eu 2502  df-mo 2503  df-clab 2638  df-cleq 2644  df-clel 2647  df-nfc 2782  df-ral 2946  df-rex 2947  df-rab 2950  df-v 3233  df-dif 3610  df-un 3612  df-in 3614  df-ss 3621  df-nul 3949  df-if 4120  df-sn 4211  df-pr 4213  df-op 4217  df-uni 4469  df-br 4686  df-opab 4746  df-id 5053  df-xp 5149  df-rel 5150  df-cnv 5151  df-co 5152  df-dm 5153  df-rn 5154  df-res 5155  df-dir 17277
This theorem is referenced by:  tailfb  32497
  Copyright terms: Public domain W3C validator