Theorem cdlemg2jlemOLDN 41257

Description: Part of proof of Lemma E in [Crawley] p. 113. TODO: FIX COMMENT. f preserves join: f(r ∨ s) = f(r) ∨ s, p. 115 10th line from bottom. TODO: Combine with cdlemg2jOLDN 41262? (Contributed by NM, 22-Apr-2013.) (New usage is discouraged.)

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
cdlemg2jlemOLDN	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝐹 ∈ 𝑇) → (𝐹‘(𝑃 ∨ 𝑄)) = ((𝐹‘𝑃) ∨ (𝐹‘𝑄)))

Distinct variable groups:   ∧ ,𝑠,𝑡,𝑥,𝑦,𝑧   𝐾,𝑠,𝑡,𝑥,𝑦,𝑧   𝑈,𝑠,𝑡,𝑥,𝑦,𝑧   𝑊,𝑠,𝑡,𝑥,𝑦,𝑧   ∨ ,𝑠,𝑡,𝑥,𝑦,𝑧   𝐵,𝑠,𝑡,𝑥,𝑦,𝑧   𝐴,𝑠,𝑡,𝑥,𝑦,𝑧   ≤ ,𝑠,𝑡,𝑥,𝑦,𝑧   𝐻,𝑠,𝑡,𝑥,𝑦,𝑧   𝑥,𝐸,𝑦,𝑧   𝑃,𝑠,𝑡,𝑥,𝑦,𝑧   𝐷,𝑠,𝑥,𝑦,𝑧   𝑄,𝑠,𝑡,𝑥,𝑦,𝑧   𝑞,𝑝,𝐴   𝐹,𝑝,𝑞   𝐻,𝑝,𝑞   𝐾,𝑝,𝑞   ≤ ,𝑝,𝑞   𝑇,𝑝,𝑞   𝑊,𝑝,𝑞,𝑠,𝑡,𝑥,𝑦,𝑧   ∨ ,𝑝,𝑞   𝑃,𝑝,𝑞   𝑄,𝑝,𝑞

Allowed substitution hints:   𝐵(𝑞,𝑝)   𝐷(𝑡,𝑞,𝑝)   𝑇(𝑥,𝑦,𝑧,𝑡,𝑠)   𝑈(𝑞,𝑝)   𝐸(𝑡,𝑠,𝑞,𝑝)   𝐹(𝑥,𝑦,𝑧,𝑡,𝑠)   𝐺(𝑥,𝑦,𝑧,𝑡,𝑠,𝑞,𝑝)   ∧ (𝑞,𝑝)

Proof of Theorem cdlemg2jlemOLDN

Step	Hyp	Ref	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 6881	. . . 4 ⊢ (𝐹 = 𝐺 → (𝐹‘(𝑃 ∨ 𝑄)) = (𝐺‘(𝑃 ∨ 𝑄)))
13		fveq1 6881	. . . . 5 ⊢ (𝐹 = 𝐺 → (𝐹‘𝑃) = (𝐺‘𝑃))
14		fveq1 6881	. . . . 5 ⊢ (𝐹 = 𝐺 → (𝐹‘𝑄) = (𝐺‘𝑄))
15	13, 14	oveq12d 7429	. . . 4 ⊢ (𝐹 = 𝐺 → ((𝐹‘𝑃) ∨ (𝐹‘𝑄)) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄)))
16	12, 15	eqeq12d 2785	. . 3 ⊢ (𝐹 = 𝐺 → ((𝐹‘(𝑃 ∨ 𝑄)) = ((𝐹‘𝑃) ∨ (𝐹‘𝑄)) ↔ (𝐺‘(𝑃 ∨ 𝑄)) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄))))
17		vex 3467	. . . . 5 ⊢ 𝑠 ∈ V
18		eqid 2769	. . . . . 6 ⊢ ((𝑠 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑠) ∧ 𝑊))) = ((𝑠 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑠) ∧ 𝑊)))
19	9, 18	cdleme31sc 41048	. . . . 5 ⊢ (𝑠 ∈ V → ⦋𝑠 / 𝑡⦌𝐷 = ((𝑠 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑠) ∧ 𝑊))))
20	17, 19	ax-mp 5	. . . 4 ⊢ ⦋𝑠 / 𝑡⦌𝐷 = ((𝑠 ∨ 𝑈) ∧ (𝑞 ∨ ((𝑝 ∨ 𝑠) ∧ 𝑊)))
21		eqid 2769	. . . 4 ⊢ (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)) = (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸))
22		eqid 2769	. . . 4 ⊢ if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) = if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷)
23		eqid 2769	. . . 4 ⊢ (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))) = (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑝 ∨ 𝑞), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑝 ∨ 𝑞)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊))))
24	1, 2, 3, 4, 5, 6, 8, 20, 9, 10, 21, 22, 23, 11	cdleme42mgN 41152	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑝 ∈ 𝐴 ∧ ¬ 𝑝 ≤ 𝑊) ∧ (𝑞 ∈ 𝐴 ∧ ¬ 𝑞 ≤ 𝑊)) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → (𝐺‘(𝑃 ∨ 𝑄)) = ((𝐺‘𝑃) ∨ (𝐺‘𝑄)))
25	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 16, 24	cdlemg2ce 41256	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 ∈ 𝑇 ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊))) → (𝐹‘(𝑃 ∨ 𝑄)) = ((𝐹‘𝑃) ∨ (𝐹‘𝑄)))
26	25	3com23 1142	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ ((𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝐹 ∈ 𝑇) → (𝐹‘(𝑃 ∨ 𝑄)) = ((𝐹‘𝑃) ∨ (𝐹‘𝑄)))

Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 400   ∧ w3a 1101   = wceq 1567   ∈ wcel 2149   ≠ wne 2964  ∀wral 3085  Vcvv 3463  ⦋csb 3861  ifcif 4492   class class class wbr 5113   ↦ cmpt 5196  ‘cfv 6537  ℩crio 7367  (class class class)co 7411  Basecbs 17269  lecple 17317  joincjn 18367  meetcmee 18368  Atomscatm 39927  HLchlt 40014  LHypclh 40648  LTrncltrn 40765

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-pow 5337  ax-pr 5405  ax-un 7733  ax-riotaBAD 39617

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  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-rmo 3376  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-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-iun 4962  df-iin 4963  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-oprab 7415  df-mpo 7416  df-1st 7986  df-2nd 7987  df-undef 8269  df-map 8826  df-proset 18350  df-poset 18369  df-plt 18384  df-lub 18400  df-glb 18401  df-join 18402  df-meet 18403  df-p0 18479  df-p1 18480  df-lat 18488  df-clat 18555  df-oposet 39840  df-ol 39842  df-oml 39843  df-covers 39930  df-ats 39931  df-atl 39962  df-cvlat 39986  df-hlat 40015  df-llines 40162  df-lplanes 40163  df-lvols 40164  df-lines 40165  df-psubsp 40167  df-pmap 40168  df-padd 40460  df-lhyp 40652  df-laut 40653  df-ldil 40768  df-ltrn 40769  df-trl 40823

This theorem is referenced by:  cdlemg2jOLDN  41262