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

Theorem lrrecpo 27949
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 27760 . . . . . 6 ( bday 𝑎) ∈ On
21onirri 6439 . . . . 5 ¬ ( bday 𝑎) ∈ ( bday 𝑎)
3 lrrec.1 . . . . . . 7 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}
43lrrecval2 27948 . . . . . 6 ((𝑎 No 𝑎 No ) → (𝑎𝑅𝑎 ↔ ( bday 𝑎) ∈ ( bday 𝑎)))
54anidms 566 . . . . 5 (𝑎 No → (𝑎𝑅𝑎 ↔ ( bday 𝑎) ∈ ( bday 𝑎)))
62, 5mtbiri 327 . . . 4 (𝑎 No → ¬ 𝑎𝑅𝑎)
76adantl 481 . . 3 ((⊤ ∧ 𝑎 No ) → ¬ 𝑎𝑅𝑎)
8 bdayon 27760 . . . . . 6 ( bday 𝑐) ∈ On
9 ontr1 6372 . . . . . 6 (( bday 𝑐) ∈ On → ((( bday 𝑎) ∈ ( bday 𝑏) ∧ ( bday 𝑏) ∈ ( bday 𝑐)) → ( bday 𝑎) ∈ ( bday 𝑐)))
108, 9ax-mp 5 . . . . 5 ((( bday 𝑎) ∈ ( bday 𝑏) ∧ ( bday 𝑏) ∈ ( bday 𝑐)) → ( bday 𝑎) ∈ ( bday 𝑐))
113lrrecval2 27948 . . . . . . . 8 ((𝑎 No 𝑏 No ) → (𝑎𝑅𝑏 ↔ ( bday 𝑎) ∈ ( bday 𝑏)))
12113adant3 1133 . . . . . . 7 ((𝑎 No 𝑏 No 𝑐 No ) → (𝑎𝑅𝑏 ↔ ( bday 𝑎) ∈ ( bday 𝑏)))
133lrrecval2 27948 . . . . . . . 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 27948 . . . . . . 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 5549 . 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 3901   class class class wbr 5100  {copab 5162   Po wpo 5538  Oncon0 6325  cfv 6500   No csur 27619   bday cbday 27621   L cleft 27833   R cright 27834
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 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690
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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-tp 4587  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-1o 8407  df-2o 8408  df-no 27622  df-lts 27623  df-bday 27624  df-slts 27766  df-cuts 27768  df-made 27835  df-old 27836  df-left 27838  df-right 27839
This theorem is referenced by:  noinds  27953  norecfn  27954  norecov  27955  noxpordpo  27958  no2indlesm  27962  no3inds  27966
  Copyright terms: Public domain W3C validator