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

Theorem cdlemg2klem 41745
Description: cdleme42keg 41636 with simpler hypotheses. TODO: FIX COMMENT. (Contributed by NM, 22-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(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥))
cdlemg2klem.v 𝑉 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
Assertion
Ref Expression
cdlemg2klem (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝐹 ∈ 𝑇) → ((𝐹‘𝑃) ∨ (𝐹‘𝑄)) = ((𝐹‘𝑃) ∨ 𝑉))
Distinct variable groups:   ∧ ,𝑠,𝑡,𝑥,𝑦,𝑧   𝐾,𝑠,𝑡,𝑥,𝑦,𝑧   𝑈,𝑠,𝑡,𝑥,𝑦,𝑧   𝑊,𝑠,𝑡,𝑥,𝑦,𝑧   ∨ ,𝑠,𝑡,𝑥,𝑦,𝑧   𝐵,𝑠,𝑡,𝑥,𝑦,𝑧   𝐴,𝑠,𝑡,𝑥,𝑦,𝑧   ≤ ,𝑠,𝑡,𝑥,𝑦,𝑧   𝐻,𝑠,𝑡,𝑥,𝑦,𝑧   𝑥,𝐸,𝑦,𝑧   𝑃,𝑠,𝑡,𝑥,𝑦,𝑧   𝐷,𝑠,𝑥,𝑦,𝑧   𝑄,𝑠,𝑡,𝑥,𝑦,𝑧   𝑞,𝑝,𝐴   𝐹,𝑝,𝑞   𝐻,𝑝,𝑞   𝐾,𝑝,𝑞   ≤ ,𝑝,𝑞   𝑇,𝑝,𝑞   𝑊,𝑝,𝑞,𝑠,𝑡,𝑥,𝑦,𝑧   ∨ ,𝑝,𝑞   𝑃,𝑝,𝑞   𝑄,𝑝,𝑞   𝐵,𝑝,𝑞   ∧ ,𝑝,𝑞   𝑉,𝑝,𝑞,𝑠,𝑡,𝑥,𝑧
Allowed substitution hints:   𝐷(𝑡, 𝑞, 𝑝)   𝑇(𝑥, 𝑦, 𝑧, 𝑡, 𝑠)   𝑈(𝑞, 𝑝)   𝐸(𝑡, 𝑠, 𝑞, 𝑝)   𝐹(𝑥, 𝑦, 𝑧, 𝑡, 𝑠)   𝐺(𝑥, 𝑦, 𝑧, 𝑡, 𝑠, 𝑞, 𝑝)   𝑉(𝑦)

Proof of Theorem cdlemg2klem
StepHypRef Expression
1 cdlemg2.b . . 3 𝐵 = (Base‘𝐾)
2 cdlemg2.l . . 3 ≤ = (le‘𝐾)
3 cdlemg2.j . . 3 ∨ = (join‘𝐾)
4 cdlemg2.m . . 3 ∧ = (meet‘𝐾)
5 cdlemg2.a . . 3 𝐴 = (Atoms‘𝐾)
6 cdlemg2.h . . 3 𝐻 = (LHyp‘𝐾)
7 cdlemg2.t . . 3 𝑇 = ((LTrn‘𝐾)‘𝑊)
8 cdlemg2ex.u . . 3 𝑈 = ((𝑝 ∨ 𝑞) ∧ 𝑊)
9 cdlemg2ex.d . . 3 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑡) ∧ 𝑊)))
10 cdlemg2ex.e . . 3 𝐸 = ((𝑝 ∨ 𝑞) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
11 cdlemg2ex.g . . 3 𝐺 = (𝑥 ∈ 𝐵 ↦ if((𝑝 ≠ 𝑞 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥))
12 fveq1 6884 . . . . 5 (𝐹 = 𝐺 → (𝐹‘𝑃) = (𝐺‘𝑃))
13 fveq1 6884 . . . . 5 (𝐹 = 𝐺 → (𝐹‘𝑄) = (𝐺‘𝑄))
1412, 13oveq12d 7438 . . . 4 (𝐹 = 𝐺 → ((𝐹‘𝑃) ∨ (𝐹‘𝑄)) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄)))
1512oveq1d 7435 . . . 4 (𝐹 = 𝐺 → ((𝐹‘𝑃) ∨ 𝑉) = ((𝐺‘𝑃) ∨ 𝑉))
1614, 15eqeq12d 2776 . . 3 (𝐹 = 𝐺 → (((𝐹‘𝑃) ∨ (𝐹‘𝑄)) = ((𝐹‘𝑃) ∨ 𝑉) ↔ ((𝐺‘𝑃) ∨ (𝐺‘𝑄)) = ((𝐺‘𝑃) ∨ 𝑉)))
17 vex 3454 . . . . 5 𝑠 ∈ V
18 eqid 2760 . . . . . 6 ((𝑠 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑠) ∧ 𝑊))) = ((𝑠 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑠) ∧ 𝑊)))
199, 18cdleme31sc 41534 . . . . 5 (𝑠 ∈ V → ⦋𝑠 / 𝑡⦌𝐷 = ((𝑠 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑠) ∧ 𝑊))))
2017, 19ax-mp 5 . . . 4 ⦋𝑠 / 𝑡⦌𝐷 = ((𝑠 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑠) ∧ 𝑊)))
21 eqid 2760 . . . 4 (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)) = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸))
22 eqid 2760 . . . 4 if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) = if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷)
23 eqid 2760 . . . 4 (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))) = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊))))
24 cdlemg2klem.v . . . 4 𝑉 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
251, 2, 3, 4, 5, 6, 8, 20, 9, 10, 21, 22, 23, 11, 24cdleme42keg 41636 . . 3 ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊) ∧ (𝑞 ∈ 𝐴 ∧ ¬ 𝑞 ≤ 𝑊)) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → ((𝐺‘𝑃) ∨ (𝐺‘𝑄)) = ((𝐺‘𝑃) ∨ 𝑉))
261, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 16, 25cdlemg2ce 41742 . 2 (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → ((𝐹‘𝑃) ∨ (𝐹‘𝑄)) = ((𝐹‘𝑃) ∨ 𝑉))
27263com23 1144 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  Vcvv 3450  ⦋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:  cdlemg2k  41751
  Copyright terms: Public domain W3C validator