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

Theorem lrrecpo 28022
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 27833 . . . . . 6 ( bday 𝑎) ∈ On
21onirri 6455 . . . . 5 ¬ ( bday 𝑎) ∈ ( bday 𝑎)
3 lrrec.1 . . . . . . 7 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}
43lrrecval2 28021 . . . . . 6 ((𝑎 No 𝑎 No ) → (𝑎𝑅𝑎 ↔ ( bday 𝑎) ∈ ( bday 𝑎)))
54anidms 574 . . . . 5 (𝑎 No → (𝑎𝑅𝑎 ↔ ( bday 𝑎) ∈ ( bday 𝑎)))
62, 5mtbiri 329 . . . 4 (𝑎 No → ¬ 𝑎𝑅𝑎)
76adantl 485 . . 3 ((⊤ ∧ 𝑎 No ) → ¬ 𝑎𝑅𝑎)
8 bdayon 27833 . . . . . 6 ( bday 𝑐) ∈ On
9 ontr1 6388 . . . . . 6 (( bday 𝑐) ∈ On → ((( bday 𝑎) ∈ ( bday 𝑏) ∧ ( bday 𝑏) ∈ ( bday 𝑐)) → ( bday 𝑎) ∈ ( bday 𝑐)))
108, 9ax-mp 5 . . . . 5 ((( bday 𝑎) ∈ ( bday 𝑏) ∧ ( bday 𝑏) ∈ ( bday 𝑐)) → ( bday 𝑎) ∈ ( bday 𝑐))
113lrrecval2 28021 . . . . . . . 8 ((𝑎 No 𝑏 No ) → (𝑎𝑅𝑏 ↔ ( bday 𝑎) ∈ ( bday 𝑏)))
12113adant3 1144 . . . . . . 7 ((𝑎 No 𝑏 No 𝑐 No ) → (𝑎𝑅𝑏 ↔ ( bday 𝑎) ∈ ( bday 𝑏)))
133lrrecval2 28021 . . . . . . . 8 ((𝑏 No 𝑐 No ) → (𝑏𝑅𝑐 ↔ ( bday 𝑏) ∈ ( bday 𝑐)))
14133adant1 1142 . . . . . . 7 ((𝑎 No 𝑏 No 𝑐 No ) → (𝑏𝑅𝑐 ↔ ( bday 𝑏) ∈ ( bday 𝑐)))
1512, 14anbi12d 641 . . . . . 6 ((𝑎 No 𝑏 No 𝑐 No ) → ((𝑎𝑅𝑏𝑏𝑅𝑐) ↔ (( bday 𝑎) ∈ ( bday 𝑏) ∧ ( bday 𝑏) ∈ ( bday 𝑐))))
163lrrecval2 28021 . . . . . . 7 ((𝑎 No 𝑐 No ) → (𝑎𝑅𝑐 ↔ ( bday 𝑎) ∈ ( bday 𝑐)))
17163adant2 1143 . . . . . 6 ((𝑎 No 𝑏 No 𝑐 No ) → (𝑎𝑅𝑐 ↔ ( bday 𝑎) ∈ ( bday 𝑐)))
1815, 17imbi12d 346 . . . . 5 ((𝑎 No 𝑏 No 𝑐 No ) → (((𝑎𝑅𝑏𝑏𝑅𝑐) → 𝑎𝑅𝑐) ↔ ((( bday 𝑎) ∈ ( bday 𝑏) ∧ ( bday 𝑏) ∈ ( bday 𝑐)) → ( bday 𝑎) ∈ ( bday 𝑐))))
1910, 18mpbiri 260 . . . 4 ((𝑎 No 𝑏 No 𝑐 No ) → ((𝑎𝑅𝑏𝑏𝑅𝑐) → 𝑎𝑅𝑐))
2019adantl 485 . . 3 ((⊤ ∧ (𝑎 No 𝑏 No 𝑐 No )) → ((𝑎𝑅𝑏𝑏𝑅𝑐) → 𝑎𝑅𝑐))
217, 20ispod 5560 . 2 (⊤ → 𝑅 Po No )
2221mptru 1566 1 𝑅 Po No
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 208  wa 399  w3a 1097   = wceq 1559  wtru 1560  wcel 2141  cun 3900   class class class wbr 5097  {copab 5159   Po wpo 5549  Oncon0 6341  cfv 6516   No csur 27692   bday cbday 27694   L cleft 27906   R cright 27907
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-rep 5224  ax-sep 5243  ax-nul 5253  ax-pow 5319  ax-pr 5387  ax-un 7713
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-tp 4584  df-op 4586  df-uni 4863  df-int 4903  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5538  df-eprel 5543  df-po 5551  df-so 5552  df-fr 5596  df-we 5598  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-pred 6283  df-ord 6344  df-on 6345  df-suc 6347  df-iota 6472  df-fun 6518  df-fn 6519  df-f 6520  df-f1 6521  df-fo 6522  df-f1o 6523  df-fv 6524  df-riota 7348  df-ov 7394  df-oprab 7395  df-mpo 7396  df-2nd 7966  df-frecs 8256  df-wrecs 8287  df-recs 8336  df-1o 8431  df-2o 8432  df-no 27695  df-lts 27696  df-bday 27697  df-slts 27839  df-cuts 27841  df-made 27908  df-old 27909  df-left 27911  df-right 27912
This theorem is referenced by:  noinds  28026  norecfn  28027  norecov  28028  noxpordpo  28031  no2indlesm  28035  no3inds  28039
  Copyright terms: Public domain W3C validator