| 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 | bdayon 28017 | . . . . . 6 ⊢ ( bday ‘𝑎) ∈ On | |
| 2 | 1 | onirri 6472 | . . . . 5 ⊢ ¬ ( bday ‘𝑎) ∈ ( bday ‘𝑎) |
| 3 | lrrec.1 | . . . . . . 7 ⊢ 𝑅 = {〈𝑥, 𝑦〉 ∣ 𝑥 ∈ (( L ‘𝑦) ∪ ( R ‘𝑦))} | |
| 4 | 3 | lrrecval2 28205 | . . . . . 6 ⊢ ((𝑎 ∈ No ∧ 𝑎 ∈ No ) → (𝑎𝑅𝑎 ↔ ( bday ‘𝑎) ∈ ( bday ‘𝑎))) |
| 5 | 4 | anidms 577 | . . . . 5 ⊢ (𝑎 ∈ No → (𝑎𝑅𝑎 ↔ ( bday ‘𝑎) ∈ ( bday ‘𝑎))) |
| 6 | 2, 5 | mtbiri 330 | . . . 4 ⊢ (𝑎 ∈ No → ¬ 𝑎𝑅𝑎) |
| 7 | 6 | adantl 487 | . . 3 ⊢ ((⊤ ∧ 𝑎 ∈ No ) → ¬ 𝑎𝑅𝑎) |
| 8 | bdayon 28017 | . . . . . 6 ⊢ ( bday ‘𝑐) ∈ On | |
| 9 | ontr1 6405 | . . . . . 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 28205 | . . . . . . . 8 ⊢ ((𝑎 ∈ No ∧ 𝑏 ∈ No ) → (𝑎𝑅𝑏 ↔ ( bday ‘𝑎) ∈ ( bday ‘𝑏))) |
| 12 | 11 | 3adant3 1150 | . . . . . . 7 ⊢ ((𝑎 ∈ No ∧ 𝑏 ∈ No ∧ 𝑐 ∈ No ) → (𝑎𝑅𝑏 ↔ ( bday ‘𝑎) ∈ ( bday ‘𝑏))) |
| 13 | 3 | lrrecval2 28205 | . . . . . . . 8 ⊢ ((𝑏 ∈ No ∧ 𝑐 ∈ No ) → (𝑏𝑅𝑐 ↔ ( bday ‘𝑏) ∈ ( bday ‘𝑐))) |
| 14 | 13 | 3adant1 1148 | . . . . . . 7 ⊢ ((𝑎 ∈ No ∧ 𝑏 ∈ No ∧ 𝑐 ∈ No ) → (𝑏𝑅𝑐 ↔ ( bday ‘𝑏) ∈ ( bday ‘𝑐))) |
| 15 | 12, 14 | anbi12d 644 | . . . . . 6 ⊢ ((𝑎 ∈ No ∧ 𝑏 ∈ No ∧ 𝑐 ∈ No ) → ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) ↔ (( bday ‘𝑎) ∈ ( bday ‘𝑏) ∧ ( bday ‘𝑏) ∈ ( bday ‘𝑐)))) |
| 16 | 3 | lrrecval2 28205 | . . . . . . 7 ⊢ ((𝑎 ∈ No ∧ 𝑐 ∈ No ) → (𝑎𝑅𝑐 ↔ ( bday ‘𝑎) ∈ ( bday ‘𝑐))) |
| 17 | 16 | 3adant2 1149 | . . . . . 6 ⊢ ((𝑎 ∈ No ∧ 𝑏 ∈ No ∧ 𝑐 ∈ No ) → (𝑎𝑅𝑐 ↔ ( bday ‘𝑎) ∈ ( bday ‘𝑐))) |
| 18 | 15, 17 | imbi12d 347 | . . . . 5 ⊢ ((𝑎 ∈ No ∧ 𝑏 ∈ No ∧ 𝑐 ∈ No ) → (((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐) ↔ ((( bday ‘𝑎) ∈ ( bday ‘𝑏) ∧ ( bday ‘𝑏) ∈ ( bday ‘𝑐)) → ( bday ‘𝑎) ∈ ( bday ‘𝑐)))) |
| 19 | 10, 18 | mpbiri 261 | . . . 4 ⊢ ((𝑎 ∈ No ∧ 𝑏 ∈ No ∧ 𝑐 ∈ No ) → ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐)) |
| 20 | 19 | adantl 487 | . . 3 ⊢ ((⊤ ∧ (𝑎 ∈ No ∧ 𝑏 ∈ No ∧ 𝑐 ∈ No )) → ((𝑎𝑅𝑏 ∧ 𝑏𝑅𝑐) → 𝑎𝑅𝑐)) |
| 21 | 7, 20 | ispod 5572 | . 2 ⊢ (⊤ → 𝑅 Po No ) |
| 22 | 21 | mptru 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 2145 ∪ cun 3897 class class class wbr 5103 {copab 5167 Po wpo 5561 Oncon0 6357 ‘cfv 6533 No csur 27876 bday cbday 27878 L cleft 28090 R cright 28091 |
| 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 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 |
| 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 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-tp 4589 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-1o 8455 df-2o 8456 df-no 27879 df-lts 27880 df-bday 27881 df-slts 28023 df-cuts 28025 df-made 28092 df-old 28093 df-left 28095 df-right 28096 |
| This theorem is used by: noinds 28210 norecfn 28211 norecov 28212 noxpordpo 28215 no2indlesm 28219 no3inds 28223 |
| Copyright terms: Public domain | W3C validator |