| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cdleme51finvtrN | Structured version Visualization version GIF version | ||
| Description: Part of proof of Lemma E in [Crawley] p. 113. TODO: fix comment. (Contributed by NM, 14-Apr-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| cdlemef50.b | ⊢ 𝐵 = (Base‘𝐾) |
| cdlemef50.l | ⊢ ≤ = (le‘𝐾) |
| cdlemef50.j | ⊢ ∨ = (join‘𝐾) |
| cdlemef50.m | ⊢ ∧ = (meet‘𝐾) |
| cdlemef50.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| cdlemef50.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| cdlemef50.u | ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) |
| cdlemef50.d | ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) |
| cdlemefs50.e | ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) |
| cdlemef50.f | ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑃 ∨ 𝑄), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥)) |
| cdleme50ltrn.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
| Ref | Expression |
|---|---|
| cdleme51finvtrN | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → ◡𝐹 ∈ 𝑇) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cdlemef50.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | cdlemef50.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
| 3 | cdlemef50.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
| 4 | cdlemef50.m | . . 3 ⊢ ∧ = (meet‘𝐾) | |
| 5 | cdlemef50.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 6 | cdlemef50.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 7 | cdlemef50.u | . . 3 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊) | |
| 8 | cdlemef50.d | . . 3 ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊))) | |
| 9 | cdlemefs50.e | . . 3 ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) | |
| 10 | cdlemef50.f | . . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑃 ∨ 𝑄), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥)) | |
| 11 | eqid 2763 | . . 3 ⊢ ((𝑄 ∨ 𝑃) ∧ 𝑊) = ((𝑄 ∨ 𝑃) ∧ 𝑊) | |
| 12 | eqid 2763 | . . 3 ⊢ ((𝑣 ∨ ((𝑄 ∨ 𝑃) ∧ 𝑊)) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊))) = ((𝑣 ∨ ((𝑄 ∨ 𝑃) ∧ 𝑊)) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊))) | |
| 13 | eqid 2763 | . . 3 ⊢ ((𝑄 ∨ 𝑃) ∧ (((𝑣 ∨ ((𝑄 ∨ 𝑃) ∧ 𝑊)) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊))) ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊))) = ((𝑄 ∨ 𝑃) ∧ (((𝑣 ∨ ((𝑄 ∨ 𝑃) ∧ 𝑊)) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊))) ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊))) | |
| 14 | eqid 2763 | . . 3 ⊢ (𝑎 ∈ 𝐵 ↦ if((𝑄 ≠ 𝑃 ∧ ¬ 𝑎 ≤ 𝑊), (℩𝑐 ∈ 𝐵 ∀𝑢 ∈ 𝐴 ((¬ 𝑢 ≤ 𝑊 ∧ (𝑢 ∨ (𝑎 ∧ 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = ((𝑄 ∨ 𝑃) ∧ (((𝑣 ∨ ((𝑄 ∨ 𝑃) ∧ 𝑊)) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊))) ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊))))), ⦋𝑢 / 𝑣⦌((𝑣 ∨ ((𝑄 ∨ 𝑃) ∧ 𝑊)) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊)))) ∨ (𝑎 ∧ 𝑊)))), 𝑎)) = (𝑎 ∈ 𝐵 ↦ if((𝑄 ≠ 𝑃 ∧ ¬ 𝑎 ≤ 𝑊), (℩𝑐 ∈ 𝐵 ∀𝑢 ∈ 𝐴 ((¬ 𝑢 ≤ 𝑊 ∧ (𝑢 ∨ (𝑎 ∧ 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = ((𝑄 ∨ 𝑃) ∧ (((𝑣 ∨ ((𝑄 ∨ 𝑃) ∧ 𝑊)) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊))) ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊))))), ⦋𝑢 / 𝑣⦌((𝑣 ∨ ((𝑄 ∨ 𝑃) ∧ 𝑊)) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊)))) ∨ (𝑎 ∧ 𝑊)))), 𝑎)) | |
| 15 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14 | cdleme51finvN 41805 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → ◡𝐹 = (𝑎 ∈ 𝐵 ↦ if((𝑄 ≠ 𝑃 ∧ ¬ 𝑎 ≤ 𝑊), (℩𝑐 ∈ 𝐵 ∀𝑢 ∈ 𝐴 ((¬ 𝑢 ≤ 𝑊 ∧ (𝑢 ∨ (𝑎 ∧ 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = ((𝑄 ∨ 𝑃) ∧ (((𝑣 ∨ ((𝑄 ∨ 𝑃) ∧ 𝑊)) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊))) ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊))))), ⦋𝑢 / 𝑣⦌((𝑣 ∨ ((𝑄 ∨ 𝑃) ∧ 𝑊)) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊)))) ∨ (𝑎 ∧ 𝑊)))), 𝑎))) |
| 16 | cdleme50ltrn.t | . . . 4 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
| 17 | 1, 2, 3, 4, 5, 6, 11, 12, 13, 14, 16 | cdleme50ltrn 41806 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑎 ∈ 𝐵 ↦ if((𝑄 ≠ 𝑃 ∧ ¬ 𝑎 ≤ 𝑊), (℩𝑐 ∈ 𝐵 ∀𝑢 ∈ 𝐴 ((¬ 𝑢 ≤ 𝑊 ∧ (𝑢 ∨ (𝑎 ∧ 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = ((𝑄 ∨ 𝑃) ∧ (((𝑣 ∨ ((𝑄 ∨ 𝑃) ∧ 𝑊)) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊))) ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊))))), ⦋𝑢 / 𝑣⦌((𝑣 ∨ ((𝑄 ∨ 𝑃) ∧ 𝑊)) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊)))) ∨ (𝑎 ∧ 𝑊)))), 𝑎)) ∈ 𝑇) |
| 18 | 17 | 3com23 1144 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → (𝑎 ∈ 𝐵 ↦ if((𝑄 ≠ 𝑃 ∧ ¬ 𝑎 ≤ 𝑊), (℩𝑐 ∈ 𝐵 ∀𝑢 ∈ 𝐴 ((¬ 𝑢 ≤ 𝑊 ∧ (𝑢 ∨ (𝑎 ∧ 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = ((𝑄 ∨ 𝑃) ∧ (((𝑣 ∨ ((𝑄 ∨ 𝑃) ∧ 𝑊)) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊))) ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊))))), ⦋𝑢 / 𝑣⦌((𝑣 ∨ ((𝑄 ∨ 𝑃) ∧ 𝑊)) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊)))) ∨ (𝑎 ∧ 𝑊)))), 𝑎)) ∈ 𝑇) |
| 19 | 15, 18 | eqeltrd 2864 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → ◡𝐹 ∈ 𝑇) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 ∀wral 3080 ⦋csb 3851 ifcif 4485 class class class wbr 5106 ↦ cmpt 5189 ◡ccnv 5654 ‘cfv 6558 ℩crio 7399 (class class class)co 7443 Basecbs 17416 lecple 17464 joincjn 18514 meetcmee 18515 Atomscatm 40512 HLchlt 40599 LHypclh 41233 LTrncltrn 41350 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5235 ax-sep 5252 ax-nul 5263 ax-pow 5331 ax-pr 5395 ax-un 7775 ax-riotaBAD 40202 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4839 df-uni 4871 df-iun 4956 df-iin 4957 df-br 5107 df-opab 5171 df-mpt 5190 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6512 df-fun 6560 df-fn 6561 df-f 6562 df-f1 6563 df-fo 6564 df-f1o 6565 df-fv 6566 df-riota 7400 df-ov 7446 df-oprab 7447 df-mpo 7448 df-1st 8025 df-2nd 8026 df-undef 8318 df-map 8877 df-proset 18497 df-poset 18516 df-plt 18531 df-lub 18547 df-glb 18548 df-join 18549 df-meet 18550 df-p0 18626 df-p1 18627 df-lat 18635 df-clat 18702 df-oposet 40425 df-ol 40427 df-oml 40428 df-covers 40515 df-ats 40516 df-atl 40547 df-cvlat 40571 df-hlat 40600 df-llines 40747 df-lplanes 40748 df-lvols 40749 df-lines 40750 df-psubsp 40752 df-pmap 40753 df-padd 41045 df-lhyp 41237 df-laut 41238 df-ldil 41353 df-ltrn 41354 |
| This theorem is used by: cdlemg1finvtrlemN 41824 |
| Copyright terms: Public domain | W3C validator |