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

Theorem lrrecpo 28165
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 27976 . . . . . 6 ( bday 𝑎) ∈ On
21onirri 6479 . . . . 5 ¬ ( bday 𝑎) ∈ ( bday 𝑎)
3 lrrec.1 . . . . . . 7 𝑅 = {⟨𝑥, 𝑦⟩ ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))}
43lrrecval2 28164 . . . . . 6 ((𝑎 No 𝑎 No ) → (𝑎𝑅𝑎 ↔ ( bday 𝑎) ∈ ( bday 𝑎)))
54anidms 577 . . . . 5 (𝑎 No → (𝑎𝑅𝑎 ↔ ( bday 𝑎) ∈ ( bday 𝑎)))
62, 5mtbiri 330 . . . 4 (𝑎 No → ¬ 𝑎𝑅𝑎)
76adantl 487 . . 3 ((⊤ ∧ 𝑎 No ) → ¬ 𝑎𝑅𝑎)
8 bdayon 27976 . . . . . 6 ( bday 𝑐) ∈ On
9 ontr1 6412 . . . . . 6 (( bday 𝑐) ∈ On → ((( bday 𝑎) ∈ ( bday 𝑏) ∧ ( bday 𝑏) ∈ ( bday 𝑐)) → ( bday 𝑎) ∈ ( bday 𝑐)))
108, 9ax-mp 5 . . . . 5 ((( bday 𝑎) ∈ ( bday 𝑏) ∧ ( bday 𝑏) ∈ ( bday 𝑐)) → ( bday 𝑎) ∈ ( bday 𝑐))
113lrrecval2 28164 . . . . . . . 8 ((𝑎 No 𝑏 No ) → (𝑎𝑅𝑏 ↔ ( bday 𝑎) ∈ ( bday 𝑏)))
12113adant3 1150 . . . . . . 7 ((𝑎 No 𝑏 No 𝑐 No ) → (𝑎𝑅𝑏 ↔ ( bday 𝑎) ∈ ( bday 𝑏)))
133lrrecval2 28164 . . . . . . . 8 ((𝑏 No 𝑐 No ) → (𝑏𝑅𝑐 ↔ ( bday 𝑏) ∈ ( bday 𝑐)))
14133adant1 1148 . . . . . . 7 ((𝑎 No 𝑏 No 𝑐 No ) → (𝑏𝑅𝑐 ↔ ( bday 𝑏) ∈ ( bday 𝑐)))
1512, 14anbi12d 644 . . . . . 6 ((𝑎 No 𝑏 No 𝑐 No ) → ((𝑎𝑅𝑏𝑏𝑅𝑐) ↔ (( bday 𝑎) ∈ ( bday 𝑏) ∧ ( bday 𝑏) ∈ ( bday 𝑐))))
163lrrecval2 28164 . . . . . . 7 ((𝑎 No 𝑐 No ) → (𝑎𝑅𝑐 ↔ ( bday 𝑎) ∈ ( bday 𝑐)))
17163adant2 1149 . . . . . 6 ((𝑎 No 𝑏 No 𝑐 No ) → (𝑎𝑅𝑐 ↔ ( bday 𝑎) ∈ ( bday 𝑐)))
1815, 17imbi12d 347 . . . . 5 ((𝑎 No 𝑏 No 𝑐 No ) → (((𝑎𝑅𝑏𝑏𝑅𝑐) → 𝑎𝑅𝑐) ↔ ((( bday 𝑎) ∈ ( bday 𝑏) ∧ ( bday 𝑏) ∈ ( bday 𝑐)) → ( bday 𝑎) ∈ ( bday 𝑐))))
1910, 18mpbiri 261 . . . 4 ((𝑎 No 𝑏 No 𝑐 No ) → ((𝑎𝑅𝑏𝑏𝑅𝑐) → 𝑎𝑅𝑐))
2019adantl 487 . . 3 ((⊤ ∧ (𝑎 No 𝑏 No 𝑐 No )) → ((𝑎𝑅𝑏𝑏𝑅𝑐) → 𝑎𝑅𝑐))
217, 20ispod 5580 . 2 (⊤ → 𝑅 Po No )
2221mptru 1577 1 𝑅 Po No
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3  wi 4  wb 209  wa 401  w3a 1103   = wceq 1570  wtru 1571  wcel 2146  cun 3904   class class class wbr 5111  {copab 5175   Po wpo 5569  Oncon0 6364  cfv 6540   No csur 27835   bday cbday 27837   L cleft 28049   R cright 28050
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-tp 4596  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7373  df-ov 7419  df-oprab 7420  df-mpo 7421  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-1o 8455  df-2o 8456  df-no 27838  df-lts 27839  df-bday 27840  df-slts 27982  df-cuts 27984  df-made 28051  df-old 28052  df-left 28054  df-right 28055
This theorem is used by:  noinds  28169  norecfn  28170  norecov  28171  noxpordpo  28174  no2indlesm  28178  no3inds  28182
  Copyright terms: Public domain W3C validator