Theorem cdleme51finvfvN 41357

Description: Part of proof of Lemma E in [Crawley] p. 113. TODO: fix comment. (Contributed by NM, 14-Apr-2013.) (New usage is discouraged.)

Hypotheses

Ref	Expression
cdlemef50.b	⊢ 𝐵 = (Base‘𝐾)
cdlemef50.l	⊢ ≤ = (le‘𝐾)
cdlemef50.j	⊢ ∨ = (join‘𝐾)
cdlemef50.m	⊢ ∧ = (meet‘𝐾)
cdlemef50.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemef50.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemef50.u	⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
cdlemef50.d	⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
cdlemefs50.e	⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
cdlemef50.f	⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑃 ∨ 𝑄), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥))
cdlemef51.v	⊢ 𝑉 = ((𝑄 ∨ 𝑃) ∧ 𝑊)
cdlemef51.n	⊢ 𝑁 = ((𝑣 ∨ 𝑉) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊)))
cdlemefs51.o	⊢ 𝑂 = ((𝑄 ∨ 𝑃) ∧ (𝑁 ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊)))
cdlemef51.g	⊢ 𝐺 = (𝑎 ∈ 𝐵 ↦ if((𝑄 ≠ 𝑃 ∧ ¬ 𝑎 ≤ 𝑊), (℩𝑐 ∈ 𝐵 ∀𝑢 ∈ 𝐴 ((¬ 𝑢 ≤ 𝑊 ∧ (𝑢 ∨ (𝑎 ∧ 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = 𝑂)), ⦋𝑢 / 𝑣⦌𝑁) ∨ (𝑎 ∧ 𝑊)))), 𝑎))

Assertion

Ref	Expression
cdleme51finvfvN	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) → (◡𝐹‘𝑋) = (𝐺‘𝑋))

Distinct variable groups:   𝑎,𝑏,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧, ∧   ∨ ,𝑎,𝑏,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧   ≤ ,𝑎,𝑏,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧   𝐴,𝑎,𝑏,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧   𝐵,𝑎,𝑏,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧   𝐷,𝑎,𝑏,𝑐,𝑠,𝑣,𝑥,𝑦,𝑧   𝐸,𝑎,𝑏,𝑐,𝑥,𝑦,𝑧   𝐹,𝑎,𝑏,𝑐,𝑢,𝑣   𝐻,𝑎,𝑏,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧   𝐾,𝑎,𝑏,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧   𝑃,𝑎,𝑏,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧   𝑄,𝑎,𝑏,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧   𝑈,𝑎,𝑏,𝑐,𝑠,𝑡,𝑣,𝑥,𝑦,𝑧   𝑊,𝑎,𝑏,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧   𝑋,𝑎,𝑐,𝑠,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧   𝐺,𝑠,𝑡,𝑥,𝑦,𝑧   𝑁,𝑎,𝑏,𝑐,𝑡,𝑢,𝑥,𝑦,𝑧   𝑂,𝑎,𝑏,𝑐,𝑥,𝑦,𝑧   𝑉,𝑎,𝑏,𝑐,𝑡,𝑢,𝑣,𝑥,𝑦,𝑧

Allowed substitution hints:   𝐷(𝑢, 𝑡)   𝑈(𝑢)   𝐸(𝑣, 𝑢, 𝑡, 𝑠)   𝐹(𝑥, 𝑦, 𝑧, 𝑡, 𝑠)   𝐺(𝑣, 𝑢, 𝑎, 𝑏, 𝑐)   𝑁(𝑣, 𝑠)   𝑂(𝑣, 𝑢, 𝑡, 𝑠)   𝑉(𝑠)   𝑋(𝑏)

Proof of Theorem cdleme51finvfvN

