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

Theorem cdlemg2fvlem 41744
Description: Lemma for cdlemg2fv 41749. (Contributed by NM, 23-Apr-2013.)
Hypotheses
Ref Expression
cdlemg2.b 𝐵 = (Base‘𝐾)
cdlemg2.l ≤ = (le‘𝐾)
cdlemg2.j ∨ = (join‘𝐾)
cdlemg2.m ∧ = (meet‘𝐾)
cdlemg2.a 𝐴 = (Atoms‘𝐾)
cdlemg2.h 𝐻 = (LHyp‘𝐾)
cdlemg2.t 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemg2ex.u 𝑈 = ((𝑝 ∨ 𝑞) ∧ 𝑊)
cdlemg2ex.d 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑡) ∧ 𝑊)))
cdlemg2ex.e 𝐸 = ((𝑝 ∨ 𝑞) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
cdlemg2ex.g 𝐺 = (𝑥 ∈ 𝐵 ↦ if((𝑝 ≠ 𝑞 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥))
Assertion
Ref Expression
cdlemg2fvlem (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → (𝐹‘𝑋) = ((𝐹‘𝑃) ∨ (𝑋 ∧ 𝑊)))
Distinct variable groups:   ∧ ,𝑠,𝑡,𝑥,𝑦,𝑧   𝐾,𝑠,𝑡,𝑥,𝑦,𝑧   𝑈,𝑠,𝑡,𝑥,𝑦,𝑧   𝑊,𝑠,𝑡,𝑥,𝑦,𝑧   ∨ ,𝑠,𝑡,𝑥,𝑦,𝑧   𝐵,𝑠,𝑡,𝑥,𝑦,𝑧   𝑋,𝑠,𝑡,𝑥,𝑦,𝑧   𝐴,𝑠,𝑡,𝑥,𝑦,𝑧   ≤ ,𝑠,𝑡,𝑥,𝑦,𝑧   𝐻,𝑠,𝑡,𝑥,𝑦,𝑧   𝑥,𝐸,𝑦,𝑧   𝑃,𝑠,𝑡,𝑥,𝑦,𝑧   𝐷,𝑠,𝑥,𝑦,𝑧   𝑞,𝑝,𝐴   𝐹,𝑝,𝑞   𝐻,𝑝,𝑞   𝐾,𝑝,𝑞   ≤ ,𝑝,𝑞   𝑇,𝑝,𝑞   𝑊,𝑝,𝑞,𝑠,𝑡,𝑥,𝑦,𝑧   ∨ ,𝑝,𝑞   𝑃,𝑝,𝑞   𝐵,𝑝,𝑞   ∧ ,𝑝,𝑞   𝑋,𝑝,𝑞
Allowed substitution hints:   𝐷(𝑡, 𝑞, 𝑝)   𝑇(𝑥, 𝑦, 𝑧, 𝑡, 𝑠)   𝑈(𝑞, 𝑝)   𝐸(𝑡, 𝑠, 𝑞, 𝑝)   𝐹(𝑥, 𝑦, 𝑧, 𝑡, 𝑠)   𝐺(𝑥, 𝑦, 𝑧, 𝑡, 𝑠, 𝑞, 𝑝)

Proof of Theorem cdlemg2fvlem
StepHypRef Expression
1 simp1 1154 . 2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → (𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻))
2 simp3l 1220 . 2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → 𝐹 ∈ 𝑇)
3 simp2r 1219 . 2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊))
4 simp2l 1218 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))
5 simp3r 1221 . . 3 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋)
64, 5jca 521 . 2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋))
7 cdlemg2.b . . 3 𝐵 = (Base‘𝐾)
8 cdlemg2.l . . 3 ≤ = (le‘𝐾)
9 cdlemg2.j . . 3 ∨ = (join‘𝐾)
10 cdlemg2.m . . 3 ∧ = (meet‘𝐾)
11 cdlemg2.a . . 3 𝐴 = (Atoms‘𝐾)
12 cdlemg2.h . . 3 𝐻 = (LHyp‘𝐾)
13 cdlemg2.t . . 3 𝑇 = ((LTrn‘𝐾)‘𝑊)
14 cdlemg2ex.u . . 3 𝑈 = ((𝑝 ∨ 𝑞) ∧ 𝑊)
15 cdlemg2ex.d . . 3 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑡) ∧ 𝑊)))
16 cdlemg2ex.e . . 3 𝐸 = ((𝑝 ∨ 𝑞) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
17 cdlemg2ex.g . . 3 𝐺 = (𝑥 ∈ 𝐵 ↦ if((𝑝 ≠ 𝑞 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥))
18 fveq1 6884 . . . 4 (𝐹 = 𝐺 → (𝐹‘𝑋) = (𝐺‘𝑋))
19 fveq1 6884 . . . . 5 (𝐹 = 𝐺 → (𝐹‘𝑃) = (𝐺‘𝑃))
2019oveq1d 7435 . . . 4 (𝐹 = 𝐺 → ((𝐹‘𝑃) ∨ (𝑋 ∧ 𝑊)) = ((𝐺‘𝑃) ∨ (𝑋 ∧ 𝑊)))
2118, 20eqeq12d 2776 . . 3 (𝐹 = 𝐺 → ((𝐹‘𝑋) = ((𝐹‘𝑃) ∨ (𝑋 ∧ 𝑊)) ↔ (𝐺‘𝑋) = ((𝐺‘𝑃) ∨ (𝑋 ∧ 𝑊))))
227, 8, 9, 10, 11, 12, 14, 15, 16, 17cdleme48fvg 41650 . . . 4 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊) ∧ (𝑞 ∈ 𝐴 ∧ ¬ 𝑞 ≤ 𝑊)) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → (𝐺‘𝑋) = ((𝐺‘𝑃) ∨ (𝑋 ∧ 𝑊)))
23223expb 1138 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊) ∧ (𝑞 ∈ 𝐴 ∧ ¬ 𝑞 ≤ 𝑊)) ∧ ((𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋))) → (𝐺‘𝑋) = ((𝐺‘𝑃) ∨ (𝑋 ∧ 𝑊)))
247, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 21, 23cdlemg2ce 41742 . 2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ ((𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋))) → (𝐹‘𝑋) = ((𝐹‘𝑃) ∨ (𝑋 ∧ 𝑊)))
251, 2, 3, 6, 24syl112anc 1401 1 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) ∧ (𝐹 ∈ 𝑇 ∧ (𝑃 ∨ (𝑋 ∧ 𝑊)) = 𝑋)) → (𝐹‘𝑋) = ((𝐹‘𝑃) ∨ (𝑋 ∧ 𝑊)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∀wral 3076  ⦋csb 3846  ifcif 4481   class class class wbr 5102   ↦ cmpt 5185  ‘cfv 6538  ℩crio 7376  (class class class)co 7420  Basecbs 17392  lecple 17440  joincjn 18490  meetcmee 18491  Atomscatm 40413  HLchlt 40500  LHypclh 41134  LTrncltrn 41251
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-riotaBAD 40103
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-iin 4953  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-mpo 7425  df-1st 8001  df-2nd 8002  df-undef 8293  df-map 8852  df-proset 18473  df-poset 18492  df-plt 18507  df-lub 18523  df-glb 18524  df-join 18525  df-meet 18526  df-p0 18602  df-p1 18603  df-lat 18611  df-clat 18678  df-oposet 40326  df-ol 40328  df-oml 40329  df-covers 40416  df-ats 40417  df-atl 40448  df-cvlat 40472  df-hlat 40501  df-llines 40648  df-lplanes 40649  df-lvols 40650  df-lines 40651  df-psubsp 40653  df-pmap 40654  df-padd 40946  df-lhyp 41138  df-laut 41139  df-ldil 41254  df-ltrn 41255  df-trl 41309
This theorem is used by:  cdlemg2fv  41749
  Copyright terms: Public domain W3C validator