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 34179
Description: De Morgan's law for GLB and LUB. Index-set version of glbconN 34178, 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 3192 . . . . . 6 𝑦 ∈ V
2 eqeq1 2625 . . . . . . 7 (𝑥 = 𝑦 → (𝑥 = 𝑆𝑦 = 𝑆))
32rexbidv 3046 . . . . . 6 (𝑥 = 𝑦 → (∃𝑖𝐼 𝑥 = 𝑆 ↔ ∃𝑖𝐼 𝑦 = 𝑆))
41, 3elab 3337 . . . . 5 (𝑦 ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆} ↔ ∃𝑖𝐼 𝑦 = 𝑆)
5 nfra1 2936 . . . . . 6 𝑖𝑖𝐼 𝑆𝐵
6 nfv 1840 . . . . . 6 𝑖 𝑦𝐵
7 rsp 2924 . . . . . . 7 (∀𝑖𝐼 𝑆𝐵 → (𝑖𝐼𝑆𝐵))
8 eleq1a 2693 . . . . . . 7 (𝑆𝐵 → (𝑦 = 𝑆𝑦𝐵))
97, 8syl6 35 . . . . . 6 (∀𝑖𝐼 𝑆𝐵 → (𝑖𝐼 → (𝑦 = 𝑆𝑦𝐵)))
105, 6, 9rexlimd 3020 . . . . 5 (∀𝑖𝐼 𝑆𝐵 → (∃𝑖𝐼 𝑦 = 𝑆𝑦𝐵))
114, 10syl5bi 232 . . . 4 (∀𝑖𝐼 𝑆𝐵 → (𝑦 ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆} → 𝑦𝐵))
1211ssrdv 3593 . . 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 34178 . . 3 ((𝐾 ∈ HL ∧ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆} ⊆ 𝐵) → (𝐺‘{𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}) = ( ‘(𝑈‘{𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}})))
1812, 17sylan2 491 . 2 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → (𝐺‘{𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}) = ( ‘(𝑈‘{𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}})))
19 fvex 6163 . . . . . . . . 9 ( 𝑦) ∈ V
20 eqeq1 2625 . . . . . . . . . 10 (𝑥 = ( 𝑦) → (𝑥 = 𝑆 ↔ ( 𝑦) = 𝑆))
2120rexbidv 3046 . . . . . . . . 9 (𝑥 = ( 𝑦) → (∃𝑖𝐼 𝑥 = 𝑆 ↔ ∃𝑖𝐼 ( 𝑦) = 𝑆))
2219, 21elab 3337 . . . . . . . 8 (( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆} ↔ ∃𝑖𝐼 ( 𝑦) = 𝑆)
2322a1i 11 . . . . . . 7 (𝑦𝐵 → (( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆} ↔ ∃𝑖𝐼 ( 𝑦) = 𝑆))
2423rabbiia 3176 . . . . . 6 {𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}} = {𝑦𝐵 ∣ ∃𝑖𝐼 ( 𝑦) = 𝑆}
25 df-rab 2916 . . . . . 6 {𝑦𝐵 ∣ ∃𝑖𝐼 ( 𝑦) = 𝑆} = {𝑦 ∣ (𝑦𝐵 ∧ ∃𝑖𝐼 ( 𝑦) = 𝑆)}
2624, 25eqtri 2643 . . . . 5 {𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}} = {𝑦 ∣ (𝑦𝐵 ∧ ∃𝑖𝐼 ( 𝑦) = 𝑆)}
27 nfv 1840 . . . . . . . . . 10 𝑖 𝐾 ∈ HL
2827, 5nfan 1825 . . . . . . . . 9 𝑖(𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵)
29 rspa 2925 . . . . . . . . . . 11 ((∀𝑖𝐼 𝑆𝐵𝑖𝐼) → 𝑆𝐵)
30 hlop 34164 . . . . . . . . . . . . . . 15 (𝐾 ∈ HL → 𝐾 ∈ OP)
3113, 16opoccl 33996 . . . . . . . . . . . . . . 15 ((𝐾 ∈ OP ∧ 𝑆𝐵) → ( 𝑆) ∈ 𝐵)
3230, 31sylan 488 . . . . . . . . . . . . . 14 ((𝐾 ∈ HL ∧ 𝑆𝐵) → ( 𝑆) ∈ 𝐵)
33 eleq1a 2693 . . . . . . . . . . . . . 14 (( 𝑆) ∈ 𝐵 → (𝑦 = ( 𝑆) → 𝑦𝐵))
3432, 33syl 17 . . . . . . . . . . . . 13 ((𝐾 ∈ HL ∧ 𝑆𝐵) → (𝑦 = ( 𝑆) → 𝑦𝐵))
3534pm4.71rd 666 . . . . . . . . . . . 12 ((𝐾 ∈ HL ∧ 𝑆𝐵) → (𝑦 = ( 𝑆) ↔ (𝑦𝐵𝑦 = ( 𝑆))))
36 eqcom 2628 . . . . . . . . . . . . . 14 (𝑆 = ( 𝑦) ↔ ( 𝑦) = 𝑆)
3713, 16opcon2b 33999 . . . . . . . . . . . . . . . 16 ((𝐾 ∈ OP ∧ 𝑆𝐵𝑦𝐵) → (𝑆 = ( 𝑦) ↔ 𝑦 = ( 𝑆)))
3830, 37syl3an1 1356 . . . . . . . . . . . . . . 15 ((𝐾 ∈ HL ∧ 𝑆𝐵𝑦𝐵) → (𝑆 = ( 𝑦) ↔ 𝑦 = ( 𝑆)))
39383expa 1262 . . . . . . . . . . . . . 14 (((𝐾 ∈ HL ∧ 𝑆𝐵) ∧ 𝑦𝐵) → (𝑆 = ( 𝑦) ↔ 𝑦 = ( 𝑆)))
4036, 39syl5rbbr 275 . . . . . . . . . . . . 13 (((𝐾 ∈ HL ∧ 𝑆𝐵) ∧ 𝑦𝐵) → (𝑦 = ( 𝑆) ↔ ( 𝑦) = 𝑆))
4140pm5.32da 672 . . . . . . . . . . . 12 ((𝐾 ∈ HL ∧ 𝑆𝐵) → ((𝑦𝐵𝑦 = ( 𝑆)) ↔ (𝑦𝐵 ∧ ( 𝑦) = 𝑆)))
4235, 41bitrd 268 . . . . . . . . . . 11 ((𝐾 ∈ HL ∧ 𝑆𝐵) → (𝑦 = ( 𝑆) ↔ (𝑦𝐵 ∧ ( 𝑦) = 𝑆)))
4329, 42sylan2 491 . . . . . . . . . 10 ((𝐾 ∈ HL ∧ (∀𝑖𝐼 𝑆𝐵𝑖𝐼)) → (𝑦 = ( 𝑆) ↔ (𝑦𝐵 ∧ ( 𝑦) = 𝑆)))
4443anassrs 679 . . . . . . . . 9 (((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) ∧ 𝑖𝐼) → (𝑦 = ( 𝑆) ↔ (𝑦𝐵 ∧ ( 𝑦) = 𝑆)))
4528, 44rexbida 3041 . . . . . . . 8 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → (∃𝑖𝐼 𝑦 = ( 𝑆) ↔ ∃𝑖𝐼 (𝑦𝐵 ∧ ( 𝑦) = 𝑆)))
46 r19.42v 3085 . . . . . . . 8 (∃𝑖𝐼 (𝑦𝐵 ∧ ( 𝑦) = 𝑆) ↔ (𝑦𝐵 ∧ ∃𝑖𝐼 ( 𝑦) = 𝑆))
4745, 46syl6rbb 277 . . . . . . 7 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → ((𝑦𝐵 ∧ ∃𝑖𝐼 ( 𝑦) = 𝑆) ↔ ∃𝑖𝐼 𝑦 = ( 𝑆)))
4847abbidv 2738 . . . . . 6 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → {𝑦 ∣ (𝑦𝐵 ∧ ∃𝑖𝐼 ( 𝑦) = 𝑆)} = {𝑦 ∣ ∃𝑖𝐼 𝑦 = ( 𝑆)})
49 eqeq1 2625 . . . . . . . 8 (𝑦 = 𝑥 → (𝑦 = ( 𝑆) ↔ 𝑥 = ( 𝑆)))
5049rexbidv 3046 . . . . . . 7 (𝑦 = 𝑥 → (∃𝑖𝐼 𝑦 = ( 𝑆) ↔ ∃𝑖𝐼 𝑥 = ( 𝑆)))
5150cbvabv 2744 . . . . . 6 {𝑦 ∣ ∃𝑖𝐼 𝑦 = ( 𝑆)} = {𝑥 ∣ ∃𝑖𝐼 𝑥 = ( 𝑆)}
5248, 51syl6eq 2671 . . . . 5 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → {𝑦 ∣ (𝑦𝐵 ∧ ∃𝑖𝐼 ( 𝑦) = 𝑆)} = {𝑥 ∣ ∃𝑖𝐼 𝑥 = ( 𝑆)})
5326, 52syl5eq 2667 . . . 4 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → {𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}} = {𝑥 ∣ ∃𝑖𝐼 𝑥 = ( 𝑆)})
5453fveq2d 6157 . . 3 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → (𝑈‘{𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}}) = (𝑈‘{𝑥 ∣ ∃𝑖𝐼 𝑥 = ( 𝑆)}))
5554fveq2d 6157 . 2 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → ( ‘(𝑈‘{𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}})) = ( ‘(𝑈‘{𝑥 ∣ ∃𝑖𝐼 𝑥 = ( 𝑆)})))
5618, 55eqtrd 2655 1 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → (𝐺‘{𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}) = ( ‘(𝑈‘{𝑥 ∣ ∃𝑖𝐼 𝑥 = ( 𝑆)})))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384   = wceq 1480  wcel 1987  {cab 2607  wral 2907  wrex 2908  {crab 2911  wss 3559  cfv 5852  Basecbs 15792  occoc 15881  lubclub 16874  glbcglb 16875  OPcops 33974  HLchlt 34152
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4736  ax-sep 4746  ax-nul 4754  ax-pow 4808  ax-pr 4872  ax-un 6909  ax-riotaBAD 33754
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1038  df-tru 1483  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-nel 2894  df-ral 2912  df-rex 2913  df-reu 2914  df-rmo 2915  df-rab 2916  df-v 3191  df-sbc 3422  df-csb 3519  df-dif 3562  df-un 3564  df-in 3566  df-ss 3573  df-nul 3897  df-if 4064  df-pw 4137  df-sn 4154  df-pr 4156  df-op 4160  df-uni 4408  df-iun 4492  df-br 4619  df-opab 4679  df-mpt 4680  df-id 4994  df-xp 5085  df-rel 5086  df-cnv 5087  df-co 5088  df-dm 5089  df-rn 5090  df-res 5091  df-ima 5092  df-iota 5815  df-fun 5854  df-fn 5855  df-f 5856  df-f1 5857  df-fo 5858  df-f1o 5859  df-fv 5860  df-riota 6571  df-ov 6613  df-undef 7351  df-lub 16906  df-glb 16907  df-clat 17040  df-oposet 33978  df-ol 33980  df-oml 33981  df-hlat 34153
This theorem is referenced by:  polval2N  34707
  Copyright terms: Public domain W3C validator