cdleme50f1o - Mathbox for Norm Megill

	Mathbox for Norm Megill		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > Mathboxes > cdleme50f1o		Structured version Visualization version GIF version

Theorem cdleme50f1o 41131

Description: Part of proof of Lemma D in [Crawley] p. 113. TODO: fix comment. (Contributed by NM, 9-Apr-2013.)

**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(𝑠 ≤ (𝑃 ∨ 𝑄), (℩𝑦 ∈ 𝐵 ∀𝑡 ∈ 𝐴 ((¬ 𝑡 ≤ 𝑊 ∧ ¬ 𝑡 ≤ (𝑃 ∨ 𝑄)) → 𝑦 = 𝐸)), ⦋𝑠 / 𝑡⦌𝐷) ∨ (𝑥 ∧ 𝑊)))), 𝑥))

**Assertion**
Ref	Expression
cdleme50f1o	⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐹:𝐵–1-1-onto→𝐵)

Distinct variable groups: 𝑡,𝑠,𝑥,𝑦,𝑧, ∧ ∨ ,𝑠,𝑡,𝑥,𝑦,𝑧 ≤ ,𝑠,𝑡,𝑥,𝑦,𝑧 𝐴,𝑠,𝑡,𝑥,𝑦,𝑧 𝐵,𝑠,𝑡,𝑥,𝑦,𝑧 𝐷,𝑠,𝑥,𝑦,𝑧 𝑥,𝐸,𝑦,𝑧 𝐻,𝑠,𝑡,𝑥,𝑦,𝑧 𝐾,𝑠,𝑡,𝑥,𝑦,𝑧 𝑃,𝑠,𝑡,𝑥,𝑦,𝑧 𝑄,𝑠,𝑡,𝑥,𝑦,𝑧 𝑈,𝑠,𝑡,𝑥,𝑦,𝑧 𝑊,𝑠,𝑡,𝑥,𝑦,𝑧 Allowed substitution hints: 𝐷(𝑡) 𝐸(𝑡,𝑠) 𝐹(𝑥,𝑦,𝑧,𝑡,𝑠)

**Proof of Theorem cdleme50f1o**
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	1, 2, 3, 4, 5, 6, 7, 8, 9, 10	cdleme50f1 41128	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐹:𝐵–1-1→𝐵)
12	1, 2, 3, 4, 5, 6, 7, 8, 9, 10	cdleme50rn 41130	. 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → ran 𝐹 = 𝐵)
13		dff1o5 6811	. 2 ⊢ (𝐹:𝐵–1-1-onto→𝐵 ↔ (𝐹:𝐵–1-1→𝐵 ∧ ran 𝐹 = 𝐵))
14	11, 12, 13	sylanbrc 592	1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊) ∧ (𝑄 ∈ 𝐴 ∧ ¬ 𝑄 ≤ 𝑊)) → 𝐹:𝐵–1-1-onto→𝐵)

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 399 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 ∀wral 3075 ⦋csb 3850 ifcif 4477 class class class wbr 5097 ↦ cmpt 5178 ran crn 5644 –1-1→wf1 6513 –1-1-onto→wf1o 6515 ‘cfv 6516 ℩crio 7347 (class class class)co 7391 Basecbs 17236 lecple 17284 joincjn 18334 meetcmee 18335 Atomscatm 39848 HLchlt 39935 LHypclh 40569

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-riotaBAD 39538

This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-iun 4948 df-iin 4949 df-br 5098 df-opab 5160 df-mpt 5179 df-id 5538 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-1st 7965 df-2nd 7966 df-undef 8247 df-proset 18317 df-poset 18336 df-plt 18351 df-lub 18367 df-glb 18368 df-join 18369 df-meet 18370 df-p0 18446 df-p1 18447 df-lat 18455 df-clat 18522 df-oposet 39761 df-ol 39763 df-oml 39764 df-covers 39851 df-ats 39852 df-atl 39883 df-cvlat 39907 df-hlat 39936 df-llines 40083 df-lplanes 40084 df-lvols 40085 df-lines 40086 df-psubsp 40088 df-pmap 40089 df-padd 40381 df-lhyp 40573

This theorem is referenced by: cdleme50laut 41132 cdleme51finvfvN 41140 cdleme51finvN 41141

W3C validator