Theorem cdleme41sn4aw 39885

Description: Part of proof of Lemma E in [Crawley] p. 113. Show that f(r) is for on and off 𝑃 ∨ 𝑄 line. TODO: FIX COMMENT. (Contributed by NM, 19-Mar-2013.)

Hypotheses

Ref	Expression
cdleme41.b	⊢ 𝐵 = (Base‘𝐾)
cdleme41.l	⊢ ≤ = (le‘𝐾)
cdleme41.j	⊢ ∨ = (join‘𝐾)
cdleme41.m	⊢ ∧ = (meet‘𝐾)
cdleme41.a	⊢ 𝐴 = (Atoms‘𝐾)
cdleme41.h	⊢ 𝐻 = (LHyp‘𝐾)
cdleme41.u	⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
cdleme41.d	⊢ 𝐷 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)))
cdleme41.e	⊢ 𝐸 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
cdleme41.g	⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
cdleme41.i	⊢ 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐺))
cdleme41.n	⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷)

Assertion

Ref	Expression
cdleme41sn4aw	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≠ 𝑆)) → ⦋𝑅 / 𝑠⦌𝑁 ≠ ⦋𝑆 / 𝑠⦌𝑁)

Distinct variable groups:   𝐴,𝑠   ∨ ,𝑠   ≤ ,𝑠   ∧ ,𝑠   𝑃,𝑠   𝑄,𝑠   𝑅,𝑠   𝑆,𝑠   𝑈,𝑠   𝑊,𝑠   𝑦,𝑡,𝐴,𝑠   𝐵,𝑠,𝑡,𝑦   𝑦,𝐷   𝑦,𝐺   𝐸,𝑠,𝑦   𝐻,𝑠,𝑡,𝑦   𝑡, ∨ ,𝑦   𝐾,𝑠,𝑡,𝑦   𝑡, ≤ ,𝑦   𝑡, ∧ ,𝑦   𝑡,𝑃,𝑦   𝑡,𝑄,𝑦   𝑡,𝑅,𝑦   𝑡,𝑆,𝑦   𝑡,𝑈,𝑦   𝑡,𝑊,𝑦

Allowed substitution hints:   𝐷(𝑡,𝑠)   𝐸(𝑡)   𝐺(𝑡,𝑠)   𝐼(𝑦,𝑡,𝑠)   𝑁(𝑦,𝑡,𝑠)

Proof of Theorem cdleme41sn4aw

