| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > lrrecpo | Structured version Visualization version GIF version | ||
| Description: Now, we establish that 𝑅 is a partial ordering on No . (Contributed by Scott Fenton, 19-Aug-2024.) |
| Ref | Expression |
|---|---|
| lrrec.1 | ⊢ 𝑅 = {〈𝑥, 𝑦〉 ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))} |
| Ref | Expression |
|---|---|
| lrrecpo | ⊢ 𝑅 Po No |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | bdayelon 27740 | . . . . . 6 ⊢ ( bday ‘𝑎) ∈ On | |
| 2 | 1 | onirri 6467 | . . . . 5 ⊢ ¬ ( bday ‘𝑎) ∈ ( bday ‘𝑎) |
| 3 | lrrec.1 | . . . . . . 7 ⊢ 𝑅 = {〈𝑥, 𝑦〉 ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))} | |
| 4 | 3 | lrrecval2 27899 | . . . . . 6 ⊢ ((𝑎 ∈ No ∧ 𝑎 ∈ No ) → (𝑎𝑅𝑎 ↔ ( bday ‘𝑎) ∈ ( bday ‘𝑎))) |
| 5 | 4 | anidms 566 | . . . . 5 ⊢ (𝑎 ∈ No → (𝑎𝑅𝑎 ↔ ( bday ‘𝑎) ∈ ( bday ‘𝑎))) |
| 6 | 2, 5 | mtbiri 327 | . . . 4 ⊢ (𝑎 ∈ No → ¬ 𝑎𝑅𝑎) |
| 7 | 6 | adantl 481 | . . 3 ⊢ ((⊤ ∧ 𝑎 ∈ No ) → ¬ 𝑎𝑅𝑎) |
| 8 | bdayelon 27740 | . . . . . 6 ⊢ ( bday ‘𝑐) ∈ On | |
| 9 | ontr1 6399 | . . . . . 6 ⊢ (( bday ‘𝑐) ∈ On → ((( bday ‘𝑎) ∈ ( bday ‘𝑏) ∧ ( bday ‘𝑏) ∈ ( bday ‘𝑐)) → ( bday ‘𝑎) ∈ ( bday ‘𝑐))) | |
| 10 | 8, 9 | ax-mp 5 | . . . . 5 ⊢ ((( bday ‘𝑎) ∈ ( bday ‘𝑏) ∧ ( bday ‘𝑏) ∈ ( bday ‘𝑐)) → ( bday ‘𝑎) ∈ ( bday ‘𝑐)) |
| 11 | 3 | lrrecval2 27899 | . . . . . . . 8 ⊢ ((𝑎 ∈ No ∧ 𝑏 ∈ No ) → (𝑎𝑅𝑏 ↔ ( bday ‘𝑎) ∈ ( bday ‘𝑏))) |
| 12 | 11 | 3adant3 1132 | . . . . . . 7 ⊢ ((𝑎 ∈ No ∧ 𝑏 ∈ No ∧ 𝑐 ∈ No ) → (𝑎𝑅𝑏 ↔ ( bday ‘𝑎) ∈ ( bday ‘𝑏))) |
| 13 | 3 | lrrecval2 27899 | . . . . . . . 8 ⊢ ((𝑏 ∈ No ∧ 𝑐 ∈ No ) → (𝑏𝑅𝑐 ↔ ( bday ‘𝑏) ∈ ( bday ‘𝑐))) |
| 14 | 13 | 3adant1 1130 | . . . . . . 7 ⊢ ((𝑎 ∈ No ∧ 𝑏 ∈ No ∧ 𝑐 ∈ No ) → (𝑏𝑅𝑐 ↔ ( bday ‘𝑏) ∈ ( bday ‘𝑐))) |
| 15 | 12, 14 | anbi12d 632 | . . . . . 6 ⊢ ((𝑎 ∈ No ∧ 𝑏 ∈ No ∧ 𝑐 ∈ No ) → ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) ↔ (( bday ‘𝑎) ∈ ( bday ‘𝑏) ∧ ( bday ‘𝑏) ∈ ( bday ‘𝑐)))) |
| 16 | 3 | lrrecval2 27899 | . . . . . . 7 ⊢ ((𝑎 ∈ No ∧ 𝑐 ∈ No ) → (𝑎𝑅𝑐 ↔ ( bday ‘𝑎) ∈ ( bday ‘𝑐))) |
| 17 | 16 | 3adant2 1131 | . . . . . 6 ⊢ ((𝑎 ∈ No ∧ 𝑏 ∈ No ∧ 𝑐 ∈ No ) → (𝑎𝑅𝑐 ↔ ( bday ‘𝑎) ∈ ( bday ‘𝑐))) |
| 18 | 15, 17 | imbi12d 344 | . . . . 5 ⊢ ((𝑎 ∈ No ∧ 𝑏 ∈ No ∧ 𝑐 ∈ No ) → (((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐) ↔ ((( bday ‘𝑎) ∈ ( bday ‘𝑏) ∧ ( bday ‘𝑏) ∈ ( bday ‘𝑐)) → ( bday ‘𝑎) ∈ ( bday ‘𝑐)))) |
| 19 | 10, 18 | mpbiri 258 | . . . 4 ⊢ ((𝑎 ∈ No ∧ 𝑏 ∈ No ∧ 𝑐 ∈ No ) → ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐)) |
| 20 | 19 | adantl 481 | . . 3 ⊢ ((⊤ ∧ (𝑎 ∈ No ∧ 𝑏 ∈ No ∧ 𝑐 ∈ No )) → ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐)) |
| 21 | 7, 20 | ispod 5570 | . 2 ⊢ (⊤ → 𝑅 Po No ) |
| 22 | 21 | mptru 1547 | 1 ⊢ 𝑅 Po No |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ⊤wtru 1541 ∈ wcel 2108 ∪ cun 3924 class class class wbr 5119 {copab 5181 Po wpo 5559 Oncon0 6352 ‘cfv 6531 No csur 27603 bday cbday 27605 L cleft 27805 R cright 27806 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2707 ax-rep 5249 ax-sep 5266 ax-nul 5276 ax-pow 5335 ax-pr 5402 ax-un 7729 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2539 df-eu 2568 df-clab 2714 df-cleq 2727 df-clel 2809 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3061 df-rmo 3359 df-reu 3360 df-rab 3416 df-v 3461 df-sbc 3766 df-csb 3875 df-dif 3929 df-un 3931 df-in 3933 df-ss 3943 df-pss 3946 df-nul 4309 df-if 4501 df-pw 4577 df-sn 4602 df-pr 4604 df-tp 4606 df-op 4608 df-uni 4884 df-int 4923 df-iun 4969 df-br 5120 df-opab 5182 df-mpt 5202 df-tr 5230 df-id 5548 df-eprel 5553 df-po 5561 df-so 5562 df-fr 5606 df-we 5608 df-xp 5660 df-rel 5661 df-cnv 5662 df-co 5663 df-dm 5664 df-rn 5665 df-res 5666 df-ima 5667 df-pred 6290 df-ord 6355 df-on 6356 df-suc 6358 df-iota 6484 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7362 df-ov 7408 df-oprab 7409 df-mpo 7410 df-2nd 7989 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-1o 8480 df-2o 8481 df-no 27606 df-slt 27607 df-bday 27608 df-sslt 27745 df-scut 27747 df-made 27807 df-old 27808 df-left 27810 df-right 27811 |
| This theorem is referenced by: noinds 27904 norecfn 27905 norecov 27906 noxpordpo 27909 no2indslem 27913 no3inds 27917 |
| Copyright terms: Public domain | W3C validator |