Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > cdlemg2jlemOLDN | Structured version Visualization version GIF version |
Description: Part of proof of Lemma E in [Crawley] p. 113. TODO: FIX COMMENT. f preserves join: f(r ∨ s) = f(r) ∨ s, p. 115 10th line from bottom. TODO: Combine with cdlemg2jOLDN 35886? (Contributed by NM, 22-Apr-2013.) (New usage is discouraged.) |
Ref | Expression |
---|---|
cdlemg2.b | ⊢ 𝐵 = (Base‘𝐾) |
cdlemg2.l | ⊢ ≤ = (le‘𝐾) |
cdlemg2.j | ⊢ ∨ = (join‘𝐾) |
cdlemg2.m | ⊢ ∧ = (meet‘𝐾) |
cdlemg2.a | ⊢ 𝐴 = (Atoms‘𝐾) |
cdlemg2.h | ⊢ 𝐻 = (LHyp‘𝐾) |
cdlemg2.t | ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) |
cdlemg2ex.u | ⊢ 𝑈 = ((𝑝 ∨ 𝑞) ∧ 𝑊) |
cdlemg2ex.d | ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑡) ∧ 𝑊))) |
cdlemg2ex.e | ⊢ 𝐸 = ((𝑝 ∨ 𝑞) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) |
cdlemg2ex.g | ⊢ 𝐺 = (𝑥 ∈ 𝐵 ↦ if((𝑝 ≠ 𝑞 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥)) |
Ref | Expression |
---|---|
cdlemg2jlemOLDN | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝐹 ∈ 𝑇) → (𝐹‘(𝑃 ∨ 𝑄)) = ((𝐹‘𝑃) ∨ (𝐹‘𝑄))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cdlemg2.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
2 | cdlemg2.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
3 | cdlemg2.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
4 | cdlemg2.m | . . 3 ⊢ ∧ = (meet‘𝐾) | |
5 | cdlemg2.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
6 | cdlemg2.h | . . 3 ⊢ 𝐻 = (LHyp‘𝐾) | |
7 | cdlemg2.t | . . 3 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊) | |
8 | cdlemg2ex.u | . . 3 ⊢ 𝑈 = ((𝑝 ∨ 𝑞) ∧ 𝑊) | |
9 | cdlemg2ex.d | . . 3 ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑡) ∧ 𝑊))) | |
10 | cdlemg2ex.e | . . 3 ⊢ 𝐸 = ((𝑝 ∨ 𝑞) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊))) | |
11 | cdlemg2ex.g | . . 3 ⊢ 𝐺 = (𝑥 ∈ 𝐵 ↦ if((𝑝 ≠ 𝑞 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥)) | |
12 | fveq1 6190 | . . . 4 ⊢ (𝐹 = 𝐺 → (𝐹‘(𝑃 ∨ 𝑄)) = (𝐺‘(𝑃 ∨ 𝑄))) | |
13 | fveq1 6190 | . . . . 5 ⊢ (𝐹 = 𝐺 → (𝐹‘𝑃) = (𝐺‘𝑃)) | |
14 | fveq1 6190 | . . . . 5 ⊢ (𝐹 = 𝐺 → (𝐹‘𝑄) = (𝐺‘𝑄)) | |
15 | 13, 14 | oveq12d 6668 | . . . 4 ⊢ (𝐹 = 𝐺 → ((𝐹‘𝑃) ∨ (𝐹‘𝑄)) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) |
16 | 12, 15 | eqeq12d 2637 | . . 3 ⊢ (𝐹 = 𝐺 → ((𝐹‘(𝑃 ∨ 𝑄)) = ((𝐹‘𝑃) ∨ (𝐹‘𝑄)) ↔ (𝐺‘(𝑃 ∨ 𝑄)) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄)))) |
17 | vex 3203 | . . . . 5 ⊢ 𝑠 ∈ V | |
18 | eqid 2622 | . . . . . 6 ⊢ ((𝑠 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑠) ∧ 𝑊))) = ((𝑠 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑠) ∧ 𝑊))) | |
19 | 9, 18 | cdleme31sc 35672 | . . . . 5 ⊢ (𝑠 ∈ V → ⦋𝑠 / 𝑡⦌𝐷 = ((𝑠 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑠) ∧ 𝑊)))) |
20 | 17, 19 | ax-mp 5 | . . . 4 ⊢ ⦋𝑠 / 𝑡⦌𝐷 = ((𝑠 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑠) ∧ 𝑊))) |
21 | eqid 2622 | . . . 4 ⊢ (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)) = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)) | |
22 | eqid 2622 | . . . 4 ⊢ if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) = if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) | |
23 | eqid 2622 | . . . 4 ⊢ (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))) = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))) | |
24 | 1, 2, 3, 4, 5, 6, 8, 20, 9, 10, 21, 22, 23, 11 | cdleme42mgN 35776 | . . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊) ∧ (𝑞 ∈ 𝐴 ∧ ¬ 𝑞 ≤ 𝑊)) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → (𝐺‘(𝑃 ∨ 𝑄)) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))) |
25 | 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 16, 24 | cdlemg2ce 35880 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → (𝐹‘(𝑃 ∨ 𝑄)) = ((𝐹‘𝑃) ∨ (𝐹‘𝑄))) |
26 | 25 | 3com23 1271 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝐹 ∈ 𝑇) → (𝐹‘(𝑃 ∨ 𝑄)) = ((𝐹‘𝑃) ∨ (𝐹‘𝑄))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ wa 384 ∧ w3a 1037 = wceq 1483 ∈ wcel 1990 ≠ wne 2794 ∀wral 2912 Vcvv 3200 ⦋csb 3533 ifcif 4086 class class class wbr 4653 ↦ cmpt 4729 ‘cfv 5888 ℩crio 6610 (class class class)co 6650 Basecbs 15857 lecple 15948 joincjn 16944 meetcmee 16945 Atomscatm 34550 HLchlt 34637 LHypclh 35270 LTrncltrn 35387 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-8 1992 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 ax-rep 4771 ax-sep 4781 ax-nul 4789 ax-pow 4843 ax-pr 4906 ax-un 6949 ax-riotaBAD 34239 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-eu 2474 df-mo 2475 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-ne 2795 df-nel 2898 df-ral 2917 df-rex 2918 df-reu 2919 df-rmo 2920 df-rab 2921 df-v 3202 df-sbc 3436 df-csb 3534 df-dif 3577 df-un 3579 df-in 3581 df-ss 3588 df-nul 3916 df-if 4087 df-pw 4160 df-sn 4178 df-pr 4180 df-op 4184 df-uni 4437 df-iun 4522 df-iin 4523 df-br 4654 df-opab 4713 df-mpt 4730 df-id 5024 df-xp 5120 df-rel 5121 df-cnv 5122 df-co 5123 df-dm 5124 df-rn 5125 df-res 5126 df-ima 5127 df-iota 5851 df-fun 5890 df-fn 5891 df-f 5892 df-f1 5893 df-fo 5894 df-f1o 5895 df-fv 5896 df-riota 6611 df-ov 6653 df-oprab 6654 df-mpt2 6655 df-1st 7168 df-2nd 7169 df-undef 7399 df-map 7859 df-preset 16928 df-poset 16946 df-plt 16958 df-lub 16974 df-glb 16975 df-join 16976 df-meet 16977 df-p0 17039 df-p1 17040 df-lat 17046 df-clat 17108 df-oposet 34463 df-ol 34465 df-oml 34466 df-covers 34553 df-ats 34554 df-atl 34585 df-cvlat 34609 df-hlat 34638 df-llines 34784 df-lplanes 34785 df-lvols 34786 df-lines 34787 df-psubsp 34789 df-pmap 34790 df-padd 35082 df-lhyp 35274 df-laut 35275 df-ldil 35390 df-ltrn 35391 df-trl 35446 |
This theorem is referenced by: cdlemg2jOLDN 35886 |
Copyright terms: Public domain | W3C validator |