Step	Hyp	Ref	Expression
1		cdlemef50.b	. . 3 ⊢ 𝐵 = (Base‘𝐾)
2		cdlemef50.l	. . 3 ⊢ ≤ = (le‘𝐾)
3		cdlemef50.j	. . 3 ⊢ ∨ = (join‘𝐾)
4		cdlemef50.m	. . 3 ⊢ ∧ = (meet‘𝐾)
5		cdlemef50.a	. . 3 ⊢ 𝐴 = (Atoms‘𝐾)
6		cdlemef50.h	. . 3 ⊢ 𝐻 = (LHyp‘𝐾)
7		cdlemef50.u	. . 3 ⊢ 𝑈 = ((𝑃 ∨ 𝑄) ∧ 𝑊)
8		cdlemef50.d	. . 3 ⊢ 𝐷 = ((𝑡 ∨ 𝑈) ∧ (𝑄 ∨ ((𝑃 ∨ 𝑡) ∧ 𝑊)))
9		cdlemefs50.e	. . 3 ⊢ 𝐸 = ((𝑃 ∨ 𝑄) ∧ (𝐷 ∨ ((𝑠 ∨ 𝑡) ∧ 𝑊)))
10		cdlemef50.f	. . 3 ⊢ 𝐹 = (𝑥 ∈ 𝐵 ↦ if((𝑃 ≠ 𝑄 ∧ ¬ 𝑥 ≤ 𝑊), (℩𝑧 ∈ 𝐵 ∀𝑠 ∈ 𝐴 ((¬ 𝑠 ≤ 𝑊 ∧ (𝑠 ∨ (𝑥 ∧ 𝑊)) = 𝑥) → 𝑧 = (if(𝑠 ≤ (𝑃 ∨ 𝑄), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥))
11		cdlemef51.v	. . 3 ⊢ 𝑉 = ((𝑄 ∨ 𝑃) ∧ 𝑊)
12		cdlemef51.n	. . 3 ⊢ 𝑁 = ((𝑣 ∨ 𝑉) ∧ (𝑃 ∨ ((𝑄 ∨ 𝑣) ∧ 𝑊)))
13		cdlemefs51.o	. . 3 ⊢ 𝑂 = ((𝑄 ∨ 𝑃) ∧ (𝑁 ∨ ((𝑢 ∨ 𝑣) ∧ 𝑊)))
14		cdlemef51.g	. . 3 ⊢ 𝐺 = (𝑎 ∈ 𝐵 ↦ if((𝑄 ≠ 𝑃 ∧ ¬ 𝑎 ≤ 𝑊), (℩𝑐 ∈ 𝐵 ∀𝑢 ∈ 𝐴 ((¬ 𝑢 ≤ 𝑊 ∧ (𝑢 ∨ (𝑎 ∧ 𝑊)) = 𝑎) → 𝑐 = (if(𝑢 ≤ (𝑄 ∨ 𝑃), (℩𝑏 ∈ 𝐵 ∀𝑣 ∈ 𝐴 ((¬ 𝑣 ≤ 𝑊 ∧ ¬ 𝑣 ≤ (𝑄 ∨ 𝑃)) → 𝑏 = 𝑂)), ⦋𝑢 / 𝑣⦌𝑁) ∨ (𝑎 ∧ 𝑊)))), 𝑎))
15	1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14	cdleme48fgv 41340	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) → (𝐹‘(𝐺‘𝑋)) = 𝑋)
16	1, 2, 3, 4, 5, 6, 7, 8, 9, 10	cdleme50f1o 41348	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐹:𝐵–1-1-onto→𝐵)
17	16	adantr 485	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) → 𝐹:𝐵–1-1-onto→𝐵)
18	1, 2, 3, 4, 5, 6, 11, 12, 13, 14	cdlemeg46fvcl 41308	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) → (𝐺‘𝑋) ∈ 𝐵)
19		f1ocnvfv 7276	. . 3 ⊢ ((𝐹:𝐵–1-1-onto→𝐵 ∧ (𝐺‘𝑋) ∈ 𝐵) → ((𝐹‘(𝐺‘𝑋)) = 𝑋 → (◡𝐹‘𝑋) = (𝐺‘𝑋)))
20	17, 18, 19	syl2anc 595	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) → ((𝐹‘(𝐺‘𝑋)) = 𝑋 → (◡𝐹‘𝑋) = (𝐺‘𝑋)))
21	15, 20	mpd 16	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) ∧ 𝑋 ∈ 𝐵) → (◡𝐹‘𝑋) = (𝐺‘𝑋))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 400   ∧ w3a 1102   = wceq 1569   ∈ wcel 2142   ≠ wne 2957  ∀wral 3078  ⦋csb 3852  ifcif 4486   class class class wbr 5108   ↦ cmpt 5191  ^◡ccnv 5659  –1-1-onto→wf1o 6535  ‘cfv 6536  ℩crio 7368  (class class class)co 7412  Basecbs 17275  lecple 17323  joincjn 18373  meetcmee 18374  Atomscatm 40065  HLchlt 40152  LHypclh 40786

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1824  ax-4 1838  ax-5 1939  ax-6 1996  ax-7 2037  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5237  ax-sep 5256  ax-nul 5268  ax-pow 5335  ax-pr 5403  ax-un 7734  ax-riotaBAD 39755

This proof depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1103  df-3an 1104  df-tru 1572  df-fal 1582  df-ex 1809  df-nf 1813  df-sb 2096  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3456  df-sbc 3744  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4487  df-pw 4563  df-sn 4589  df-pr 4591  df-op 4595  df-uni 4872  df-iun 4957  df-iin 4958  df-br 5109  df-opab 5173  df-mpt 5192  df-id 5555  df-xp 5666  df-rel 5667  df-cnv 5668  df-co 5669  df-dm 5670  df-rn 5671  df-res 5672  df-ima 5673  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7369  df-ov 7415  df-oprab 7416  df-mpo 7417  df-1st 7984  df-2nd 7985  df-undef 8267  df-proset 18356  df-poset 18375  df-plt 18390  df-lub 18406  df-glb 18407  df-join 18408  df-meet 18409  df-p0 18485  df-p1 18486  df-lat 18494  df-clat 18561  df-oposet 39978  df-ol 39980  df-oml 39981  df-covers 40068  df-ats 40069  df-atl 40100  df-cvlat 40124  df-hlat 40153  df-llines 40300  df-lplanes 40301  df-lvols 40302  df-lines 40303  df-psubsp 40305  df-pmap 40306  df-padd 40598  df-lhyp 40790

This theorem is used by:  cdleme51finvN  41358