Theorem dihvalc 41896

Description: Value of isomorphism H for a lattice 𝐾 when ¬ 𝑋 ≤ 𝑊. (Contributed by NM, 4-Mar-2014.)

Hypotheses

Ref	Expression
dihval.b	⊢ 𝐵 = (Base‘𝐾)
dihval.l	⊢ ≤ = (le‘𝐾)
dihval.j	⊢ ∨ = (join‘𝐾)
dihval.m	⊢ ∧ = (meet‘𝐾)
dihval.a	⊢ 𝐴 = (Atoms‘𝐾)
dihval.h	⊢ 𝐻 = (LHyp‘𝐾)
dihval.i	⊢ 𝐼 = ((DIsoH‘𝐾)‘𝑊)
dihval.d	⊢ 𝐷 = ((DIsoB‘𝐾)‘𝑊)
dihval.c	⊢ 𝐶 = ((DIsoC‘𝐾)‘𝑊)
dihval.u	⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
dihval.s	⊢ 𝑆 = (LSubSp‘𝑈)
dihval.p	⊢ ⊕ = (LSSum‘𝑈)

Assertion

Ref	Expression
dihvalc	⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝐼‘𝑋) = (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑋 ∧ 𝑊))))))

Distinct variable groups:   𝐴,𝑞   𝑢,𝑞,𝐾   𝑢,𝑆   𝑊,𝑞,𝑢   𝑋,𝑞,𝑢

Allowed substitution hints:   𝐴(𝑢)   𝐵(𝑢,𝑞)   𝐶(𝑢,𝑞)   𝐷(𝑢,𝑞)   ⊕ (𝑢,𝑞)   𝑆(𝑞)   𝑈(𝑢,𝑞)   𝐻(𝑢,𝑞)   𝐼(𝑢,𝑞)   ∨ (𝑢,𝑞)   ≤ (𝑢,𝑞)   ∧ (𝑢,𝑞)   𝑉(𝑢,𝑞)

Proof of Theorem dihvalc

Step	Hyp	Ref	Expression
1		dihval.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
2		dihval.l	. . . 4 ⊢ ≤ = (le‘𝐾)
3		dihval.j	. . . 4 ⊢ ∨ = (join‘𝐾)
4		dihval.m	. . . 4 ⊢ ∧ = (meet‘𝐾)
5		dihval.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
6		dihval.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
7		dihval.i	. . . 4 ⊢ 𝐼 = ((DIsoH‘𝐾)‘𝑊)
8		dihval.d	. . . 4 ⊢ 𝐷 = ((DIsoB‘𝐾)‘𝑊)
9		dihval.c	. . . 4 ⊢ 𝐶 = ((DIsoC‘𝐾)‘𝑊)
10		dihval.u	. . . 4 ⊢ 𝑈 = ((DVecH‘𝐾)‘𝑊)
11		dihval.s	. . . 4 ⊢ 𝑆 = (LSubSp‘𝑈)
12		dihval.p	. . . 4 ⊢ ⊕ = (LSSum‘𝑈)
13	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12	dihval 41895	. . 3 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) → (𝐼‘𝑋) = if(𝑋 ≤ 𝑊, (𝐷‘𝑋), (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑋 ∧ 𝑊)))))))
14		iffalse 4501	. . 3 ⊢ (¬ 𝑋 ≤ 𝑊 → if(𝑋 ≤ 𝑊, (𝐷‘𝑋), (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑋 ∧ 𝑊)))))) = (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑋 ∧ 𝑊))))))
15	13, 14	sylan9eq 2824	. 2 ⊢ ((((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑋 ≤ 𝑊) → (𝐼‘𝑋) = (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑋 ∧ 𝑊))))))
16	15	anasss 471	1 ⊢ (((𝐾 ∈ 𝑉 ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝐼‘𝑋) = (℩𝑢 ∈ 𝑆 ∀𝑞 ∈ 𝐴 ((¬ 𝑞 ≤ 𝑊 ∧ (𝑞 ∨ (𝑋 ∧ 𝑊)) = 𝑋) → 𝑢 = ((𝐶‘𝑞) ⊕ (𝐷‘(𝑋 ∧ 𝑊))))))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   = wceq 1567   ∈ wcel 2149  ∀wral 3085  ifcif 4492   class class class wbr 5113  ‘cfv 6537  ℩crio 7367  (class class class)co 7411  Basecbs 17268  lecple 17316  joincjn 18366  meetcmee 18367  LSSumclsm 19703  LSubSpclss 21029  Atomscatm 39926  LHypclh 40647  DVecHcdvh 41741  DIsoBcdib 41801  DIsoCcdic 41835  DIsoHcdih 41891

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pr 5405

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-id 5557  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  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 7368  df-ov 7414  df-dih 41892

This theorem is referenced by:  dihlsscpre  41897  dihvalcqpre  41898