Theorem ltrniotacl 41203

Description: Version of cdleme50ltrn 41181 with simpler hypotheses. TODO: Fix comment. (Contributed by NM, 17-Apr-2013.)

Hypotheses

Ref	Expression
ltrniotaval.l	⊢ ≤ = (le‘𝐾)
ltrniotaval.a	⊢ 𝐴 = (Atoms‘𝐾)
ltrniotaval.h	⊢ 𝐻 = (LHyp‘𝐾)
ltrniotaval.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
ltrniotaval.f	⊢ 𝐹 = (℩𝑓 ∈ 𝑇 (𝑓‘𝑃) = 𝑄)

Assertion

Ref	Expression
ltrniotacl	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐹 ∈ 𝑇)

Distinct variable groups:   𝐴,𝑓   𝑓,𝐻   𝑓,𝐾   ≤ ,𝑓   𝑃,𝑓   𝑄,𝑓   𝑇,𝑓   𝑓,𝑊

Allowed substitution hint:   𝐹(𝑓)

Proof of Theorem ltrniotacl

Dummy variables 𝑠 𝑡 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2762	. 2 ⊢ (Base‘𝐾) = (Base‘𝐾)
2		ltrniotaval.l	. 2 ⊢ ≤ = (le‘𝐾)
3		eqid 2762	. 2 ⊢ (join‘𝐾) = (join‘𝐾)
4		eqid 2762	. 2 ⊢ (meet‘𝐾) = (meet‘𝐾)
5		ltrniotaval.a	. 2 ⊢ 𝐴 = (Atoms‘𝐾)
6		ltrniotaval.h	. 2 ⊢ 𝐻 = (LHyp‘𝐾)
7		eqid 2762	. 2 ⊢ ((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊) = ((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊)
8		eqid 2762	. 2 ⊢ ((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊))) = ((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊)))
9		eqid 2762	. 2 ⊢ ((𝑃(join‘𝐾)𝑄)(meet‘𝐾)(((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊)))(join‘𝐾)((𝑠(join‘𝐾)𝑡)(meet‘𝐾)𝑊))) = ((𝑃(join‘𝐾)𝑄)(meet‘𝐾)(((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊)))(join‘𝐾)((𝑠(join‘𝐾)𝑡)(meet‘𝐾)𝑊)))
10		eqid 2762	. 2 ⊢ (𝑥 ∈ (Base‘𝐾) ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ (Base‘𝐾)∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠(join‘𝐾)(𝑥(meet‘𝐾)𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑃(join‘𝐾)𝑄), (℩𝑦 ∈ (Base‘𝐾)∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃(join‘𝐾)𝑄)) → 𝑦 = ((𝑃(join‘𝐾)𝑄)(meet‘𝐾)(((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊)))(join‘𝐾)((𝑠(join‘𝐾)𝑡)(meet‘𝐾)𝑊))))), ⦋𝑠 / 𝑡⦌((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊))))(join‘𝐾)(𝑥(meet‘𝐾)𝑊)))), 𝑥)) = (𝑥 ∈ (Base‘𝐾) ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ (Base‘𝐾)∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠(join‘𝐾)(𝑥(meet‘𝐾)𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑃(join‘𝐾)𝑄), (℩𝑦 ∈ (Base‘𝐾)∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃(join‘𝐾)𝑄)) → 𝑦 = ((𝑃(join‘𝐾)𝑄)(meet‘𝐾)(((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊)))(join‘𝐾)((𝑠(join‘𝐾)𝑡)(meet‘𝐾)𝑊))))), ⦋𝑠 / 𝑡⦌((𝑡(join‘𝐾)((𝑃(join‘𝐾)𝑄)(meet‘𝐾)𝑊))(meet‘𝐾)(𝑄(join‘𝐾)((𝑃(join‘𝐾)𝑡)(meet‘𝐾)𝑊))))(join‘𝐾)(𝑥(meet‘𝐾)𝑊)))), 𝑥))
11		ltrniotaval.t	. 2 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
12		ltrniotaval.f	. 2 ⊢ 𝐹 = (℩𝑓 ∈ 𝑇 (𝑓‘𝑃) = 𝑄)
13	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12	cdlemg1ltrnlem 41198	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐹 ∈ 𝑇)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 399   ∧ w3a 1098   = wceq 1560   ∈ wcel 2142   ≠ wne 2957  ∀wral 3076  ⦋csb 3852  ifcif 4480   class class class wbr 5100   ↦ cmpt 5181  ‘cfv 6521  ℩crio 7352  (class class class)co 7396  Basecbs 17245  lecple 17293  joincjn 18343  meetcmee 18344  Atomscatm 39887  HLchlt 39974  LHypclh 40608  LTrncltrn 40725

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5227  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718  ax-riotaBAD 39577

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4951  df-iin 4952  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-riota 7353  df-ov 7399  df-oprab 7400  df-mpo 7401  df-1st 7970  df-2nd 7971  df-undef 8253  df-map 8810  df-proset 18326  df-poset 18345  df-plt 18360  df-lub 18376  df-glb 18377  df-join 18378  df-meet 18379  df-p0 18455  df-p1 18456  df-lat 18464  df-clat 18531  df-oposet 39800  df-ol 39802  df-oml 39803  df-covers 39890  df-ats 39891  df-atl 39922  df-cvlat 39946  df-hlat 39975  df-llines 40122  df-lplanes 40123  df-lvols 40124  df-lines 40125  df-psubsp 40127  df-pmap 40128  df-padd 40420  df-lhyp 40612  df-laut 40613  df-ldil 40728  df-ltrn 40729  df-trl 40783

This theorem is referenced by:  ltrniotacnvval  41206  ltrniotaidvalN  41207  ltrniotavalbN  41208  cdlemg1ci2  41210  cdlemki  41465  cdlemkj  41487  cdlemm10N  41742  dicssdvh  41810  dicvaddcl  41814  dicvscacl  41815  dicn0  41816  diclspsn  41818  cdlemn2  41819  cdlemn2a  41820  cdlemn3  41821  cdlemn4  41822  cdlemn4a  41823  cdlemn6  41826  cdlemn8  41828  cdlemn9  41829  cdlemn11a  41831  dihordlem7b  41839  dihopelvalcpre  41872  dih1  41910  dihmeetlem1N  41914  dihglblem5apreN  41915  dihglbcpreN  41924  dihmeetlem4preN  41930  dihmeetlem13N  41943  dih1dimatlem0  41952  dihatlat  41958  dihatexv  41962  dihjatcclem3  42044  dihjatcclem4  42045