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

Theorem cdleme32fvcl 41321
Description: Part of proof of Lemma D in [Crawley] p. 113. Closure of the function 𝐹. (Contributed by NM, 10-Feb-2013.)
Hypotheses
Ref Expression
cdleme32.b 𝐵 = (Base‘𝐾)
cdleme32.l = (le‘𝐾)
cdleme32.j = (join‘𝐾)
cdleme32.m = (meet‘𝐾)
cdleme32.a 𝐴 = (Atoms‘𝐾)
cdleme32.h 𝐻 = (LHyp‘𝐾)
cdleme32.u 𝑈 = ((𝑃 𝑄) 𝑊)
cdleme32.c 𝐶 = ((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊)))
cdleme32.d 𝐷 = ((𝑡 𝑈) (𝑄 ((𝑃 𝑡) 𝑊)))
cdleme32.e 𝐸 = ((𝑃 𝑄) (𝐷 ((𝑠 𝑡) 𝑊)))
cdleme32.i 𝐼 = (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐸))
cdleme32.n 𝑁 = if(𝑠 (𝑃 𝑄), 𝐼, 𝐶)
cdleme32.o 𝑂 = (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑥 𝑊)) = 𝑥) → 𝑧 = (𝑁 (𝑥 𝑊))))
cdleme32.f 𝐹 = (𝑥𝐵 ↦ if((𝑃𝑄 ∧ ¬ 𝑥 𝑊), 𝑂, 𝑥))
Assertion
Ref Expression
cdleme32fvcl ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑋𝐵) → (𝐹𝑋) ∈ 𝐵)
Distinct variable groups:   𝑡,𝑠,𝑥,𝑦,𝑧,𝐴   𝐵,𝑠,𝑡,𝑥,𝑦,𝑧   𝑦,𝐶   𝐷,𝑠,𝑦,𝑧   𝑦,𝐸   𝐻,𝑠,𝑡   ,𝑠,𝑡,𝑥,𝑦,𝑧   𝐾,𝑠,𝑡   ,𝑠,𝑡,𝑥,𝑦,𝑧   ,𝑠,𝑡,𝑥,𝑦,𝑧   𝑥,𝑁,𝑧   𝑃,𝑠,𝑡,𝑥,𝑦,𝑧   𝑄,𝑠,𝑡,𝑥,𝑦,𝑧   𝑈,𝑠,𝑡,𝑥,𝑦,𝑧   𝑊,𝑠,𝑡,𝑥,𝑦,𝑧   𝑋,𝑠,𝑡,𝑥,𝑧   𝑦,𝐻   𝑦,𝐾   𝑧,𝐻   𝑧,𝐾
Allowed substitution hints:   𝐶(𝑥, 𝑧, 𝑡, 𝑠)   𝐷(𝑥, 𝑡)   𝐸(𝑥, 𝑧, 𝑡, 𝑠)   𝐹(𝑥, 𝑦, 𝑧, 𝑡, 𝑠)   𝐻(𝑥)   𝐼(𝑥, 𝑦, 𝑧, 𝑡, 𝑠)   𝐾(𝑥)   𝑁(𝑦, 𝑡, 𝑠)   𝑂(𝑥, 𝑦, 𝑧, 𝑡, 𝑠)   𝑋(𝑦)