Step	Hyp	Ref	Expression
1		simp1 1134	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≠ 𝑆)) → ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)))
2		simp21 1204	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≠ 𝑆)) → 𝑃 ≠ 𝑄)
3		simp23 1206	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≠ 𝑆)) → (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊))
4		simp22 1205	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≠ 𝑆)) → (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊))
5		simp32 1208	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≠ 𝑆)) → 𝑆 ≤ (𝑃 ∨ 𝑄))
6		simp31 1207	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≠ 𝑆)) → ¬ 𝑅 ≤ (𝑃 ∨ 𝑄))
7		simp33 1209	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≠ 𝑆)) → 𝑅 ≠ 𝑆)
8	7	necomd 2991	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≠ 𝑆)) → 𝑆 ≠ 𝑅)
9		cdleme41.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
10		cdleme41.l	. . . 4 ⊢ ≤ = (le‘𝐾)
11		cdleme41.j	. . . 4 ⊢ ∨ = (join‘𝐾)
12		cdleme41.m	. . . 4 ⊢ ∧ = (meet‘𝐾)
13		cdleme41.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
14		cdleme41.h	. . . 4 ⊢ 𝐻 = (LHyp‘𝐾)
15		cdleme41.u	. . . 4 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
16		cdleme41.d	. . . 4 ⊢ 𝐷 = ((𝑠 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑠) ∧ 𝑊)))
17		cdleme41.e	. . . 4 ⊢ 𝐸 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
18		cdleme41.g	. . . 4 ⊢ 𝐺 = ((𝑃 ∨ 𝑄) ∧ (𝐸 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
19		cdleme41.i	. . . 4 ⊢ 𝐼 = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐺))
20		cdleme41.n	. . . 4 ⊢ 𝑁 = if(𝑠 ≤ (𝑃 ∨ 𝑄), 𝐼, 𝐷)
21	9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20	cdleme41sn3aw 39884	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊) ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊)) ∧ (𝑆 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑆 ≠ 𝑅)) → ⦋𝑆 / 𝑠⦌𝑁 ≠ ⦋𝑅 / 𝑠⦌𝑁)
22	1, 2, 3, 4, 5, 6, 8, 21	syl133anc 1391	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≠ 𝑆)) → ⦋𝑆 / 𝑠⦌𝑁 ≠ ⦋𝑅 / 𝑠⦌𝑁)
23	22	necomd 2991	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ (𝑃 ≠ 𝑄 ∧ (𝑅 ∈ 𝐴 ∧ ¬ 𝑅 ≤ 𝑊) ∧ (𝑆 ∈ 𝐴 ∧ ¬ 𝑆 ≤ 𝑊)) ∧ (¬ 𝑅 ≤ (𝑃 ∨ 𝑄) ∧ 𝑆 ≤ (𝑃 ∨ 𝑄) ∧ 𝑅 ≠ 𝑆)) → ⦋𝑅 / 𝑠⦌𝑁 ≠ ⦋𝑆 / 𝑠⦌𝑁)

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 395   ∧ w3a 1085   = wceq 1534   ∈ wcel 2099   ≠ wne 2935  ∀wral 3056  ⦋csb 3889  ifcif 4524   class class class wbr 5142  ‘cfv 6542  ℩crio 7369  (class class class)co 7414  Basecbs 17171  lecple 17231  joincjn 18294  meetcmee 18295  Atomscatm 38672  HLchlt 38759  LHypclh 39394

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2164  ax-ext 2698  ax-rep 5279  ax-sep 5293  ax-nul 5300  ax-pow 5359  ax-pr 5423  ax-un 7734  ax-riotaBAD 38362

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3or 1086  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2529  df-eu 2558  df-clab 2705  df-cleq 2719  df-clel 2805  df-nfc 2880  df-ne 2936  df-ral 3057  df-rex 3066  df-rmo 3371  df-reu 3372  df-rab 3428  df-v 3471  df-sbc 3775  df-csb 3890  df-dif 3947  df-un 3949  df-in 3951  df-ss 3961  df-nul 4319  df-if 4525  df-pw 4600  df-sn 4625  df-pr 4627  df-op 4631  df-uni 4904  df-iun 4993  df-iin 4994  df-br 5143  df-opab 5205  df-mpt 5226  df-id 5570  df-xp 5678  df-rel 5679  df-cnv 5680  df-co 5681  df-dm 5682  df-rn 5683  df-res 5684  df-ima 5685  df-iota 6494  df-fun 6544  df-fn 6545  df-f 6546  df-f1 6547  df-fo 6548  df-f1o 6549  df-fv 6550  df-riota 7370  df-ov 7417  df-oprab 7418  df-mpo 7419  df-1st 7987  df-2nd 7988  df-undef 8272  df-proset 18278  df-poset 18296  df-plt 18313  df-lub 18329  df-glb 18330  df-join 18331  df-meet 18332  df-p0 18408  df-p1 18409  df-lat 18415  df-clat 18482  df-oposet 38585  df-ol 38587  df-oml 38588  df-covers 38675  df-ats 38676  df-atl 38707  df-cvlat 38731  df-hlat 38760  df-llines 38908  df-lplanes 38909  df-lvols 38910  df-lines 38911  df-psubsp 38913  df-pmap 38914  df-padd 39206  df-lhyp 39398

This theorem is referenced by:  cdleme41snaw  39886