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

Theorem lrrecpo 27951
Description: Now, we establish that 𝑅 is a partial ordering on No . (Contributed by Scott Fenton, 19-Aug-2024.)
Hypothesis
Ref Expression
lrrec.1 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}
Assertion
Ref Expression
lrrecpo 𝑅 Po No
Distinct variable group:   𝑥,𝑦
Allowed substitution hints:   𝑅(𝑥,𝑦)

Proof of Theorem lrrecpo
Dummy variables 𝑎 𝑏 𝑐 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 bdayon 27762 . . . . . 6 ( bday 𝑎) ∈ On
21onirri 6424 . . . . 5 ¬ ( bday 𝑎) ∈ ( bday 𝑎)
3 lrrec.1 . . . . . . 7 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}
43lrrecval2 27950 . . . . . 6 ((𝑎 No 𝑎 No ) → (𝑎𝑅𝑎 ↔ ( bday 𝑎) ∈ ( bday 𝑎)))
54anidms 571 . . . . 5 (𝑎 No → (𝑎𝑅𝑎 ↔ ( bday 𝑎) ∈ ( bday 𝑎)))
62, 5mtbiri 328 . . . 4 (𝑎 No → ¬ 𝑎𝑅𝑎)
76adantl 482 . . 3 ((⊤ ∧ 𝑎 No ) → ¬ 𝑎𝑅𝑎)
8 bdayon 27762 . . . . . 6 ( bday 𝑐) ∈ On
9 ontr1 6357 . . . . . 6 (( bday 𝑐) ∈ On → ((( bday 𝑎) ∈ ( bday 𝑏) ∧ ( bday 𝑏) ∈ ( bday 𝑐)) → ( bday 𝑎) ∈ ( bday 𝑐)))
108, 9ax-mp 5 . . . . 5 ((( bday 𝑎) ∈ ( bday 𝑏) ∧ ( bday 𝑏) ∈ ( bday 𝑐)) → ( bday 𝑎) ∈ ( bday 𝑐))
113lrrecval2 27950 . . . . . . . 8 ((𝑎 No 𝑏 No ) → (𝑎𝑅𝑏 ↔ ( bday 𝑎) ∈ ( bday 𝑏)))
12113adant3 1138 . . . . . . 7 ((𝑎 No 𝑏 No 𝑐 No ) → (𝑎𝑅𝑏 ↔ ( bday 𝑎) ∈ ( bday 𝑏)))
133lrrecval2 27950 . . . . . . . 8 ((𝑏 No 𝑐 No ) → (𝑏𝑅𝑐 ↔ ( bday 𝑏) ∈ ( bday 𝑐)))
14133adant1 1136 . . . . . . 7 ((𝑎 No 𝑏 No 𝑐 No ) → (𝑏𝑅𝑐 ↔ ( bday 𝑏) ∈ ( bday 𝑐)))
1512, 14anbi12d 638 . . . . . 6 ((𝑎 No 𝑏 No 𝑐 No ) → ((𝑎𝑅𝑏𝑏𝑅𝑐) ↔ (( bday 𝑎) ∈ ( bday 𝑏) ∧ ( bday 𝑏) ∈ ( bday 𝑐))))
163lrrecval2 27950 . . . . . . 7 ((𝑎 No 𝑐 No ) → (𝑎𝑅𝑐 ↔ ( bday 𝑎) ∈ ( bday 𝑐)))
17163adant2 1137 . . . . . 6 ((𝑎 No 𝑏 No 𝑐 No ) → (𝑎𝑅𝑐 ↔ ( bday 𝑎) ∈ ( bday 𝑐)))
1815, 17imbi12d 345 . . . . 5 ((𝑎 No 𝑏 No 𝑐 No ) → (((𝑎𝑅𝑏𝑏𝑅𝑐) → 𝑎𝑅𝑐) ↔ ((( bday 𝑎) ∈ ( bday 𝑏) ∧ ( bday 𝑏) ∈ ( bday 𝑐)) → ( bday 𝑎) ∈ ( bday 𝑐))))
1910, 18mpbiri 259 . . . 4 ((𝑎 No 𝑏 No 𝑐 No ) → ((𝑎𝑅𝑏𝑏𝑅𝑐) → 𝑎𝑅𝑐))
2019adantl 482 . . 3 ((⊤ ∧ (𝑎 No 𝑏 No 𝑐 No )) → ((𝑎𝑅𝑏𝑏𝑅𝑐) → 𝑎𝑅𝑐))
217, 20ispod 5535 . 2 (⊤ → 𝑅 Po No )
2221mptru 1554 1 𝑅 Po No
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 207  wa 396  w3a 1092   = wceq 1547  wtru 1548  wcel 2119  cun 3881   class class class wbr 5072  {copab 5134   Po wpo 5524  Oncon0 6310  cfv 6485   No csur 27621   bday cbday 27623   L cleft 27835   R cright 27836
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2711  ax-rep 5199  ax-sep 5218  ax-nul 5228  ax-pow 5294  ax-pr 5362  ax-un 7678
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3or 1093  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2718  df-cleq 2731  df-clel 2814  df-nfc 2888  df-ne 2935  df-ral 3054  df-rex 3064  df-rmo 3344  df-reu 3345  df-rab 3392  df-v 3433  df-sbc 3724  df-csb 3832  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3903  df-nul 4262  df-if 4455  df-pw 4531  df-sn 4556  df-pr 4558  df-tp 4560  df-op 4562  df-uni 4839  df-int 4878  df-iun 4923  df-br 5073  df-opab 5135  df-mpt 5154  df-tr 5180  df-id 5513  df-eprel 5518  df-po 5526  df-so 5527  df-fr 5571  df-we 5573  df-xp 5624  df-rel 5625  df-cnv 5626  df-co 5627  df-dm 5628  df-rn 5629  df-res 5630  df-ima 5631  df-pred 6252  df-ord 6313  df-on 6314  df-suc 6316  df-iota 6441  df-fun 6487  df-fn 6488  df-f 6489  df-f1 6490  df-fo 6491  df-f1o 6492  df-fv 6493  df-riota 7313  df-ov 7359  df-oprab 7360  df-mpo 7361  df-2nd 7932  df-frecs 8221  df-wrecs 8252  df-recs 8301  df-1o 8395  df-2o 8396  df-no 27624  df-lts 27625  df-bday 27626  df-slts 27768  df-cuts 27770  df-made 27837  df-old 27838  df-left 27840  df-right 27841
This theorem is referenced by:  noinds  27955  norecfn  27956  norecov  27957  noxpordpo  27960  no2indlesm  27964  no3inds  27968
  Copyright terms: Public domain W3C validator