Theorem cdlemg33c0 40696

Description: TODO: Fix comment. (Contributed by NM, 30-May-2013.)

Hypotheses

Ref	Expression
cdlemg12.l	⊢ ≤ = (le‘𝐾)
cdlemg12.j	⊢ ∨ = (join‘𝐾)
cdlemg12.m	⊢ ∧ = (meet‘𝐾)
cdlemg12.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemg12.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemg12.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemg12b.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
cdlemg31.n	⊢ 𝑁 = ((𝑃 ∨ 𝑣) ∧ (𝑄 ∨ (𝑅‘𝐹)))

Assertion

Ref	Expression
cdlemg33c0	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ≠ 𝑄 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ 𝑧 ≤ (𝑃 ∨ 𝑣)))

Distinct variable groups:   𝐴,𝑟   ∨ ,𝑟   ≤ ,𝑟   𝑃,𝑟   𝑄,𝑟   𝑊,𝑟   𝐹,𝑟   𝑧,𝐴   𝑧,𝐹,𝑟   𝐻,𝑟,𝑧   𝑧, ∨   𝐾,𝑟,𝑧   𝑧, ≤   𝑁,𝑟,𝑧   𝑧,𝑃   𝑧,𝑄   𝑧,𝑅   𝑧,𝑇   𝑧,𝑊   𝑧,𝑣,𝑟

Allowed substitution hints:   𝐴(𝑣)   𝑃(𝑣)   𝑄(𝑣)   𝑅(𝑣,𝑟)   𝑇(𝑣,𝑟)   𝐹(𝑣)   𝐻(𝑣)   ∨ (𝑣)   𝐾(𝑣)   ≤ (𝑣)   ∧ (𝑧,𝑣,𝑟)   𝑁(𝑣)   𝑊(𝑣)

Proof of Theorem cdlemg33c0

Step	Hyp	Ref	Expression
1		simp11l 1285	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ≠ 𝑄 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → 𝐾 ∈ HL)
2		simp11r 1286	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ≠ 𝑄 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → 𝑊 ∈ 𝐻)
3		simp12 1205	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ≠ 𝑄 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
4		simp13 1206	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ≠ 𝑄 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))
5		simp31 1210	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ≠ 𝑄 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → 𝑃 ≠ 𝑄)
6		simp2ll 1241	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ≠ 𝑄 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → 𝑣 ∈ 𝐴)
7		simp2lr 1242	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ≠ 𝑄 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → 𝑣 ≤ 𝑊)
8		simp12r 1288	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ≠ 𝑄 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ¬ 𝑃 ≤ 𝑊)
9		nbrne2 5127	. . . . . 6 ⊢ ((𝑣 ≤ 𝑊 ∧ ¬ 𝑃 ≤ 𝑊) → 𝑣 ≠ 𝑃)
10	9	necomd 2980	. . . . 5 ⊢ ((𝑣 ≤ 𝑊 ∧ ¬ 𝑃 ≤ 𝑊) → 𝑃 ≠ 𝑣)
11	7, 8, 10	syl2anc 584	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ≠ 𝑄 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → 𝑃 ≠ 𝑣)
12	6, 11	jca 511	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ≠ 𝑄 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → (𝑣 ∈ 𝐴 ∧ 𝑃 ≠ 𝑣))
13		simp33 1212	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ≠ 𝑄 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))
14		cdlemg12.l	. . . 4 ⊢ ≤ = (le‘𝐾)
15		cdlemg12.j	. . . 4 ⊢ ∨ = (join‘𝐾)
16		cdlemg12.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
17		cdlemg12.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
18	14, 15, 16, 17	4atex3 40075	. . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑣 ∈ 𝐴 ∧ 𝑃 ≠ 𝑣) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ (𝑧 ≠ 𝑃 ∧ 𝑧 ≠ 𝑣 ∧ 𝑧 ≤ (𝑃 ∨ 𝑣))))
19	1, 2, 3, 4, 3, 5, 12, 13, 18	syl233anc 1401	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ≠ 𝑄 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ (𝑧 ≠ 𝑃 ∧ 𝑧 ≠ 𝑣 ∧ 𝑧 ≤ (𝑃 ∨ 𝑣))))
20		simp3 1138	. . . 4 ⊢ ((𝑧 ≠ 𝑃 ∧ 𝑧 ≠ 𝑣 ∧ 𝑧 ≤ (𝑃 ∨ 𝑣)) → 𝑧 ≤ (𝑃 ∨ 𝑣))
21	20	anim2i 617	. . 3 ⊢ ((¬ 𝑧 ≤ 𝑊 ∧ (𝑧 ≠ 𝑃 ∧ 𝑧 ≠ 𝑣 ∧ 𝑧 ≤ (𝑃 ∨ 𝑣))) → (¬ 𝑧 ≤ 𝑊 ∧ 𝑧 ≤ (𝑃 ∨ 𝑣)))
22	21	reximi 3067	. 2 ⊢ (∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ (𝑧 ≠ 𝑃 ∧ 𝑧 ≠ 𝑣 ∧ 𝑧 ≤ (𝑃 ∨ 𝑣))) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ 𝑧 ≤ (𝑃 ∨ 𝑣)))
23	19, 22	syl 17	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑣 ∈ 𝐴 ∧ 𝑣 ≤ 𝑊) ∧ 𝐹 ∈ 𝑇) ∧ (𝑃 ≠ 𝑄 ∧ 𝑣 ≠ (𝑅‘𝐹) ∧ ∃𝑟 ∈ 𝐴 (¬ 𝑟 ≤ 𝑊 ∧ (𝑃 ∨ 𝑟) = (𝑄 ∨ 𝑟)))) → ∃𝑧 ∈ 𝐴 (¬ 𝑧 ≤ 𝑊 ∧ 𝑧 ≤ (𝑃 ∨ 𝑣)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109   ≠ wne 2925  ∃wrex 3053   class class class wbr 5107  ‘cfv 6511  (class class class)co 7387  lecple 17227  joincjn 18272  meetcmee 18273  Atomscatm 39256  HLchlt 39343  LHypclh 39978  LTrncltrn 40095  trLctrl 40152

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-riota 7344  df-ov 7390  df-oprab 7391  df-proset 18255  df-poset 18274  df-plt 18289  df-lub 18305  df-glb 18306  df-join 18307  df-meet 18308  df-p0 18384  df-p1 18385  df-lat 18391  df-clat 18458  df-oposet 39169  df-ol 39171  df-oml 39172  df-covers 39259  df-ats 39260  df-atl 39291  df-cvlat 39315  df-hlat 39344  df-llines 39492  df-lplanes 39493  df-lhyp 39982

This theorem is referenced by:  cdlemg33e  40704