![]() |
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 35592. (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 35592 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ((𝑋 ≠ 0 ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → ∃𝑟 ∈ 𝐴 (𝑟 ≤ 𝑋 ∧ 𝑃 ≤ (𝑄 ∨ 𝑟)))) |
7 | hllat 35512 | . . . . . . 7 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat) | |
8 | 7 | ad2antrr 716 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → 𝐾 ∈ Lat) |
9 | simplr3 1236 | . . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → 𝑄 ∈ 𝐴) | |
10 | 1, 5 | atbase 35438 | . . . . . . 7 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ 𝐵) |
11 | 9, 10 | syl 17 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → 𝑄 ∈ 𝐵) |
12 | 1, 5 | atbase 35438 | . . . . . . 7 ⊢ (𝑟 ∈ 𝐴 → 𝑟 ∈ 𝐵) |
13 | 12 | adantl 475 | . . . . . 6 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → 𝑟 ∈ 𝐵) |
14 | 1, 3 | latjcom 17445 | . . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐵 ∧ 𝑟 ∈ 𝐵) → (𝑄 ∨ 𝑟) = (𝑟 ∨ 𝑄)) |
15 | 8, 11, 13, 14 | syl3anc 1439 | . . . . 5 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → (𝑄 ∨ 𝑟) = (𝑟 ∨ 𝑄)) |
16 | 15 | breq2d 4898 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → (𝑃 ≤ (𝑄 ∨ 𝑟) ↔ 𝑃 ≤ (𝑟 ∨ 𝑄))) |
17 | 16 | anbi2d 622 | . . 3 ⊢ (((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) ∧ 𝑟 ∈ 𝐴) → ((𝑟 ≤ 𝑋 ∧ 𝑃 ≤ (𝑄 ∨ 𝑟)) ↔ (𝑟 ≤ 𝑋 ∧ 𝑃 ≤ (𝑟 ∨ 𝑄)))) |
18 | 17 | rexbidva 3233 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → (∃𝑟 ∈ 𝐴 (𝑟 ≤ 𝑋 ∧ 𝑃 ≤ (𝑄 ∨ 𝑟)) ↔ ∃𝑟 ∈ 𝐴 (𝑟 ≤ 𝑋 ∧ 𝑃 ≤ (𝑟 ∨ 𝑄)))) |
19 | 6, 18 | sylibd 231 | 1 ⊢ ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝐵 ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴)) → ((𝑋 ≠ 0 ∧ 𝑃 ≤ (𝑋 ∨ 𝑄)) → ∃𝑟 ∈ 𝐴 (𝑟 ≤ 𝑋 ∧ 𝑃 ≤ (𝑟 ∨ 𝑄)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 386 ∧ w3a 1071 = wceq 1601 ∈ wcel 2106 ≠ wne 2968 ∃wrex 3090 class class class wbr 4886 ‘cfv 6135 (class class class)co 6922 Basecbs 16255 lecple 16345 joincjn 17330 0.cp0 17423 Latclat 17431 Atomscatm 35412 HLchlt 35499 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1839 ax-4 1853 ax-5 1953 ax-6 2021 ax-7 2054 ax-8 2108 ax-9 2115 ax-10 2134 ax-11 2149 ax-12 2162 ax-13 2333 ax-ext 2753 ax-rep 5006 ax-sep 5017 ax-nul 5025 ax-pow 5077 ax-pr 5138 ax-un 7226 |
This theorem depends on definitions: df-bi 199 df-an 387 df-or 837 df-3an 1073 df-tru 1605 df-ex 1824 df-nf 1828 df-sb 2012 df-mo 2550 df-eu 2586 df-clab 2763 df-cleq 2769 df-clel 2773 df-nfc 2920 df-ne 2969 df-ral 3094 df-rex 3095 df-reu 3096 df-rab 3098 df-v 3399 df-sbc 3652 df-csb 3751 df-dif 3794 df-un 3796 df-in 3798 df-ss 3805 df-nul 4141 df-if 4307 df-pw 4380 df-sn 4398 df-pr 4400 df-op 4404 df-uni 4672 df-iun 4755 df-br 4887 df-opab 4949 df-mpt 4966 df-id 5261 df-xp 5361 df-rel 5362 df-cnv 5363 df-co 5364 df-dm 5365 df-rn 5366 df-res 5367 df-ima 5368 df-iota 6099 df-fun 6137 df-fn 6138 df-f 6139 df-f1 6140 df-fo 6141 df-f1o 6142 df-fv 6143 df-riota 6883 df-ov 6925 df-oprab 6926 df-proset 17314 df-poset 17332 df-plt 17344 df-lub 17360 df-glb 17361 df-join 17362 df-meet 17363 df-p0 17425 df-lat 17432 df-clat 17494 df-oposet 35325 df-ol 35327 df-oml 35328 df-covers 35415 df-ats 35416 df-atl 35447 df-cvlat 35471 df-hlat 35500 |
This theorem is referenced by: pmapjat1 36002 djhcvat42 37564 |
Copyright terms: Public domain | W3C validator |