Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > lhpat | Structured version Visualization version GIF version |
Description: Create an atom under a co-atom. Part of proof of Lemma B in [Crawley] p. 112. (Contributed by NM, 23-May-2012.) |
Ref | Expression |
---|---|
lhpat.l | ⊢ ≤ = (le‘𝐾) |
lhpat.j | ⊢ ∨ = (join‘𝐾) |
lhpat.m | ⊢ ∧ = (meet‘𝐾) |
lhpat.a | ⊢ 𝐴 = (Atoms‘𝐾) |
lhpat.h | ⊢ 𝐻 = (LHyp‘𝐾) |
Ref | Expression |
---|---|
lhpat | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄)) → ((𝑃 ∨ 𝑄) ∧ 𝑊) ∈ 𝐴) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | simp1l 1189 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄)) → 𝐾 ∈ HL) | |
2 | simp2l 1191 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄)) → 𝑃 ∈ 𝐴) | |
3 | simp3l 1193 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄)) → 𝑄 ∈ 𝐴) | |
4 | simp1r 1190 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄)) → 𝑊 ∈ 𝐻) | |
5 | eqid 2818 | . . . 4 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
6 | lhpat.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
7 | 5, 6 | lhpbase 37014 | . . 3 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾)) |
8 | 4, 7 | syl 17 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄)) → 𝑊 ∈ (Base‘𝐾)) |
9 | simp3r 1194 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄)) → 𝑃 ≠ 𝑄) | |
10 | eqid 2818 | . . . 4 ⊢ (1.‘𝐾) = (1.‘𝐾) | |
11 | eqid 2818 | . . . 4 ⊢ ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾) | |
12 | 10, 11, 6 | lhp1cvr 37015 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝑊( ⋖ ‘𝐾)(1.‘𝐾)) |
13 | 12 | 3ad2ant1 1125 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄)) → 𝑊( ⋖ ‘𝐾)(1.‘𝐾)) |
14 | simp2r 1192 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄)) → ¬ 𝑃 ≤ 𝑊) | |
15 | lhpat.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
16 | lhpat.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
17 | lhpat.m | . . 3 ⊢ ∧ = (meet‘𝐾) | |
18 | lhpat.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
19 | 5, 15, 16, 17, 10, 11, 18 | 1cvrat 36492 | . 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑊 ∈ (Base‘𝐾)) ∧ (𝑃 ≠ 𝑄 ∧ 𝑊( ⋖ ‘𝐾)(1.‘𝐾) ∧ ¬ 𝑃 ≤ 𝑊)) → ((𝑃 ∨ 𝑄) ∧ 𝑊) ∈ 𝐴) |
20 | 1, 2, 3, 8, 9, 13, 14, 19 | syl133anc 1385 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄)) → ((𝑃 ∨ 𝑄) ∧ 𝑊) ∈ 𝐴) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 396 ∧ w3a 1079 = wceq 1528 ∈ wcel 2105 ≠ wne 3013 class class class wbr 5057 ‘cfv 6348 (class class class)co 7145 Basecbs 16471 lecple 16560 joincjn 17542 meetcmee 17543 1.cp1 17636 ⋖ ccvr 36278 Atomscatm 36279 HLchlt 36366 LHypclh 37000 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-ral 3140 df-rex 3141 df-reu 3142 df-rab 3144 df-v 3494 df-sbc 3770 df-csb 3881 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-id 5453 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7103 df-ov 7148 df-oprab 7149 df-proset 17526 df-poset 17544 df-plt 17556 df-lub 17572 df-glb 17573 df-join 17574 df-meet 17575 df-p0 17637 df-p1 17638 df-lat 17644 df-clat 17706 df-oposet 36192 df-ol 36194 df-oml 36195 df-covers 36282 df-ats 36283 df-atl 36314 df-cvlat 36338 df-hlat 36367 df-lhyp 37004 |
This theorem is referenced by: lhpat2 37061 4atexlemex6 37090 trlat 37185 cdlemc5 37211 cdleme3e 37248 cdleme7b 37260 cdleme11k 37284 cdleme16e 37298 cdleme16f 37299 cdlemeda 37314 cdleme22cN 37358 cdleme22d 37359 cdleme23b 37366 cdlemf2 37578 cdlemg12g 37665 cdlemg17dALTN 37680 cdlemg19a 37699 |
Copyright terms: Public domain | W3C validator |