Theorem dalem62 39677

Description: Lemma for dath 39679. Eliminate the condition 𝜓 containing dummy variables 𝑐 and 𝑑. (Contributed by NM, 11-Aug-2012.)

Hypotheses

Ref	Expression
dalem62.ph	⊢ (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈)))))
dalem62.l	⊢ ≤ = (le‘𝐾)
dalem62.j	⊢ ∨ = (join‘𝐾)
dalem62.a	⊢ 𝐴 = (Atoms‘𝐾)
dalem62.m	⊢ ∧ = (meet‘𝐾)
dalem62.o	⊢ 𝑂 = (LPlanes‘𝐾)
dalem62.y	⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅)
dalem62.z	⊢ 𝑍 = ((𝑆 ∨ 𝑇) ∨ 𝑈)
dalem62.d	⊢ 𝐷 = ((𝑃 ∨ 𝑄) ∧ (𝑆 ∨ 𝑇))
dalem62.e	⊢ 𝐸 = ((𝑄 ∨ 𝑅) ∧ (𝑇 ∨ 𝑈))
dalem62.f	⊢ 𝐹 = ((𝑅 ∨ 𝑃) ∧ (𝑈 ∨ 𝑆))

Assertion

Ref	Expression
dalem62	⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝐹 ≤ (𝐷 ∨ 𝐸))

Proof of Theorem dalem62

Dummy variables 𝑐 𝑑 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		dalem62.ph	. . 3 ⊢ (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈)))))
2		dalem62.l	. . 3 ⊢ ≤ = (le‘𝐾)
3		dalem62.j	. . 3 ⊢ ∨ = (join‘𝐾)
4		dalem62.a	. . 3 ⊢ 𝐴 = (Atoms‘𝐾)
5		biid 261	. . 3 ⊢ (((𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐴) ∧ ¬ 𝑐 ≤ 𝑌 ∧ (𝑑 ≠ 𝑐 ∧ ¬ 𝑑 ≤ 𝑌 ∧ 𝐶 ≤ (𝑐 ∨ 𝑑))) ↔ ((𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐴) ∧ ¬ 𝑐 ≤ 𝑌 ∧ (𝑑 ≠ 𝑐 ∧ ¬ 𝑑 ≤ 𝑌 ∧ 𝐶 ≤ (𝑐 ∨ 𝑑))))
6		dalem62.o	. . 3 ⊢ 𝑂 = (LPlanes‘𝐾)
7		dalem62.y	. . 3 ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅)
8		dalem62.z	. . 3 ⊢ 𝑍 = ((𝑆 ∨ 𝑇) ∨ 𝑈)
9	1, 2, 3, 4, 5, 6, 7, 8	dalem20 39636	. 2 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → ∃𝑐∃𝑑((𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐴) ∧ ¬ 𝑐 ≤ 𝑌 ∧ (𝑑 ≠ 𝑐 ∧ ¬ 𝑑 ≤ 𝑌 ∧ 𝐶 ≤ (𝑐 ∨ 𝑑))))
10		dalem62.m	. . . . 5 ⊢ ∧ = (meet‘𝐾)
11		dalem62.d	. . . . 5 ⊢ 𝐷 = ((𝑃 ∨ 𝑄) ∧ (𝑆 ∨ 𝑇))
12		dalem62.e	. . . . 5 ⊢ 𝐸 = ((𝑄 ∨ 𝑅) ∧ (𝑇 ∨ 𝑈))
13		dalem62.f	. . . . 5 ⊢ 𝐹 = ((𝑅 ∨ 𝑃) ∧ (𝑈 ∨ 𝑆))
14	1, 2, 3, 4, 5, 10, 6, 7, 8, 11, 12, 13	dalem61 39676	. . . 4 ⊢ ((𝜑 ∧ 𝑌 = 𝑍 ∧ ((𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐴) ∧ ¬ 𝑐 ≤ 𝑌 ∧ (𝑑 ≠ 𝑐 ∧ ¬ 𝑑 ≤ 𝑌 ∧ 𝐶 ≤ (𝑐 ∨ 𝑑)))) → 𝐹 ≤ (𝐷 ∨ 𝐸))
15	14	3expia 1121	. . 3 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → (((𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐴) ∧ ¬ 𝑐 ≤ 𝑌 ∧ (𝑑 ≠ 𝑐 ∧ ¬ 𝑑 ≤ 𝑌 ∧ 𝐶 ≤ (𝑐 ∨ 𝑑))) → 𝐹 ≤ (𝐷 ∨ 𝐸)))
16	15	exlimdvv 1933	. 2 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → (∃𝑐∃𝑑((𝑐 ∈ 𝐴 ∧ 𝑑 ∈ 𝐴) ∧ ¬ 𝑐 ≤ 𝑌 ∧ (𝑑 ≠ 𝑐 ∧ ¬ 𝑑 ≤ 𝑌 ∧ 𝐶 ≤ (𝑐 ∨ 𝑑))) → 𝐹 ≤ (𝐷 ∨ 𝐸)))
17	9, 16	mpd 15	1 ⊢ ((𝜑 ∧ 𝑌 = 𝑍) → 𝐹 ≤ (𝐷 ∨ 𝐸))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1539  ∃wex 1778   ∈ wcel 2107   ≠ wne 2931   class class class wbr 5125  ‘cfv 6542  (class class class)co 7414  Basecbs 17230  lecple 17284  joincjn 18332  meetcmee 18333  Atomscatm 39205  HLchlt 39292  LPlanesclpl 39435

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-8 2109  ax-9 2117  ax-10 2140  ax-11 2156  ax-12 2176  ax-ext 2706  ax-rep 5261  ax-sep 5278  ax-nul 5288  ax-pow 5347  ax-pr 5414  ax-un 7738

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1542  df-fal 1552  df-ex 1779  df-nf 1783  df-sb 2064  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2808  df-nfc 2884  df-ne 2932  df-ral 3051  df-rex 3060  df-rmo 3364  df-reu 3365  df-rab 3421  df-v 3466  df-sbc 3773  df-csb 3882  df-dif 3936  df-un 3938  df-in 3940  df-ss 3950  df-nul 4316  df-if 4508  df-pw 4584  df-sn 4609  df-pr 4611  df-op 4615  df-uni 4890  df-iun 4975  df-br 5126  df-opab 5188  df-mpt 5208  df-id 5560  df-xp 5673  df-rel 5674  df-cnv 5675  df-co 5676  df-dm 5677  df-rn 5678  df-res 5679  df-ima 5680  df-iota 6495  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549  df-fv 6550  df-riota 7371  df-ov 7417  df-oprab 7418  df-proset 18315  df-poset 18334  df-plt 18349  df-lub 18365  df-glb 18366  df-join 18367  df-meet 18368  df-p0 18444  df-p1 18445  df-lat 18451  df-clat 18518  df-oposet 39118  df-ol 39120  df-oml 39121  df-covers 39208  df-ats 39209  df-atl 39240  df-cvlat 39264  df-hlat 39293  df-llines 39441  df-lplanes 39442  df-lvols 39443

This theorem is referenced by:  dalem63  39678