Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemefs27cl | Structured version Visualization version GIF version |
Description: Part of proof of Lemma E in [Crawley] p. 113. Closure of 𝑁. TODO FIX COMMENT This is the start of a re-proof of cdleme27cl 37494 etc. with the 𝑠 ≤ (𝑃 ∨ 𝑄) condition (so as to not have the 𝐶 hypothesis). (Contributed by NM, 24-Mar-2013.) |
Ref | Expression |
---|---|
cdlemefs26.b | ⊢ 𝐵 = (Base‘𝐾) |
cdlemefs26.l | ⊢ ≤ = (le‘𝐾) |
cdlemefs26.j | ⊢ ∨ = (join‘𝐾) |
cdlemefs26.m | ⊢ ∧ = (meet‘𝐾) |
cdlemefs26.a | ⊢ 𝐴 = (Atoms‘𝐾) |
cdlemefs26.h | ⊢ 𝐻 = (LHyp‘𝐾) |
cdlemefs27.u | ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) |
cdlemefs27.d | ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) |
cdlemefs27.e | ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) |
cdlemefs27.i | ⊢ 𝐼 = (℩𝑢 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝐸)) |
cdlemefs27.n | ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) |
Ref | Expression |
---|---|
cdlemefs27cl | ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ 𝑠 ≤ (𝑃 ∨ 𝑄) ∧ 𝑃 ≠ 𝑄)) → 𝑁 ∈ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cdlemefs27.n | . 2 ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) | |
2 | simpr2 1190 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ 𝑠 ≤ (𝑃 ∨ 𝑄) ∧ 𝑃 ≠ 𝑄)) → 𝑠 ≤ (𝑃 ∨ 𝑄)) | |
3 | 2 | iftrued 4473 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ 𝑠 ≤ (𝑃 ∨ 𝑄) ∧ 𝑃 ≠ 𝑄)) → if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) = 𝐼) |
4 | simpl1 1186 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ 𝑠 ≤ (𝑃 ∨ 𝑄) ∧ 𝑃 ≠ 𝑄)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻)) | |
5 | simpl2 1187 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ 𝑠 ≤ (𝑃 ∨ 𝑄) ∧ 𝑃 ≠ 𝑄)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) | |
6 | simpl3 1188 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ 𝑠 ≤ (𝑃 ∨ 𝑄) ∧ 𝑃 ≠ 𝑄)) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) | |
7 | simpr1 1189 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ 𝑠 ≤ (𝑃 ∨ 𝑄) ∧ 𝑃 ≠ 𝑄)) → (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊)) | |
8 | simpr3 1191 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ 𝑠 ≤ (𝑃 ∨ 𝑄) ∧ 𝑃 ≠ 𝑄)) → 𝑃 ≠ 𝑄) | |
9 | cdlemefs26.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
10 | cdlemefs26.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
11 | cdlemefs26.j | . . . . 5 ⊢ ∨ = (join‘𝐾) | |
12 | cdlemefs26.m | . . . . 5 ⊢ ∧ = (meet‘𝐾) | |
13 | cdlemefs26.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
14 | cdlemefs26.h | . . . . 5 ⊢ 𝐻 = (LHyp‘𝐾) | |
15 | cdlemefs27.u | . . . . 5 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) | |
16 | cdlemefs27.d | . . . . 5 ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) | |
17 | cdlemefs27.e | . . . . 5 ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) | |
18 | cdlemefs27.i | . . . . 5 ⊢ 𝐼 = (℩𝑢 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑢 = 𝐸)) | |
19 | 9, 10, 11, 12, 13, 14, 15, 16, 17, 18 | cdleme25cl 37485 | . . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ (𝑃 ≠ 𝑄 ∧ 𝑠 ≤ (𝑃 ∨ 𝑄))) → 𝐼 ∈ 𝐵) |
20 | 4, 5, 6, 7, 8, 2, 19 | syl312anc 1386 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ 𝑠 ≤ (𝑃 ∨ 𝑄) ∧ 𝑃 ≠ 𝑄)) → 𝐼 ∈ 𝐵) |
21 | 3, 20 | eqeltrd 2911 | . 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ 𝑠 ≤ (𝑃 ∨ 𝑄) ∧ 𝑃 ≠ 𝑄)) → if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶) ∈ 𝐵) |
22 | 1, 21 | eqeltrid 2915 | 1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ 𝑠 ≤ (𝑃 ∨ 𝑄) ∧ 𝑃 ≠ 𝑄)) → 𝑁 ∈ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 398 ∧ w3a 1082 = wceq 1531 ∈ wcel 2108 ≠ wne 3014 ∀wral 3136 ifcif 4465 class class class wbr 5057 ‘cfv 6348 ℩crio 7105 (class class class)co 7148 Basecbs 16475 lecple 16564 joincjn 17546 meetcmee 17547 Atomscatm 36391 HLchlt 36478 LHypclh 37112 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1905 ax-6 1964 ax-7 2009 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2154 ax-12 2170 ax-ext 2791 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7453 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1083 df-3an 1084 df-tru 1534 df-ex 1775 df-nf 1779 df-sb 2064 df-mo 2616 df-eu 2648 df-clab 2798 df-cleq 2812 df-clel 2891 df-nfc 2961 df-ne 3015 df-ral 3141 df-rex 3142 df-reu 3143 df-rmo 3144 df-rab 3145 df-v 3495 df-sbc 3771 df-csb 3882 df-dif 3937 df-un 3939 df-in 3941 df-ss 3950 df-nul 4290 df-if 4466 df-pw 4539 df-sn 4560 df-pr 4562 df-op 4566 df-uni 4831 df-iun 4912 df-iin 4913 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 7106 df-ov 7151 df-oprab 7152 df-mpo 7153 df-1st 7681 df-2nd 7682 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-p1 17642 df-lat 17648 df-clat 17710 df-oposet 36304 df-ol 36306 df-oml 36307 df-covers 36394 df-ats 36395 df-atl 36426 df-cvlat 36450 df-hlat 36479 df-llines 36626 df-lplanes 36627 df-lvols 36628 df-lines 36629 df-psubsp 36631 df-pmap 36632 df-padd 36924 df-lhyp 37116 |
This theorem is referenced by: cdlemefs29bpre0N 37544 cdlemefs29bpre1N 37545 cdlemefs29cpre1N 37546 cdlemefs29clN 37547 cdlemefs32fvaN 37550 cdlemefs32fva1 37551 |
Copyright terms: Public domain | W3C validator |