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

Theorem lrrecpo 27933
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 27744 . . . . . 6 ( bday 𝑎) ∈ On
21onirri 6437 . . . . 5 ¬ ( bday 𝑎) ∈ ( bday 𝑎)
3 lrrec.1 . . . . . . 7 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}
43lrrecval2 27932 . . . . . 6 ((𝑎 No 𝑎 No ) → (𝑎𝑅𝑎 ↔ ( bday 𝑎) ∈ ( bday 𝑎)))
54anidms 566 . . . . 5 (𝑎 No → (𝑎𝑅𝑎 ↔ ( bday 𝑎) ∈ ( bday 𝑎)))
62, 5mtbiri 327 . . . 4 (𝑎 No → ¬ 𝑎𝑅𝑎)
76adantl 481 . . 3 ((⊤ ∧ 𝑎 No ) → ¬ 𝑎𝑅𝑎)
8 bdayon 27744 . . . . . 6 ( bday 𝑐) ∈ On
9 ontr1 6370 . . . . . 6 (( bday 𝑐) ∈ On → ((( bday 𝑎) ∈ ( bday 𝑏) ∧ ( bday 𝑏) ∈ ( bday 𝑐)) → ( bday 𝑎) ∈ ( bday 𝑐)))
108, 9ax-mp 5 . . . . 5 ((( bday 𝑎) ∈ ( bday 𝑏) ∧ ( bday 𝑏) ∈ ( bday 𝑐)) → ( bday 𝑎) ∈ ( bday 𝑐))
113lrrecval2 27932 . . . . . . . 8 ((𝑎 No 𝑏 No ) → (𝑎𝑅𝑏 ↔ ( bday 𝑎) ∈ ( bday 𝑏)))
12113adant3 1133 . . . . . . 7 ((𝑎 No 𝑏 No 𝑐 No ) → (𝑎𝑅𝑏 ↔ ( bday 𝑎) ∈ ( bday 𝑏)))
133lrrecval2 27932 . . . . . . . 8 ((𝑏 No 𝑐 No ) → (𝑏𝑅𝑐 ↔ ( bday 𝑏) ∈ ( bday 𝑐)))
14133adant1 1131 . . . . . . 7 ((𝑎 No 𝑏 No 𝑐 No ) → (𝑏𝑅𝑐 ↔ ( bday 𝑏) ∈ ( bday 𝑐)))
1512, 14anbi12d 633 . . . . . 6 ((𝑎 No 𝑏 No 𝑐 No ) → ((𝑎𝑅𝑏𝑏𝑅𝑐) ↔ (( bday 𝑎) ∈ ( bday 𝑏) ∧ ( bday 𝑏) ∈ ( bday 𝑐))))
163lrrecval2 27932 . . . . . . 7 ((𝑎 No 𝑐 No ) → (𝑎𝑅𝑐 ↔ ( bday 𝑎) ∈ ( bday 𝑐)))
17163adant2 1132 . . . . . 6 ((𝑎 No 𝑏 No 𝑐 No ) → (𝑎𝑅𝑐 ↔ ( bday 𝑎) ∈ ( bday 𝑐)))
1815, 17imbi12d 344 . . . . 5 ((𝑎 No 𝑏 No 𝑐 No ) → (((𝑎𝑅𝑏𝑏𝑅𝑐) → 𝑎𝑅𝑐) ↔ ((( bday 𝑎) ∈ ( bday 𝑏) ∧ ( bday 𝑏) ∈ ( bday 𝑐)) → ( bday 𝑎) ∈ ( bday 𝑐))))
1910, 18mpbiri 258 . . . 4 ((𝑎 No 𝑏 No 𝑐 No ) → ((𝑎𝑅𝑏𝑏𝑅𝑐) → 𝑎𝑅𝑐))
2019adantl 481 . . 3 ((⊤ ∧ (𝑎 No 𝑏 No 𝑐 No )) → ((𝑎𝑅𝑏𝑏𝑅𝑐) → 𝑎𝑅𝑐))
217, 20ispod 5548 . 2 (⊤ → 𝑅 Po No )
2221mptru 1549 1 𝑅 Po No
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  w3a 1087   = wceq 1542  wtru 1543  wcel 2114  cun 3887   class class class wbr 5085  {copab 5147   Po wpo 5537  Oncon0 6323  cfv 6498   No csur 27603   bday cbday 27605   L cleft 27817   R cright 27818
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-1o 8405  df-2o 8406  df-no 27606  df-lts 27607  df-bday 27608  df-slts 27750  df-cuts 27752  df-made 27819  df-old 27820  df-left 27822  df-right 27823
This theorem is referenced by:  noinds  27937  norecfn  27938  norecov  27939  noxpordpo  27942  no2indlesm  27946  no3inds  27950
  Copyright terms: Public domain W3C validator