Theorem cdleme4gfv 41136

Description: Part of proof of Lemma D in [Crawley] p. 113. TODO: Can this replace uses of cdleme32a 41070? TODO: Can this be used to help prove the 𝑅 or 𝑆 case where 𝑋 is an atom? TODO: Would an antecedent transformer like cdleme46f2g2 41122 help? (Contributed by NM, 8-Apr-2013.)

Hypotheses

Ref	Expression
cdlemef47.b	⊢ 𝐵 = (Base‘𝐾)
cdlemef47.l	⊢ ≤ = (le‘𝐾)
cdlemef47.j	⊢ ∨ = (join‘𝐾)
cdlemef47.m	⊢ ∧ = (meet‘𝐾)
cdlemef47.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemef47.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemef47.v	⊢ 𝑉 = ((𝑄 ∨ 𝑃) ∧ 𝑊)
cdlemef47.n	⊢ 𝑁 = ((𝑣 ∨ 𝑉) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊)))
cdlemefs47.o	⊢ 𝑂 = ((𝑄 ∨ 𝑃) ∧ (𝑁 ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊)))
cdlemef47.g	⊢ 𝐺 = (𝑎 ∈ 𝐵 ↦ if((𝑄 ≠ 𝑃 ∧ ¬ 𝑎 ≤ 𝑊), (℩𝑐 ∈ 𝐵 ∀𝑢 ∈ 𝐴 ((¬ 𝑢 ≤ 𝑊 ∧ (𝑢 ∨ (𝑎 ∧ 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = 𝑂)), ⦋𝑢 / 𝑣⦌𝑁) ∨ (𝑎 ∧ 𝑊)))), 𝑎))

Assertion

Ref	Expression
cdleme4gfv	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑆 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → (𝐺‘𝑋) = ((𝐺‘𝑆) ∨ (𝑋 ∧ 𝑊)))

Distinct variable groups:   𝑎,𝑏,𝑐,𝑢,𝑣,𝐴   𝐵,𝑎,𝑏,𝑐,𝑢,𝑣   𝐻,𝑎,𝑏,𝑐,𝑢,𝑣   ∨ ,𝑎,𝑏,𝑐,𝑢,𝑣   𝐾,𝑎,𝑏,𝑐,𝑢,𝑣   ≤ ,𝑎,𝑏,𝑐,𝑢,𝑣   ∧ ,𝑎,𝑏,𝑐,𝑢,𝑣   𝑁,𝑎,𝑏,𝑐,𝑢   𝑂,𝑎,𝑏,𝑐   𝑃,𝑎,𝑏,𝑐,𝑢,𝑣   𝑄,𝑎,𝑏,𝑐,𝑢,𝑣   𝑆,𝑎,𝑏,𝑐,𝑢,𝑣   𝑉,𝑎,𝑏,𝑐,𝑢,𝑣   𝑊,𝑎,𝑏,𝑐,𝑢,𝑣   𝑋,𝑎,𝑐,𝑢,𝑣

Allowed substitution hints:   𝐺(𝑣,𝑢,𝑎,𝑏,𝑐)   𝑁(𝑣)   𝑂(𝑣,𝑢)   𝑋(𝑏)

Proof of Theorem cdleme4gfv

