![]() |
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 36739. (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 36739 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ((𝑋 ≠ 0 ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → ∃𝑟 ∈ 𝐴 (𝑟 ≤ 𝑋 ∧ 𝑃 ≤ (𝑄 ∨ 𝑟)))) |
7 | hllat 36659 | . . . . . . 7 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat) | |
8 | 7 | ad2antrr 725 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → 𝐾 ∈ Lat) |
9 | simplr3 1214 | . . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → 𝑄 ∈ 𝐴) | |
10 | 1, 5 | atbase 36585 | . . . . . . 7 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ 𝐵) |
11 | 9, 10 | syl 17 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → 𝑄 ∈ 𝐵) |
12 | 1, 5 | atbase 36585 | . . . . . . 7 ⊢ (𝑟 ∈ 𝐴 → 𝑟 ∈ 𝐵) |
13 | 12 | adantl 485 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → 𝑟 ∈ 𝐵) |
14 | 1, 3 | latjcom 17661 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐵 ∧ 𝑟 ∈ 𝐵) → (𝑄 ∨ 𝑟) = (𝑟 ∨ 𝑄)) |
15 | 8, 11, 13, 14 | syl3anc 1368 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → (𝑄 ∨ 𝑟) = (𝑟 ∨ 𝑄)) |
16 | 15 | breq2d 5042 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → (𝑃 ≤ (𝑄 ∨ 𝑟) ↔ 𝑃 ≤ (𝑟 ∨ 𝑄))) |
17 | 16 | anbi2d 631 | . . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → ((𝑟 ≤ 𝑋 ∧ 𝑃 ≤ (𝑄 ∨ 𝑟)) ↔ (𝑟 ≤ 𝑋 ∧ 𝑃 ≤ (𝑟 ∨ 𝑄)))) |
18 | 17 | rexbidva 3255 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (∃𝑟 ∈ 𝐴 (𝑟 ≤ 𝑋 ∧ 𝑃 ≤ (𝑄 ∨ 𝑟)) ↔ ∃𝑟 ∈ 𝐴 (𝑟 ≤ 𝑋 ∧ 𝑃 ≤ (𝑟 ∨ 𝑄)))) |
19 | 6, 18 | sylibd 242 | 1 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ((𝑋 ≠ 0 ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → ∃𝑟 ∈ 𝐴 (𝑟 ≤ 𝑋 ∧ 𝑃 ≤ (𝑟 ∨ 𝑄)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 399 ∧ w3a 1084 = wceq 1538 ∈ wcel 2111 ≠ wne 2987 ∃wrex 3107 class class class wbr 5030 ‘cfv 6324 (class class class)co 7135 Basecbs 16475 lecple 16564 joincjn 17546 0.cp0 17639 Latclat 17647 Atomscatm 36559 HLchlt 36646 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2113 ax-9 2121 ax-10 2142 ax-11 2158 ax-12 2175 ax-ext 2770 ax-rep 5154 ax-sep 5167 ax-nul 5174 ax-pow 5231 ax-pr 5295 ax-un 7441 |
This theorem depends on definitions: df-bi 210 df-an 400 df-or 845 df-3an 1086 df-tru 1541 df-ex 1782 df-nf 1786 df-sb 2070 df-mo 2598 df-eu 2629 df-clab 2777 df-cleq 2791 df-clel 2870 df-nfc 2938 df-ne 2988 df-ral 3111 df-rex 3112 df-reu 3113 df-rab 3115 df-v 3443 df-sbc 3721 df-csb 3829 df-dif 3884 df-un 3886 df-in 3888 df-ss 3898 df-nul 4244 df-if 4426 df-pw 4499 df-sn 4526 df-pr 4528 df-op 4532 df-uni 4801 df-iun 4883 df-br 5031 df-opab 5093 df-mpt 5111 df-id 5425 df-xp 5525 df-rel 5526 df-cnv 5527 df-co 5528 df-dm 5529 df-rn 5530 df-res 5531 df-ima 5532 df-iota 6283 df-fun 6326 df-fn 6327 df-f 6328 df-f1 6329 df-fo 6330 df-f1o 6331 df-fv 6332 df-riota 7093 df-ov 7138 df-oprab 7139 df-proset 17530 df-poset 17548 df-plt 17560 df-lub 17576 df-glb 17577 df-join 17578 df-meet 17579 df-p0 17641 df-lat 17648 df-clat 17710 df-oposet 36472 df-ol 36474 df-oml 36475 df-covers 36562 df-ats 36563 df-atl 36594 df-cvlat 36618 df-hlat 36647 |
This theorem is referenced by: pmapjat1 37149 djhcvat42 38711 |
Copyright terms: Public domain | W3C validator |