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

Theorem glbconxN 35266
Description: De Morgan's law for GLB and LUB. Index-set version of glbconN 35265, where we read 𝑆 as 𝑆(𝑖). (Contributed by NM, 17-Jan-2012.) (New usage is discouraged.)
Hypotheses
Ref Expression
glbcon.b 𝐵 = (Base‘𝐾)
glbcon.u 𝑈 = (lub‘𝐾)
glbcon.g 𝐺 = (glb‘𝐾)
glbcon.o = (oc‘𝐾)
Assertion
Ref Expression
glbconxN ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → (𝐺‘{𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}) = ( ‘(𝑈‘{𝑥 ∣ ∃𝑖𝐼 𝑥 = ( 𝑆)})))
Distinct variable groups:   𝑥,𝐵   𝑥,   𝑥,𝑆   𝐵,𝑖   𝑥,𝐼   𝑖,𝐾   ,𝑖,𝑥
Allowed substitution hints:   𝑆(𝑖)   𝑈(𝑥,𝑖)   𝐺(𝑥,𝑖)   𝐼(𝑖)   𝐾(𝑥)

Proof of Theorem glbconxN
Dummy variable 𝑦 is distinct from all other variables.
StepHypRef Expression
1 vex 3353 . . . . . 6 𝑦 ∈ V
2 eqeq1 2769 . . . . . . 7 (𝑥 = 𝑦 → (𝑥 = 𝑆𝑦 = 𝑆))
32rexbidv 3199 . . . . . 6 (𝑥 = 𝑦 → (∃𝑖𝐼 𝑥 = 𝑆 ↔ ∃𝑖𝐼 𝑦 = 𝑆))
41, 3elab 3504 . . . . 5 (𝑦 ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆} ↔ ∃𝑖𝐼 𝑦 = 𝑆)
5 nfra1 3088 . . . . . 6 𝑖𝑖𝐼 𝑆𝐵
6 nfv 2009 . . . . . 6 𝑖 𝑦𝐵
7 rsp 3076 . . . . . . 7 (∀𝑖𝐼 𝑆𝐵 → (𝑖𝐼𝑆𝐵))
8 eleq1a 2839 . . . . . . 7 (𝑆𝐵 → (𝑦 = 𝑆𝑦𝐵))
97, 8syl6 35 . . . . . 6 (∀𝑖𝐼 𝑆𝐵 → (𝑖𝐼 → (𝑦 = 𝑆𝑦𝐵)))
105, 6, 9rexlimd 3173 . . . . 5 (∀𝑖𝐼 𝑆𝐵 → (∃𝑖𝐼 𝑦 = 𝑆𝑦𝐵))
114, 10syl5bi 233 . . . 4 (∀𝑖𝐼 𝑆𝐵 → (𝑦 ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆} → 𝑦𝐵))
1211ssrdv 3767 . . 3 (∀𝑖𝐼 𝑆𝐵 → {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆} ⊆ 𝐵)
13 glbcon.b . . . 4 𝐵 = (Base‘𝐾)
14 glbcon.u . . . 4 𝑈 = (lub‘𝐾)
15 glbcon.g . . . 4 𝐺 = (glb‘𝐾)
16 glbcon.o . . . 4 = (oc‘𝐾)
1713, 14, 15, 16glbconN 35265 . . 3 ((𝐾 ∈ HL ∧ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆} ⊆ 𝐵) → (𝐺‘{𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}) = ( ‘(𝑈‘{𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}})))
1812, 17sylan2 586 . 2 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → (𝐺‘{𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}) = ( ‘(𝑈‘{𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}})))
19 fvex 6388 . . . . . . . 8 ( 𝑦) ∈ V
20 eqeq1 2769 . . . . . . . . 9 (𝑥 = ( 𝑦) → (𝑥 = 𝑆 ↔ ( 𝑦) = 𝑆))
2120rexbidv 3199 . . . . . . . 8 (𝑥 = ( 𝑦) → (∃𝑖𝐼 𝑥 = 𝑆 ↔ ∃𝑖𝐼 ( 𝑦) = 𝑆))
2219, 21elab 3504 . . . . . . 7 (( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆} ↔ ∃𝑖𝐼 ( 𝑦) = 𝑆)
2322rabbii 3334 . . . . . 6 {𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}} = {𝑦𝐵 ∣ ∃𝑖𝐼 ( 𝑦) = 𝑆}
24 df-rab 3064 . . . . . 6 {𝑦𝐵 ∣ ∃𝑖𝐼 ( 𝑦) = 𝑆} = {𝑦 ∣ (𝑦𝐵 ∧ ∃𝑖𝐼 ( 𝑦) = 𝑆)}
2523, 24eqtri 2787 . . . . 5 {𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}} = {𝑦 ∣ (𝑦𝐵 ∧ ∃𝑖𝐼 ( 𝑦) = 𝑆)}
26 nfv 2009 . . . . . . . . . 10 𝑖 𝐾 ∈ HL
2726, 5nfan 1998 . . . . . . . . 9 𝑖(𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵)
28 rspa 3077 . . . . . . . . . . 11 ((∀𝑖𝐼 𝑆𝐵𝑖𝐼) → 𝑆𝐵)
29 hlop 35250 . . . . . . . . . . . . . . 15 (𝐾 ∈ HL → 𝐾 ∈ OP)
3013, 16opoccl 35082 . . . . . . . . . . . . . . 15 ((𝐾 ∈ OP ∧ 𝑆𝐵) → ( 𝑆) ∈ 𝐵)
3129, 30sylan 575 . . . . . . . . . . . . . 14 ((𝐾 ∈ HL ∧ 𝑆𝐵) → ( 𝑆) ∈ 𝐵)
32 eleq1a 2839 . . . . . . . . . . . . . 14 (( 𝑆) ∈ 𝐵 → (𝑦 = ( 𝑆) → 𝑦𝐵))
3331, 32syl 17 . . . . . . . . . . . . 13 ((𝐾 ∈ HL ∧ 𝑆𝐵) → (𝑦 = ( 𝑆) → 𝑦𝐵))
3433pm4.71rd 558 . . . . . . . . . . . 12 ((𝐾 ∈ HL ∧ 𝑆𝐵) → (𝑦 = ( 𝑆) ↔ (𝑦𝐵𝑦 = ( 𝑆))))
35 eqcom 2772 . . . . . . . . . . . . . 14 (𝑆 = ( 𝑦) ↔ ( 𝑦) = 𝑆)
3613, 16opcon2b 35085 . . . . . . . . . . . . . . . 16 ((𝐾 ∈ OP ∧ 𝑆𝐵𝑦𝐵) → (𝑆 = ( 𝑦) ↔ 𝑦 = ( 𝑆)))
3729, 36syl3an1 1202 . . . . . . . . . . . . . . 15 ((𝐾 ∈ HL ∧ 𝑆𝐵𝑦𝐵) → (𝑆 = ( 𝑦) ↔ 𝑦 = ( 𝑆)))
38373expa 1147 . . . . . . . . . . . . . 14 (((𝐾 ∈ HL ∧ 𝑆𝐵) ∧ 𝑦𝐵) → (𝑆 = ( 𝑦) ↔ 𝑦 = ( 𝑆)))
3935, 38syl5rbbr 277 . . . . . . . . . . . . 13 (((𝐾 ∈ HL ∧ 𝑆𝐵) ∧ 𝑦𝐵) → (𝑦 = ( 𝑆) ↔ ( 𝑦) = 𝑆))
4039pm5.32da 574 . . . . . . . . . . . 12 ((𝐾 ∈ HL ∧ 𝑆𝐵) → ((𝑦𝐵𝑦 = ( 𝑆)) ↔ (𝑦𝐵 ∧ ( 𝑦) = 𝑆)))
4134, 40bitrd 270 . . . . . . . . . . 11 ((𝐾 ∈ HL ∧ 𝑆𝐵) → (𝑦 = ( 𝑆) ↔ (𝑦𝐵 ∧ ( 𝑦) = 𝑆)))
4228, 41sylan2 586 . . . . . . . . . 10 ((𝐾 ∈ HL ∧ (∀𝑖𝐼 𝑆𝐵𝑖𝐼)) → (𝑦 = ( 𝑆) ↔ (𝑦𝐵 ∧ ( 𝑦) = 𝑆)))
4342anassrs 459 . . . . . . . . 9 (((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) ∧ 𝑖𝐼) → (𝑦 = ( 𝑆) ↔ (𝑦𝐵 ∧ ( 𝑦) = 𝑆)))
4427, 43rexbida 3194 . . . . . . . 8 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → (∃𝑖𝐼 𝑦 = ( 𝑆) ↔ ∃𝑖𝐼 (𝑦𝐵 ∧ ( 𝑦) = 𝑆)))
45 r19.42v 3239 . . . . . . . 8 (∃𝑖𝐼 (𝑦𝐵 ∧ ( 𝑦) = 𝑆) ↔ (𝑦𝐵 ∧ ∃𝑖𝐼 ( 𝑦) = 𝑆))
4644, 45syl6rbb 279 . . . . . . 7 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → ((𝑦𝐵 ∧ ∃𝑖𝐼 ( 𝑦) = 𝑆) ↔ ∃𝑖𝐼 𝑦 = ( 𝑆)))
4746abbidv 2884 . . . . . 6 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → {𝑦 ∣ (𝑦𝐵 ∧ ∃𝑖𝐼 ( 𝑦) = 𝑆)} = {𝑦 ∣ ∃𝑖𝐼 𝑦 = ( 𝑆)})
48 eqeq1 2769 . . . . . . . 8 (𝑦 = 𝑥 → (𝑦 = ( 𝑆) ↔ 𝑥 = ( 𝑆)))
4948rexbidv 3199 . . . . . . 7 (𝑦 = 𝑥 → (∃𝑖𝐼 𝑦 = ( 𝑆) ↔ ∃𝑖𝐼 𝑥 = ( 𝑆)))
5049cbvabv 2890 . . . . . 6 {𝑦 ∣ ∃𝑖𝐼 𝑦 = ( 𝑆)} = {𝑥 ∣ ∃𝑖𝐼 𝑥 = ( 𝑆)}
5147, 50syl6eq 2815 . . . . 5 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → {𝑦 ∣ (𝑦𝐵 ∧ ∃𝑖𝐼 ( 𝑦) = 𝑆)} = {𝑥 ∣ ∃𝑖𝐼 𝑥 = ( 𝑆)})
5225, 51syl5eq 2811 . . . 4 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → {𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}} = {𝑥 ∣ ∃𝑖𝐼 𝑥 = ( 𝑆)})
5352fveq2d 6379 . . 3 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → (𝑈‘{𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}}) = (𝑈‘{𝑥 ∣ ∃𝑖𝐼 𝑥 = ( 𝑆)}))
5453fveq2d 6379 . 2 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → ( ‘(𝑈‘{𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}})) = ( ‘(𝑈‘{𝑥 ∣ ∃𝑖𝐼 𝑥 = ( 𝑆)})))
5518, 54eqtrd 2799 1 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → (𝐺‘{𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}) = ( ‘(𝑈‘{𝑥 ∣ ∃𝑖𝐼 𝑥 = ( 𝑆)})))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 197  wa 384   = wceq 1652  wcel 2155  {cab 2751  wral 3055  wrex 3056  {crab 3059  wss 3732  cfv 6068  Basecbs 16132  occoc 16224  lubclub 17210  glbcglb 17211  OPcops 35060  HLchlt 35238
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1890  ax-4 1904  ax-5 2005  ax-6 2069  ax-7 2105  ax-8 2157  ax-9 2164  ax-10 2183  ax-11 2198  ax-12 2211  ax-13 2352  ax-ext 2743  ax-rep 4930  ax-sep 4941  ax-nul 4949  ax-pow 5001  ax-pr 5062  ax-un 7147  ax-riotaBAD 34841
This theorem depends on definitions:  df-bi 198  df-an 385  df-or 874  df-3an 1109  df-tru 1656  df-ex 1875  df-nf 1879  df-sb 2062  df-mo 2565  df-eu 2582  df-clab 2752  df-cleq 2758  df-clel 2761  df-nfc 2896  df-ne 2938  df-nel 3041  df-ral 3060  df-rex 3061  df-reu 3062  df-rmo 3063  df-rab 3064  df-v 3352  df-sbc 3597  df-csb 3692  df-dif 3735  df-un 3737  df-in 3739  df-ss 3746  df-nul 4080  df-if 4244  df-pw 4317  df-sn 4335  df-pr 4337  df-op 4341  df-uni 4595  df-iun 4678  df-br 4810  df-opab 4872  df-mpt 4889  df-id 5185  df-xp 5283  df-rel 5284  df-cnv 5285  df-co 5286  df-dm 5287  df-rn 5288  df-res 5289  df-ima 5290  df-iota 6031  df-fun 6070  df-fn 6071  df-f 6072  df-f1 6073  df-fo 6074  df-f1o 6075  df-fv 6076  df-riota 6803  df-ov 6845  df-undef 7602  df-lub 17242  df-glb 17243  df-clat 17376  df-oposet 35064  df-ol 35066  df-oml 35067  df-hlat 35239
This theorem is referenced by:  polval2N  35794
  Copyright terms: Public domain W3C validator