Proof of Theorem cdleme32fvcl
StepHypRef Expression
1 cdleme32.o . . . . 5 𝑂 = (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑥 𝑊)) = 𝑥) → 𝑧 = (𝑁 (𝑥 𝑊))))
2 cdleme32.f . . . . 5 𝐹 = (𝑥𝐵 ↦ if((𝑃𝑄 ∧ ¬ 𝑥 𝑊), 𝑂, 𝑥))
3 eqid 2762 . . . . 5 (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑋 𝑊)) = 𝑋) → 𝑧 = (𝑁 (𝑋 𝑊)))) = (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑋 𝑊)) = 𝑋) → 𝑧 = (𝑁 (𝑋 𝑊))))
41, 2, 3cdleme31fv1 41272 . . . 4 ((𝑋𝐵 ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) → (𝐹𝑋) = (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑋 𝑊)) = 𝑋) → 𝑧 = (𝑁 (𝑋 𝑊)))))
54adantll 727 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑋𝐵) ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) → (𝐹𝑋) = (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑋 𝑊)) = 𝑋) → 𝑧 = (𝑁 (𝑋 𝑊)))))
6 simpll1 1231 . . . 4 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑋𝐵) ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) → (𝐾 ∈ HL ∧ 𝑊𝐻))
7 simpll2 1232 . . . 4 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑋𝐵) ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) → (𝑃𝐴 ∧ ¬ 𝑃 𝑊))
8 simpll3 1233 . . . 4 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑋𝐵) ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) → (𝑄𝐴 ∧ ¬ 𝑄 𝑊))
9 simprl 783 . . . 4 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑋𝐵) ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) → 𝑃𝑄)
10 simplr 781 . . . 4 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑋𝐵) ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) → 𝑋𝐵)
11 simprr 785 . . . 4 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑋𝐵) ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) → ¬ 𝑋 𝑊)
12 cdleme32.b . . . . 5 𝐵 = (Base‘𝐾)
13 cdleme32.l . . . . 5 = (le‘𝐾)
14 cdleme32.j . . . . 5 = (join‘𝐾)
15 cdleme32.m . . . . 5 = (meet‘𝐾)
16 cdleme32.a . . . . 5 𝐴 = (Atoms‘𝐾)
17 cdleme32.h . . . . 5 𝐻 = (LHyp‘𝐾)
18 cdleme32.u . . . . 5 𝑈 = ((𝑃 𝑄) 𝑊)
19 cdleme32.c . . . . 5 𝐶 = ((𝑠 𝑈) (𝑄 ((𝑃 𝑠) 𝑊)))
20 cdleme32.d . . . . 5 𝐷 = ((𝑡 𝑈) (𝑄 ((𝑃 𝑡) 𝑊)))
21 cdleme32.e . . . . 5 𝐸 = ((𝑃 𝑄) (𝐷 ((𝑠 𝑡) 𝑊)))
22 cdleme32.i . . . . 5 𝐼 = (𝑦𝐵𝑡𝐴 ((¬ 𝑡 𝑊 ∧ ¬ 𝑡 (𝑃 𝑄)) → 𝑦 = 𝐸))
23 cdleme32.n . . . . 5 𝑁 = if(𝑠 (𝑃 𝑄), 𝐼, 𝐶)
2412, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 3cdleme29cl 41258 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑃𝑄 ∧ (𝑋𝐵 ∧ ¬ 𝑋 𝑊)) → (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑋 𝑊)) = 𝑋) → 𝑧 = (𝑁 (𝑋 𝑊)))) ∈ 𝐵)
256, 7, 8, 9, 10, 11, 24syl312anc 1418 . . 3 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑋𝐵) ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) → (𝑧𝐵𝑠𝐴 ((¬ 𝑠 𝑊 ∧ (𝑠 (𝑋 𝑊)) = 𝑋) → 𝑧 = (𝑁 (𝑋 𝑊)))) ∈ 𝐵)
265, 25eqeltrd 2862 . 2 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑋𝐵) ∧ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) → (𝐹𝑋) ∈ 𝐵)
272cdleme31fv2 41274 . . . 4 ((𝑋𝐵 ∧ ¬ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) → (𝐹𝑋) = 𝑋)
28 simpl 488 . . . 4 ((𝑋𝐵 ∧ ¬ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) → 𝑋𝐵)
2927, 28eqeltrd 2862 . . 3 ((𝑋𝐵 ∧ ¬ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) → (𝐹𝑋) ∈ 𝐵)
3029adantll 727 . 2 (((((𝐾 ∈ HL ∧ 𝑊𝐻) ∧ (𝑃𝐴 ∧ ¬ 𝑃 𝑊) ∧ (𝑄𝐴 ∧ ¬ 𝑄 𝑊)) ∧ 𝑋𝐵) ∧ ¬ (𝑃𝑄 ∧ ¬ 𝑋 𝑊)) → (𝐹𝑋) ∈ 𝐵)
3126, 30pm2.61dan 825 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 2145  wne 2957  wral 3078  ifcif 4485   class class class wbr 5107  cmpt 5190  cfv 6537  crio 7373  (class class class)co 7417  Basecbs 17307  lecple 17355  joincjn 18405  meetcmee 18406  Atomscatm 40144  HLchlt 40231  LHypclh 40865
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740  ax-riotaBAD 39834
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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-iin 4957  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7374  df-ov 7420  df-oprab 7421  df-mpo 7422  df-1st 7990  df-2nd 7991  df-undef 8275  df-proset 18388  df-poset 18407  df-plt 18422  df-lub 18438  df-glb 18439  df-join 18440  df-meet 18441  df-p0 18517  df-p1 18518  df-lat 18526  df-clat 18593  df-oposet 40057  df-ol 40059  df-oml 40060  df-covers 40147  df-ats 40148  df-atl 40179  df-cvlat 40203  df-hlat 40232  df-llines 40379  df-lplanes 40380  df-lvols 40381  df-lines 40382  df-psubsp 40384  df-pmap 40385  df-padd 40677  df-lhyp 40869
This theorem is used by:  cdleme32a  41322  cdleme42b  41359  cdleme42h  41363  cdleme42i  41364  cdleme48bw  41383  cdlemeg46fvcl  41387  cdleme48d  41416  cdlemeg49lebilem  41420  cdleme50eq  41422  cdleme50f  41423
  Copyright terms: Public domain W3C validator