| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cvrat42 | Structured version Visualization version GIF version | ||
| Description: Commuted version of cvrat4 40594. (Contributed by NM, 28-Jan-2012.) |
| Ref | Expression |
|---|---|
| cvrat4.b | ⊢ 𝐵 = (Base‘𝐾) |
| cvrat4.l | ⊢ ≤ = (le‘𝐾) |
| cvrat4.j | ⊢ ∨ = (join‘𝐾) |
| cvrat4.z | ⊢ 0 = (0.‘𝐾) |
| cvrat4.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| Ref | Expression |
|---|---|
| cvrat42 | ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ((𝑋 ≠ 0 ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → ∃𝑟 ∈ 𝐴 (𝑟 ≤ 𝑋 ∧ 𝑃 ≤ (𝑟 ∨ 𝑄)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cvrat4.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | cvrat4.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
| 3 | cvrat4.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
| 4 | cvrat4.z | . . 3 ⊢ 0 = (0.‘𝐾) | |
| 5 | cvrat4.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | 1, 2, 3, 4, 5 | cvrat4 40594 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ((𝑋 ≠ 0 ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → ∃𝑟 ∈ 𝐴 (𝑟 ≤ 𝑋 ∧ 𝑃 ≤ (𝑄 ∨ 𝑟)))) |
| 7 | hllat 40514 | . . . . . . 7 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat) | |
| 8 | 7 | ad2antrr 739 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → 𝐾 ∈ Lat) |
| 9 | simplr3 1236 | . . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → 𝑄 ∈ 𝐴) | |
| 10 | 1, 5 | atbase 40440 | . . . . . . 7 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ 𝐵) |
| 11 | 9, 10 | syl 18 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → 𝑄 ∈ 𝐵) |
| 12 | 1, 5 | atbase 40440 | . . . . . . 7 ⊢ (𝑟 ∈ 𝐴 → 𝑟 ∈ 𝐵) |
| 13 | 12 | adantl 487 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → 𝑟 ∈ 𝐵) |
| 14 | 1, 3 | latjcom 18627 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐵 ∧ 𝑟 ∈ 𝐵) → (𝑄 ∨ 𝑟) = (𝑟 ∨ 𝑄)) |
| 15 | 8, 11, 13, 14 | syl3anc 1398 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → (𝑄 ∨ 𝑟) = (𝑟 ∨ 𝑄)) |
| 16 | 15 | breq2d 5114 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → (𝑃 ≤ (𝑄 ∨ 𝑟) ↔ 𝑃 ≤ (𝑟 ∨ 𝑄))) |
| 17 | 16 | anbi2d 642 | . . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → ((𝑟 ≤ 𝑋 ∧ 𝑃 ≤ (𝑄 ∨ 𝑟)) ↔ (𝑟 ≤ 𝑋 ∧ 𝑃 ≤ (𝑟 ∨ 𝑄)))) |
| 18 | 17 | rexbidva 3184 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (∃𝑟 ∈ 𝐴 (𝑟 ≤ 𝑋 ∧ 𝑃 ≤ (𝑄 ∨ 𝑟)) ↔ ∃𝑟 ∈ 𝐴 (𝑟 ≤ 𝑋 ∧ 𝑃 ≤ (𝑟 ∨ 𝑄)))) |
| 19 | 6, 18 | sylibd 242 | 1 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ((𝑋 ≠ 0 ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → ∃𝑟 ∈ 𝐴 (𝑟 ≤ 𝑋 ∧ 𝑃 ≤ (𝑟 ∨ 𝑄)))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1569 ∈ wcel 2144 ≠ wne 2955 ∃wrex 3086 class class class wbr 5102 ‘cfv 6539 (class class class)co 7421 Basecbs 17393 lecple 17441 joincjn 18491 0.cp0 18601 Latclat 18611 Atomscatm 40414 HLchlt 40501 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7378 df-ov 7424 df-oprab 7425 df-proset 18474 df-poset 18493 df-plt 18508 df-lub 18524 df-glb 18525 df-join 18526 df-meet 18527 df-p0 18603 df-lat 18612 df-clat 18679 df-oposet 40327 df-ol 40329 df-oml 40330 df-covers 40417 df-ats 40418 df-atl 40449 df-cvlat 40473 df-hlat 40502 |
| This theorem is used by: pmapjat1 41004 djhcvat42 42566 |
| Copyright terms: Public domain | W3C validator |