| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > prltlu | GIF version | ||
| Description: An element of a lower cut is less than an element of the corresponding upper cut. (Contributed by Jim Kingdon, 15-Oct-2019.) |
| Ref | Expression |
|---|---|
| prltlu | ⊢ ((〈𝐿, 𝑈〉 ∈ P ∧ 𝐵 ∈ 𝐿 ∧ 𝐶 ∈ 𝑈) → 𝐵 <Q 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simp3 1026 | . . 3 ⊢ ((〈𝐿, 𝑈〉 ∈ P ∧ 𝐵 ∈ 𝐿 ∧ 𝐶 ∈ 𝑈) → 𝐶 ∈ 𝑈) | |
| 2 | eleq1 2295 | . . . . . . 7 ⊢ (𝑞 = 𝐶 → (𝑞 ∈ 𝐿 ↔ 𝐶 ∈ 𝐿)) | |
| 3 | eleq1 2295 | . . . . . . 7 ⊢ (𝑞 = 𝐶 → (𝑞 ∈ 𝑈 ↔ 𝐶 ∈ 𝑈)) | |
| 4 | 2, 3 | anbi12d 473 | . . . . . 6 ⊢ (𝑞 = 𝐶 → ((𝑞 ∈ 𝐿 ∧ 𝑞 ∈ 𝑈) ↔ (𝐶 ∈ 𝐿 ∧ 𝐶 ∈ 𝑈))) |
| 5 | 4 | notbid 673 | . . . . 5 ⊢ (𝑞 = 𝐶 → (¬ (𝑞 ∈ 𝐿 ∧ 𝑞 ∈ 𝑈) ↔ ¬ (𝐶 ∈ 𝐿 ∧ 𝐶 ∈ 𝑈))) |
| 6 | elinp 7789 | . . . . . . 7 ⊢ (〈𝐿, 𝑈〉 ∈ P ↔ (((𝐿 ⊆ Q ∧ 𝑈 ⊆ Q) ∧ (∃𝑞 ∈ Q 𝑞 ∈ 𝐿 ∧ ∃𝑟 ∈ Q 𝑟 ∈ 𝑈)) ∧ ((∀𝑞 ∈ Q (𝑞 ∈ 𝐿 ↔ ∃𝑟 ∈ Q (𝑞 <Q 𝑟 ∧ 𝑟 ∈ 𝐿)) ∧ ∀𝑟 ∈ Q (𝑟 ∈ 𝑈 ↔ ∃𝑞 ∈ Q (𝑞 <Q 𝑟 ∧ 𝑞 ∈ 𝑈))) ∧ ∀𝑞 ∈ Q ¬ (𝑞 ∈ 𝐿 ∧ 𝑞 ∈ 𝑈) ∧ ∀𝑞 ∈ Q ∀𝑟 ∈ Q (𝑞 <Q 𝑟 → (𝑞 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈))))) | |
| 7 | simpr2 1031 | . . . . . . 7 ⊢ ((((𝐿 ⊆ Q ∧ 𝑈 ⊆ Q) ∧ (∃𝑞 ∈ Q 𝑞 ∈ 𝐿 ∧ ∃𝑟 ∈ Q 𝑟 ∈ 𝑈)) ∧ ((∀𝑞 ∈ Q (𝑞 ∈ 𝐿 ↔ ∃𝑟 ∈ Q (𝑞 <Q 𝑟 ∧ 𝑟 ∈ 𝐿)) ∧ ∀𝑟 ∈ Q (𝑟 ∈ 𝑈 ↔ ∃𝑞 ∈ Q (𝑞 <Q 𝑟 ∧ 𝑞 ∈ 𝑈))) ∧ ∀𝑞 ∈ Q ¬ (𝑞 ∈ 𝐿 ∧ 𝑞 ∈ 𝑈) ∧ ∀𝑞 ∈ Q ∀𝑟 ∈ Q (𝑞 <Q 𝑟 → (𝑞 ∈ 𝐿 ∨ 𝑟 ∈ 𝑈)))) → ∀𝑞 ∈ Q ¬ (𝑞 ∈ 𝐿 ∧ 𝑞 ∈ 𝑈)) | |
| 8 | 6, 7 | sylbi 121 | . . . . . 6 ⊢ (〈𝐿, 𝑈〉 ∈ P → ∀𝑞 ∈ Q ¬ (𝑞 ∈ 𝐿 ∧ 𝑞 ∈ 𝑈)) |
| 9 | 8 | 3ad2ant1 1045 | . . . . 5 ⊢ ((〈𝐿, 𝑈〉 ∈ P ∧ 𝐵 ∈ 𝐿 ∧ 𝐶 ∈ 𝑈) → ∀𝑞 ∈ Q ¬ (𝑞 ∈ 𝐿 ∧ 𝑞 ∈ 𝑈)) |
| 10 | elprnqu 7797 | . . . . . 6 ⊢ ((〈𝐿, 𝑈〉 ∈ P ∧ 𝐶 ∈ 𝑈) → 𝐶 ∈ Q) | |
| 11 | 10 | 3adant2 1043 | . . . . 5 ⊢ ((〈𝐿, 𝑈〉 ∈ P ∧ 𝐵 ∈ 𝐿 ∧ 𝐶 ∈ 𝑈) → 𝐶 ∈ Q) |
| 12 | 5, 9, 11 | rspcdva 2926 | . . . 4 ⊢ ((〈𝐿, 𝑈〉 ∈ P ∧ 𝐵 ∈ 𝐿 ∧ 𝐶 ∈ 𝑈) → ¬ (𝐶 ∈ 𝐿 ∧ 𝐶 ∈ 𝑈)) |
| 13 | ancom 266 | . . . . . 6 ⊢ ((𝐶 ∈ 𝐿 ∧ 𝐶 ∈ 𝑈) ↔ (𝐶 ∈ 𝑈 ∧ 𝐶 ∈ 𝐿)) | |
| 14 | 13 | notbii 674 | . . . . 5 ⊢ (¬ (𝐶 ∈ 𝐿 ∧ 𝐶 ∈ 𝑈) ↔ ¬ (𝐶 ∈ 𝑈 ∧ 𝐶 ∈ 𝐿)) |
| 15 | imnan 697 | . . . . 5 ⊢ ((𝐶 ∈ 𝑈 → ¬ 𝐶 ∈ 𝐿) ↔ ¬ (𝐶 ∈ 𝑈 ∧ 𝐶 ∈ 𝐿)) | |
| 16 | 14, 15 | bitr4i 187 | . . . 4 ⊢ (¬ (𝐶 ∈ 𝐿 ∧ 𝐶 ∈ 𝑈) ↔ (𝐶 ∈ 𝑈 → ¬ 𝐶 ∈ 𝐿)) |
| 17 | 12, 16 | sylib 122 | . . 3 ⊢ ((〈𝐿, 𝑈〉 ∈ P ∧ 𝐵 ∈ 𝐿 ∧ 𝐶 ∈ 𝑈) → (𝐶 ∈ 𝑈 → ¬ 𝐶 ∈ 𝐿)) |
| 18 | 1, 17 | mpd 13 | . 2 ⊢ ((〈𝐿, 𝑈〉 ∈ P ∧ 𝐵 ∈ 𝐿 ∧ 𝐶 ∈ 𝑈) → ¬ 𝐶 ∈ 𝐿) |
| 19 | 3simpa 1021 | . . 3 ⊢ ((〈𝐿, 𝑈〉 ∈ P ∧ 𝐵 ∈ 𝐿 ∧ 𝐶 ∈ 𝑈) → (〈𝐿, 𝑈〉 ∈ P ∧ 𝐵 ∈ 𝐿)) | |
| 20 | prubl 7801 | . . 3 ⊢ (((〈𝐿, 𝑈〉 ∈ P ∧ 𝐵 ∈ 𝐿) ∧ 𝐶 ∈ Q) → (¬ 𝐶 ∈ 𝐿 → 𝐵 <Q 𝐶)) | |
| 21 | 19, 11, 20 | syl2anc 411 | . 2 ⊢ ((〈𝐿, 𝑈〉 ∈ P ∧ 𝐵 ∈ 𝐿 ∧ 𝐶 ∈ 𝑈) → (¬ 𝐶 ∈ 𝐿 → 𝐵 <Q 𝐶)) |
| 22 | 18, 21 | mpd 13 | 1 ⊢ ((〈𝐿, 𝑈〉 ∈ P ∧ 𝐵 ∈ 𝐿 ∧ 𝐶 ∈ 𝑈) → 𝐵 <Q 𝐶) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 104 ↔ wb 105 ∨ wo 716 ∧ w3a 1005 = wceq 1398 ∈ wcel 2203 ∀wral 2520 ∃wrex 2521 ⊆ wss 3211 〈cop 3692 class class class wbr 4109 Qcnq 7595 <Q cltq 7600 Pcnp 7606 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-in1 619 ax-in2 620 ax-io 717 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-10 1554 ax-11 1555 ax-i12 1556 ax-bndl 1558 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-13 2205 ax-14 2206 ax-ext 2214 ax-coll 4225 ax-sep 4228 ax-nul 4236 ax-pow 4287 ax-pr 4322 ax-un 4554 ax-setind 4659 ax-iinf 4710 |
| This theorem depends on definitions: df-bi 117 df-dc 843 df-3or 1006 df-3an 1007 df-tru 1401 df-fal 1404 df-nf 1510 df-sb 1812 df-eu 2083 df-mo 2084 df-clab 2219 df-cleq 2225 df-clel 2228 df-nfc 2373 df-ne 2413 df-ral 2525 df-rex 2526 df-reu 2527 df-rab 2529 df-v 2815 df-sbc 3043 df-csb 3139 df-dif 3213 df-un 3215 df-in 3217 df-ss 3224 df-nul 3509 df-pw 3671 df-sn 3695 df-pr 3696 df-op 3698 df-uni 3915 df-int 3950 df-iun 3993 df-br 4110 df-opab 4172 df-mpt 4173 df-tr 4209 df-eprel 4410 df-id 4414 df-po 4417 df-iso 4418 df-iord 4487 df-on 4489 df-suc 4492 df-iom 4713 df-xp 4755 df-rel 4756 df-cnv 4757 df-co 4758 df-dm 4759 df-rn 4760 df-res 4761 df-ima 4762 df-iota 5312 df-fun 5354 df-fn 5355 df-f 5356 df-f1 5357 df-fo 5358 df-f1o 5359 df-fv 5360 df-ov 6053 df-oprab 6054 df-mpo 6055 df-1st 6334 df-2nd 6335 df-recs 6536 df-irdg 6601 df-oadd 6651 df-omul 6652 df-er 6767 df-ec 6769 df-qs 6773 df-ni 7619 df-mi 7621 df-lti 7622 df-enq 7662 df-nqqs 7663 df-ltnqqs 7668 df-inp 7781 |
| This theorem is referenced by: genpdisj 7838 prmuloc 7881 ltprordil 7904 ltpopr 7910 ltexprlemopu 7918 ltexprlemdisj 7921 ltexprlemfl 7924 ltexprlemfu 7926 ltexprlemru 7927 recexprlemdisj 7945 recexprlemss1l 7950 recexprlemss1u 7951 |
| Copyright terms: Public domain | W3C validator |