Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  cdlemefs29cpre1N Structured version   Visualization version   GIF version

Theorem cdlemefs29cpre1N 41666
Description: TODO: FIX COMMENT. (Contributed by NM, 26-Mar-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
cdlemefs32.b 𝐵 = (Base‘𝐾)
cdlemefs32.l ≤ = (le‘𝐾)
cdlemefs32.j ∨ = (join‘𝐾)
cdlemefs32.m ∧ = (meet‘𝐾)
cdlemefs32.a 𝐴 = (Atoms‘𝐾)
cdlemefs32.h 𝐻 = (LHyp‘𝐾)
cdlemefs32.u 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
cdlemefs32.d 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
cdlemefs32.e 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
cdlemefs32.i 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸))
cdlemefs32.n 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶)
Assertion
Ref Expression
cdlemefs29cpre1N ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ∃!𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 (((¬ 𝑠 ≤ 𝑊 ∧ 𝑠 ≤ (𝑃 ∨ 𝑄)) ∧ (𝑠 ∨ (𝑅 ∧ 𝑊)) = 𝑅) → 𝑧 = (𝑁 ∨ (𝑅 ∧ 𝑊))))
Distinct variable groups:   𝑡,𝑠,𝑦,𝑧,𝐴   𝐵,𝑠,𝑡,𝑦,𝑧   𝑦,𝐷   𝑦,𝐸   𝐻,𝑠,𝑡,𝑦   ∨ ,𝑠,𝑡,𝑦,𝑧   𝐾,𝑠,𝑡,𝑦   ≤ ,𝑠,𝑡,𝑦,𝑧   ∧ ,𝑠,𝑡,𝑦,𝑧   𝑧,𝑁   𝑃,𝑠,𝑡,𝑦,𝑧   𝑄,𝑠,𝑡,𝑦,𝑧   𝑅,𝑠,𝑡,𝑦   𝑡,𝑈,𝑦   𝑊,𝑠,𝑡,𝑦,𝑧   𝐷,𝑠   𝑧,𝐻   𝑧,𝐾   𝑧,𝑅
Allowed substitution hints:   𝐶(𝑦, 𝑧, 𝑡, 𝑠)   𝐷(𝑧, 𝑡)   𝑈(𝑧, 𝑠)   𝐸(𝑧, 𝑡, 𝑠)   𝐼(𝑦, 𝑧, 𝑡, 𝑠)   𝑁(𝑦, 𝑡, 𝑠)

Proof of Theorem cdlemefs29cpre1N
StepHypRef Expression
1 cdlemefs32.b . 2 𝐵 = (Base‘𝐾)
2 cdlemefs32.l . 2 ≤ = (le‘𝐾)
3 cdlemefs32.j . 2 ∨ = (join‘𝐾)
4 cdlemefs32.m . 2 ∧ = (meet‘𝐾)
5 cdlemefs32.a . 2 𝐴 = (Atoms‘𝐾)
6 cdlemefs32.h . 2 𝐻 = (LHyp‘𝐾)
7 breq1 5109 . 2 (𝑠 = 𝑅 → (𝑠 ≤ (𝑃 ∨ 𝑄) ↔ 𝑅 ≤ (𝑃 ∨ 𝑄)))
8 simp1 1154 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ 𝑠 ≤ (𝑃 ∨ 𝑄)))) → ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)))
9 simp3l 1220 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ 𝑠 ≤ (𝑃 ∨ 𝑄)))) → 𝑠 ∈ 𝐴)
10 simp3rl 1265 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ 𝑠 ≤ (𝑃 ∨ 𝑄)))) → ¬ 𝑠 ≤ 𝑊)
119, 10jca 521 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ 𝑠 ≤ (𝑃 ∨ 𝑄)))) → (𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊))
12 simp3rr 1266 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ 𝑠 ≤ (𝑃 ∨ 𝑄)))) → 𝑠 ≤ (𝑃 ∨ 𝑄))
13 simp2 1155 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ 𝑠 ≤ (𝑃 ∨ 𝑄)))) → 𝑃 ≠ 𝑄)
14 cdlemefs32.u . . . 4 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
15 cdlemefs32.d . . . 4 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
16 cdlemefs32.e . . . 4 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
17 cdlemefs32.i . . . 4 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸))
18 cdlemefs32.n . . . 4 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐶)
191, 2, 3, 4, 5, 6, 14, 15, 16, 17, 18cdlemefs27cl 41661 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ ((𝑠 ∈ 𝐴 ∧ ¬ 𝑠 ≤ 𝑊) ∧ 𝑠 ≤ (𝑃 ∨ 𝑄) ∧ 𝑃 ≠ 𝑄)) → 𝑁 ∈ 𝐵)
208, 11, 12, 13, 19syl13anc 1400 . 2 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑃 ≠ 𝑄 ∧ (𝑠 ∈ 𝐴 ∧ (¬ 𝑠 ≤ 𝑊 ∧ 𝑠 ≤ (𝑃 ∨ 𝑄)))) → 𝑁 ∈ 𝐵)
211, 2, 3, 4, 5, 6, 14, 15, 16, 17, 18cdlemefs32snb 41663 . 2 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ 𝑅 ≤ (𝑃 ∨ 𝑄)) → ⦋𝑅 / 𝑠⦌𝑁 ∈ 𝐵)
221, 2, 3, 4, 5, 6, 7, 20, 21cdlemefrs29cpre1 41646 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  ∃!wreu 3367  ifcif 4485   class class class wbr 5106  ‘cfv 6555  ℩crio 7396  (class class class)co 7440  Basecbs 17413  lecple 17461  joincjn 18511  meetcmee 18512  Atomscatm 40511  HLchlt 40598  LHypclh 41232
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 7772  ax-riotaBAD 40201
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 6509  df-fun 6557  df-fn 6558  df-f 6559  df-f1 6560  df-fo 6561  df-f1o 6562  df-fv 6563  df-riota 7397  df-ov 7443  df-oprab 7444  df-mpo 7445  df-1st 8022  df-2nd 8023  df-undef 8315  df-proset 18494  df-poset 18513  df-plt 18528  df-lub 18544  df-glb 18545  df-join 18546  df-meet 18547  df-p0 18623  df-p1 18624  df-lat 18632  df-clat 18699  df-oposet 40424  df-ol 40426  df-oml 40427  df-covers 40514  df-ats 40515  df-atl 40546  df-cvlat 40570  df-hlat 40599  df-llines 40746  df-lplanes 40747  df-lvols 40748  df-lines 40749  df-psubsp 40751  df-pmap 40752  df-padd 41044  df-lhyp 41236
This theorem is used by: (None)
  Copyright terms: Public domain W3C validator