Step	Hyp	Ref	Expression
1		simp11 1218	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑆 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2		simp13 1220	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑆 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
3		simp12 1219	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑆 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
4		simp2l 1214	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑆 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → 𝑃 ≠ 𝑄)
5	4	necomd 3013	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑆 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → 𝑄 ≠ 𝑃)
6		simp2r 1215	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑆 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊))
7		simp3 1152	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑆 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑆 ∨ (𝑋 ∧ 𝑊)) = 𝑋))
8		cdlemef47.b	. . 3 ⊢ 𝐵 = (Base‘𝐾)
9		cdlemef47.l	. . 3 ⊢ ≤ = (le‘𝐾)
10		cdlemef47.j	. . 3 ⊢ ∨ = (join‘𝐾)
11		cdlemef47.m	. . 3 ⊢ ∧ = (meet‘𝐾)
12		cdlemef47.a	. . 3 ⊢ 𝐴 = (Atoms‘𝐾)
13		cdlemef47.h	. . 3 ⊢ 𝐻 = (LHyp‘𝐾)
14		cdlemef47.v	. . 3 ⊢ 𝑉 = ((𝑄 ∨ 𝑃) ∧ 𝑊)
15		cdlemef47.n	. . 3 ⊢ 𝑁 = ((𝑣 ∨ 𝑉) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊)))
16		cdlemefs47.o	. . 3 ⊢ 𝑂 = ((𝑄 ∨ 𝑃) ∧ (𝑁 ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊)))
17		cdlemef47.g	. . 3 ⊢ 𝐺 = (𝑎 ∈ 𝐵 ↦ if((𝑄 ≠ 𝑃 ∧ ¬ 𝑎 ≤ 𝑊), (℩𝑐 ∈ 𝐵 ∀𝑢 ∈ 𝐴 ((¬ 𝑢 ≤ 𝑊 ∧ (𝑢 ∨ (𝑎 ∧ 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = 𝑂)), ⦋𝑢 / 𝑣⦌𝑁) ∨ (𝑎 ∧ 𝑊)))), 𝑎))
18	8, 9, 10, 11, 12, 13, 14, 15, 16, 17	cdleme48fv 41128	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑄 ≠ 𝑃 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑆 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → (𝐺‘𝑋) = ((𝐺‘𝑆) ∨ (𝑋 ∧ 𝑊)))
19	1, 2, 3, 5, 6, 7, 18	syl321anc 1413	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ ((𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑆 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → (𝐺‘𝑋) = ((𝐺‘𝑆) ∨ (𝑋 ∧ 𝑊)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 399   ∧ w3a 1099   = wceq 1561   ∈ wcel 2143   ≠ wne 2958  ∀wral 3077  ⦋csb 3853  ifcif 4481   class class class wbr 5101   ↦ cmpt 5182  ‘cfv 6521  ℩crio 7352  (class class class)co 7396  Basecbs 17255  lecple 17303  joincjn 18353  meetcmee 18354  Atomscatm 39892  HLchlt 39979  LHypclh 40613

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1816  ax-4 1830  ax-5 1931  ax-6 1988  ax-7 2029  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5228  ax-sep 5247  ax-nul 5257  ax-pow 5323  ax-pr 5391  ax-un 7718  ax-riotaBAD 39582

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1100  df-3an 1101  df-tru 1564  df-fal 1574  df-ex 1801  df-nf 1805  df-sb 2092  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3078  df-rex 3088  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3457  df-sbc 3746  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-iun 4952  df-iin 4953  df-br 5102  df-opab 5164  df-mpt 5183  df-id 5543  df-xp 5654  df-rel 5655  df-cnv 5656  df-co 5657  df-dm 5658  df-rn 5659  df-res 5660  df-ima 5661  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-riota 7353  df-ov 7399  df-oprab 7400  df-mpo 7401  df-1st 7970  df-2nd 7971  df-undef 8253  df-proset 18336  df-poset 18355  df-plt 18370  df-lub 18386  df-glb 18387  df-join 18388  df-meet 18389  df-p0 18465  df-p1 18466  df-lat 18474  df-clat 18541  df-oposet 39805  df-ol 39807  df-oml 39808  df-covers 39895  df-ats 39896  df-atl 39927  df-cvlat 39951  df-hlat 39980  df-llines 40127  df-lplanes 40128  df-lvols 40129  df-lines 40130  df-psubsp 40132  df-pmap 40133  df-padd 40425  df-lhyp 40617

This theorem is referenced by:  cdleme48d  41164