odulub - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > odulub		Structured version Visualization version GIF version

Theorem odulub 18366

Description: Least upper bounds in a dual order are greatest lower bounds in the original order. (Contributed by Stefan O'Rear, 29-Jan-2015.)

**Hypotheses**
Ref	Expression
oduglb.d	⊢ 𝐷 = (ODual‘𝑂)
odulub.l	⊢ 𝐿 = (glb‘𝑂)

**Assertion**
Ref	Expression
odulub	⊢ (𝑂 ∈ 𝑉 → 𝐿 = (lub‘𝐷))

Proof of Theorem odulub Dummy variables 𝑎 𝑏 𝑐 𝑑 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		odulub.l	. 2 ⊢ 𝐿 = (glb‘𝑂)
2		vex 3476	. . . . . . . . . . 11 ⊢ 𝑐 ∈ V
3		vex 3476	. . . . . . . . . . 11 ⊢ 𝑏 ∈ V
4	2, 3	brcnv 5883	. . . . . . . . . 10 ⊢ (𝑐^◡(le‘𝑂)𝑏 ↔ 𝑏(le‘𝑂)𝑐)
5	4	ralbii 3091	. . . . . . . . 9 ⊢ (∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑏 ↔ ∀𝑐 ∈ 𝑎 𝑏(le‘𝑂)𝑐)
6		vex 3476	. . . . . . . . . . . . 13 ⊢ 𝑑 ∈ V
7	2, 6	brcnv 5883	. . . . . . . . . . . 12 ⊢ (𝑐^◡(le‘𝑂)𝑑 ↔ 𝑑(le‘𝑂)𝑐)
8	7	ralbii 3091	. . . . . . . . . . 11 ⊢ (∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑑 ↔ ∀𝑐 ∈ 𝑎 𝑑(le‘𝑂)𝑐)
9	3, 6	brcnv 5883	. . . . . . . . . . 11 ⊢ (𝑏^◡(le‘𝑂)𝑑 ↔ 𝑑(le‘𝑂)𝑏)
10	8, 9	imbi12i 349	. . . . . . . . . 10 ⊢ ((∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑑 → 𝑏^◡(le‘𝑂)𝑑) ↔ (∀𝑐 ∈ 𝑎 𝑑(le‘𝑂)𝑐 → 𝑑(le‘𝑂)𝑏))
11	10	ralbii 3091	. . . . . . . . 9 ⊢ (∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑑 → 𝑏^◡(le‘𝑂)𝑑) ↔ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑑(le‘𝑂)𝑐 → 𝑑(le‘𝑂)𝑏))
12	5, 11	anbi12i 625	. . . . . . . 8 ⊢ ((∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑏 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑑 → 𝑏^◡(le‘𝑂)𝑑)) ↔ (∀𝑐 ∈ 𝑎 𝑏(le‘𝑂)𝑐 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑑(le‘𝑂)𝑐 → 𝑑(le‘𝑂)𝑏)))
13	12	a1i 11	. . . . . . 7 ⊢ (𝑏 ∈ (Base‘𝑂) → ((∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑏 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑑 → 𝑏^◡(le‘𝑂)𝑑)) ↔ (∀𝑐 ∈ 𝑎 𝑏(le‘𝑂)𝑐 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑑(le‘𝑂)𝑐 → 𝑑(le‘𝑂)𝑏))))
14	13	riotabiia 7390	. . . . . 6 ⊢ (℩𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑏 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑑 → 𝑏^◡(le‘𝑂)𝑑))) = (℩𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑏(le‘𝑂)𝑐 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑑(le‘𝑂)𝑐 → 𝑑(le‘𝑂)𝑏)))
15	14	mpteq2i 5254	. . . . 5 ⊢ (𝑎 ∈ 𝒫 (Base‘𝑂) ↦ (℩𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑏 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑑 → 𝑏^◡(le‘𝑂)𝑑)))) = (𝑎 ∈ 𝒫 (Base‘𝑂) ↦ (℩𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑏(le‘𝑂)𝑐 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑑(le‘𝑂)𝑐 → 𝑑(le‘𝑂)𝑏))))
16	12	reubii 3383	. . . . . 6 ⊢ (∃!𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑏 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑑 → 𝑏^◡(le‘𝑂)𝑑)) ↔ ∃!𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑏(le‘𝑂)𝑐 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑑(le‘𝑂)𝑐 → 𝑑(le‘𝑂)𝑏)))
17	16	abbii 2800	. . . . 5 ⊢ {𝑎 ∣ ∃!𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑏 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑑 → 𝑏^◡(le‘𝑂)𝑑))} = {𝑎 ∣ ∃!𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑏(le‘𝑂)𝑐 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑑(le‘𝑂)𝑐 → 𝑑(le‘𝑂)𝑏))}
18	15, 17	reseq12i 5980	. . . 4 ⊢ ((𝑎 ∈ 𝒫 (Base‘𝑂) ↦ (℩𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑏 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑑 → 𝑏^◡(le‘𝑂)𝑑)))) ↾ {𝑎 ∣ ∃!𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑏 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑑 → 𝑏^◡(le‘𝑂)𝑑))}) = ((𝑎 ∈ 𝒫 (Base‘𝑂) ↦ (℩𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑏(le‘𝑂)𝑐 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑑(le‘𝑂)𝑐 → 𝑑(le‘𝑂)𝑏)))) ↾ {𝑎 ∣ ∃!𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑏(le‘𝑂)𝑐 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑑(le‘𝑂)𝑐 → 𝑑(le‘𝑂)𝑏))})
19	18	eqcomi 2739	. . 3 ⊢ ((𝑎 ∈ 𝒫 (Base‘𝑂) ↦ (℩𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑏(le‘𝑂)𝑐 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑑(le‘𝑂)𝑐 → 𝑑(le‘𝑂)𝑏)))) ↾ {𝑎 ∣ ∃!𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑏(le‘𝑂)𝑐 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑑(le‘𝑂)𝑐 → 𝑑(le‘𝑂)𝑏))}) = ((𝑎 ∈ 𝒫 (Base‘𝑂) ↦ (℩𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑏 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑑 → 𝑏^◡(le‘𝑂)𝑑)))) ↾ {𝑎 ∣ ∃!𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑏 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑑 → 𝑏^◡(le‘𝑂)𝑑))})
20		eqid 2730	. . . 4 ⊢ (Base‘𝑂) = (Base‘𝑂)
21		eqid 2730	. . . 4 ⊢ (le‘𝑂) = (le‘𝑂)
22		eqid 2730	. . . 4 ⊢ (glb‘𝑂) = (glb‘𝑂)
23		biid 260	. . . 4 ⊢ ((∀𝑐 ∈ 𝑎 𝑏(le‘𝑂)𝑐 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑑(le‘𝑂)𝑐 → 𝑑(le‘𝑂)𝑏)) ↔ (∀𝑐 ∈ 𝑎 𝑏(le‘𝑂)𝑐 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑑(le‘𝑂)𝑐 → 𝑑(le‘𝑂)𝑏)))
24		id 22	. . . 4 ⊢ (𝑂 ∈ 𝑉 → 𝑂 ∈ 𝑉)
25	20, 21, 22, 23, 24	glbfval 18322	. . 3 ⊢ (𝑂 ∈ 𝑉 → (glb‘𝑂) = ((𝑎 ∈ 𝒫 (Base‘𝑂) ↦ (℩𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑏(le‘𝑂)𝑐 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑑(le‘𝑂)𝑐 → 𝑑(le‘𝑂)𝑏)))) ↾ {𝑎 ∣ ∃!𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑏(le‘𝑂)𝑐 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑑(le‘𝑂)𝑐 → 𝑑(le‘𝑂)𝑏))}))
26		oduglb.d	. . . . 5 ⊢ 𝐷 = (ODual‘𝑂)
27	26	fvexi 6906	. . . 4 ⊢ 𝐷 ∈ V
28	26, 20	odubas 18250	. . . . 5 ⊢ (Base‘𝑂) = (Base‘𝐷)
29	26, 21	oduleval 18248	. . . . 5 ⊢ ^◡(le‘𝑂) = (le‘𝐷)
30		eqid 2730	. . . . 5 ⊢ (lub‘𝐷) = (lub‘𝐷)
31		biid 260	. . . . 5 ⊢ ((∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑏 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑑 → 𝑏^◡(le‘𝑂)𝑑)) ↔ (∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑏 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑑 → 𝑏^◡(le‘𝑂)𝑑)))
32		id 22	. . . . 5 ⊢ (𝐷 ∈ V → 𝐷 ∈ V)
33	28, 29, 30, 31, 32	lubfval 18309	. . . 4 ⊢ (𝐷 ∈ V → (lub‘𝐷) = ((𝑎 ∈ 𝒫 (Base‘𝑂) ↦ (℩𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑏 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑑 → 𝑏^◡(le‘𝑂)𝑑)))) ↾ {𝑎 ∣ ∃!𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑏 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑑 → 𝑏^◡(le‘𝑂)𝑑))}))
34	27, 33	mp1i 13	. . 3 ⊢ (𝑂 ∈ 𝑉 → (lub‘𝐷) = ((𝑎 ∈ 𝒫 (Base‘𝑂) ↦ (℩𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑏 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑑 → 𝑏^◡(le‘𝑂)𝑑)))) ↾ {𝑎 ∣ ∃!𝑏 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑏 ∧ ∀𝑑 ∈ (Base‘𝑂)(∀𝑐 ∈ 𝑎 𝑐^◡(le‘𝑂)𝑑 → 𝑏^◡(le‘𝑂)𝑑))}))
35	19, 25, 34	3eqtr4a 2796	. 2 ⊢ (𝑂 ∈ 𝑉 → (glb‘𝑂) = (lub‘𝐷))
36	1, 35	eqtrid 2782	1 ⊢ (𝑂 ∈ 𝑉 → 𝐿 = (lub‘𝐷))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 394 = wceq 1539 ∈ wcel 2104 {cab 2707 ∀wral 3059 ∃!wreu 3372 Vcvv 3472 𝒫 cpw 4603 class class class wbr 5149 ↦ cmpt 5232 ^◡ccnv 5676 ↾ cres 5679 ‘cfv 6544 ℩crio 7368 Basecbs 17150 lecple 17210 ODualcodu 18245 lubclub 18268 glbcglb 18269

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-rep 5286 ax-sep 5300 ax-nul 5307 ax-pow 5364 ax-pr 5428 ax-un 7729 ax-cnex 11170 ax-resscn 11171 ax-1cn 11172 ax-icn 11173 ax-addcl 11174 ax-addrcl 11175 ax-mulcl 11176 ax-mulrcl 11177 ax-mulcom 11178 ax-addass 11179 ax-mulass 11180 ax-distr 11181 ax-i2m1 11182 ax-1ne0 11183 ax-1rid 11184 ax-rnegex 11185 ax-rrecex 11186 ax-cnre 11187 ax-pre-lttri 11188 ax-pre-lttrn 11189 ax-pre-ltadd 11190 ax-pre-mulgt0 11191

This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3or 1086 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3779 df-csb 3895 df-dif 3952 df-un 3954 df-in 3956 df-ss 3966 df-pss 3968 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4910 df-iun 5000 df-br 5150 df-opab 5212 df-mpt 5233 df-tr 5267 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6301 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6496 df-fun 6546 df-fn 6547 df-f 6548 df-f1 6549 df-fo 6550 df-f1o 6551 df-fv 6552 df-riota 7369 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7860 df-2nd 7980 df-frecs 8270 df-wrecs 8301 df-recs 8375 df-rdg 8414 df-er 8707 df-en 8944 df-dom 8945 df-sdom 8946 df-pnf 11256 df-mnf 11257 df-xr 11258 df-ltxr 11259 df-le 11260 df-sub 11452 df-neg 11453 df-nn 12219 df-2 12281 df-3 12282 df-4 12283 df-5 12284 df-6 12285 df-7 12286 df-8 12287 df-9 12288 df-dec 12684 df-sets 17103 df-slot 17121 df-ndx 17133 df-base 17151 df-ple 17223 df-odu 18246 df-lub 18305 df-glb 18306

This theorem is referenced by: odujoin 18367 posglbdg 18374 oduclatb 18466 glbprlem 47687

W3C validator