cdlemkfid2N - Mathbox for Norm Megill

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

Theorem cdlemkfid2N 38864

Description: Lemma for cdlemkfid3N 38866. (Contributed by NM, 29-Jul-2013.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
cdlemk5.b	⊢ 𝐵 = (Base‘𝐾)
cdlemk5.l	⊢ ≤ = (le‘𝐾)
cdlemk5.j	⊢ ∨ = (join‘𝐾)
cdlemk5.m	⊢ ∧ = (meet‘𝐾)
cdlemk5.a	⊢ 𝐴 = (Atoms‘𝐾)
cdlemk5.h	⊢ 𝐻 = (LHyp‘𝐾)
cdlemk5.t	⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
cdlemk5.r	⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
cdlemk5.z	⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ^◡𝐹))))

**Assertion**
Ref	Expression
cdlemkfid2N	⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 = 𝑁) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ∈ 𝑇) ∧ ((𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝑍 = (𝑏‘𝑃))

**Proof of Theorem cdlemkfid2N**
Step	Hyp	Ref	Expression
1		cdlemk5.z	. 2 ⊢ 𝑍 = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ^◡𝐹))))
2		simp1r 1196	. . . . . 6 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 = 𝑁) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ∈ 𝑇) ∧ ((𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝐹 = 𝑁)
3	2	fveq1d 6758	. . . . 5 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 = 𝑁) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ∈ 𝑇) ∧ ((𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → (𝐹‘𝑃) = (𝑁‘𝑃))
4	3	oveq1d 7270	. . . 4 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 = 𝑁) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ∈ 𝑇) ∧ ((𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → ((𝐹‘𝑃) ∨ (𝑅‘(𝑏 ∘ ^◡𝐹))) = ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ^◡𝐹))))
5	4	oveq2d 7271	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 = 𝑁) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ∈ 𝑇) ∧ ((𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝐹‘𝑃) ∨ (𝑅‘(𝑏 ∘ ^◡𝐹)))) = ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ^◡𝐹)))))
6		cdlemk5.b	. . . . 5 ⊢ 𝐵 = (Base‘𝐾)
7		cdlemk5.l	. . . . 5 ⊢ ≤ = (le‘𝐾)
8		cdlemk5.j	. . . . 5 ⊢ ∨ = (join‘𝐾)
9		cdlemk5.m	. . . . 5 ⊢ ∧ = (meet‘𝐾)
10		cdlemk5.a	. . . . 5 ⊢ 𝐴 = (Atoms‘𝐾)
11		cdlemk5.h	. . . . 5 ⊢ 𝐻 = (LHyp‘𝐾)
12		cdlemk5.t	. . . . 5 ⊢ 𝑇 = ((LTrn‘𝐾)‘𝑊)
13		cdlemk5.r	. . . . 5 ⊢ 𝑅 = ((trL‘𝐾)‘𝑊)
14	6, 7, 8, 9, 10, 11, 12, 13	cdlemkfid1N 38862	. . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ∈ 𝑇) ∧ ((𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝐹‘𝑃) ∨ (𝑅‘(𝑏 ∘ ^◡𝐹)))) = (𝑏‘𝑃))
15	14	3adant1r 1175	. . 3 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 = 𝑁) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ∈ 𝑇) ∧ ((𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝐹‘𝑃) ∨ (𝑅‘(𝑏 ∘ ^◡𝐹)))) = (𝑏‘𝑃))
16	5, 15	eqtr3d 2780	. 2 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 = 𝑁) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ∈ 𝑇) ∧ ((𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → ((𝑃 ∨ (𝑅‘𝑏)) ∧ ((𝑁‘𝑃) ∨ (𝑅‘(𝑏 ∘ ^◡𝐹)))) = (𝑏‘𝑃))
17	1, 16	syl5eq 2791	1 ⊢ ((((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ 𝐹 = 𝑁) ∧ (𝐹 ∈ 𝑇 ∧ 𝐹 ≠ ( I ↾ 𝐵) ∧ 𝑏 ∈ 𝑇) ∧ ((𝑅‘𝑏) ≠ (𝑅‘𝐹) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊))) → 𝑍 = (𝑏‘𝑃))

Colors of variables: wff setvar class

Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 ∧ w3a 1085 = wceq 1539 ∈ wcel 2108 ≠ wne 2942 class class class wbr 5070 I cid 5479 ^◡ccnv 5579 ↾ cres 5582 ∘ ccom 5584 ‘cfv 6418 (class class class)co 7255 Basecbs 16840 lecple 16895 joincjn 17944 meetcmee 17945 Atomscatm 37204 HLchlt 37291 LHypclh 37925 LTrncltrn 38042 trLctrl 38099

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-rep 5205 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 ax-riotaBAD 36894

This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-reu 3070 df-rmo 3071 df-rab 3072 df-v 3424 df-sbc 3712 df-csb 3829 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-iun 4923 df-iin 4924 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-f1 6423 df-fo 6424 df-f1o 6425 df-fv 6426 df-riota 7212 df-ov 7258 df-oprab 7259 df-mpo 7260 df-1st 7804 df-2nd 7805 df-undef 8060 df-map 8575 df-proset 17928 df-poset 17946 df-plt 17963 df-lub 17979 df-glb 17980 df-join 17981 df-meet 17982 df-p0 18058 df-p1 18059 df-lat 18065 df-clat 18132 df-oposet 37117 df-ol 37119 df-oml 37120 df-covers 37207 df-ats 37208 df-atl 37239 df-cvlat 37263 df-hlat 37292 df-llines 37439 df-lplanes 37440 df-lvols 37441 df-lines 37442 df-psubsp 37444 df-pmap 37445 df-padd 37737 df-lhyp 37929 df-laut 37930 df-ldil 38045 df-ltrn 38046 df-trl 38100

This theorem is referenced by: cdlemkfid3N 38866

W3C validator