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 33682
Description: De Morgan's law for GLB and LUB. Index-set version of glbconN 33681, 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 3176 . . . . . 6 𝑦 ∈ V
2 eqeq1 2614 . . . . . . 7 (𝑥 = 𝑦 → (𝑥 = 𝑆𝑦 = 𝑆))
32rexbidv 3034 . . . . . 6 (𝑥 = 𝑦 → (∃𝑖𝐼 𝑥 = 𝑆 ↔ ∃𝑖𝐼 𝑦 = 𝑆))
41, 3elab 3319 . . . . 5 (𝑦 ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆} ↔ ∃𝑖𝐼 𝑦 = 𝑆)
5 nfra1 2925 . . . . . 6 𝑖𝑖𝐼 𝑆𝐵
6 nfv 1830 . . . . . 6 𝑖 𝑦𝐵
7 rsp 2913 . . . . . . 7 (∀𝑖𝐼 𝑆𝐵 → (𝑖𝐼𝑆𝐵))
8 eleq1a 2683 . . . . . . 7 (𝑆𝐵 → (𝑦 = 𝑆𝑦𝐵))
97, 8syl6 34 . . . . . 6 (∀𝑖𝐼 𝑆𝐵 → (𝑖𝐼 → (𝑦 = 𝑆𝑦𝐵)))
105, 6, 9rexlimd 3008 . . . . 5 (∀𝑖𝐼 𝑆𝐵 → (∃𝑖𝐼 𝑦 = 𝑆𝑦𝐵))
114, 10syl5bi 231 . . . 4 (∀𝑖𝐼 𝑆𝐵 → (𝑦 ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆} → 𝑦𝐵))
1211ssrdv 3574 . . 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 33681 . . 3 ((𝐾 ∈ HL ∧ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆} ⊆ 𝐵) → (𝐺‘{𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}) = ( ‘(𝑈‘{𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}})))
1812, 17sylan2 490 . 2 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → (𝐺‘{𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}) = ( ‘(𝑈‘{𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}})))
19 fvex 6113 . . . . . . . . 9 ( 𝑦) ∈ V
20 eqeq1 2614 . . . . . . . . . 10 (𝑥 = ( 𝑦) → (𝑥 = 𝑆 ↔ ( 𝑦) = 𝑆))
2120rexbidv 3034 . . . . . . . . 9 (𝑥 = ( 𝑦) → (∃𝑖𝐼 𝑥 = 𝑆 ↔ ∃𝑖𝐼 ( 𝑦) = 𝑆))
2219, 21elab 3319 . . . . . . . 8 (( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆} ↔ ∃𝑖𝐼 ( 𝑦) = 𝑆)
2322a1i 11 . . . . . . 7 (𝑦𝐵 → (( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆} ↔ ∃𝑖𝐼 ( 𝑦) = 𝑆))
2423rabbiia 3161 . . . . . 6 {𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}} = {𝑦𝐵 ∣ ∃𝑖𝐼 ( 𝑦) = 𝑆}
25 df-rab 2905 . . . . . 6 {𝑦𝐵 ∣ ∃𝑖𝐼 ( 𝑦) = 𝑆} = {𝑦 ∣ (𝑦𝐵 ∧ ∃𝑖𝐼 ( 𝑦) = 𝑆)}
2624, 25eqtri 2632 . . . . 5 {𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}} = {𝑦 ∣ (𝑦𝐵 ∧ ∃𝑖𝐼 ( 𝑦) = 𝑆)}
27 nfv 1830 . . . . . . . . . 10 𝑖 𝐾 ∈ HL
2827, 5nfan 1816 . . . . . . . . 9 𝑖(𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵)
29 rspa 2914 . . . . . . . . . . 11 ((∀𝑖𝐼 𝑆𝐵𝑖𝐼) → 𝑆𝐵)
30 hlop 33667 . . . . . . . . . . . . . . 15 (𝐾 ∈ HL → 𝐾 ∈ OP)
3113, 16opoccl 33499 . . . . . . . . . . . . . . 15 ((𝐾 ∈ OP ∧ 𝑆𝐵) → ( 𝑆) ∈ 𝐵)
3230, 31sylan 487 . . . . . . . . . . . . . 14 ((𝐾 ∈ HL ∧ 𝑆𝐵) → ( 𝑆) ∈ 𝐵)
33 eleq1a 2683 . . . . . . . . . . . . . 14 (( 𝑆) ∈ 𝐵 → (𝑦 = ( 𝑆) → 𝑦𝐵))
3432, 33syl 17 . . . . . . . . . . . . 13 ((𝐾 ∈ HL ∧ 𝑆𝐵) → (𝑦 = ( 𝑆) → 𝑦𝐵))
3534pm4.71rd 665 . . . . . . . . . . . 12 ((𝐾 ∈ HL ∧ 𝑆𝐵) → (𝑦 = ( 𝑆) ↔ (𝑦𝐵𝑦 = ( 𝑆))))
36 eqcom 2617 . . . . . . . . . . . . . 14 (𝑆 = ( 𝑦) ↔ ( 𝑦) = 𝑆)
3713, 16opcon2b 33502 . . . . . . . . . . . . . . . 16 ((𝐾 ∈ OP ∧ 𝑆𝐵𝑦𝐵) → (𝑆 = ( 𝑦) ↔ 𝑦 = ( 𝑆)))
3830, 37syl3an1 1351 . . . . . . . . . . . . . . 15 ((𝐾 ∈ HL ∧ 𝑆𝐵𝑦𝐵) → (𝑆 = ( 𝑦) ↔ 𝑦 = ( 𝑆)))
39383expa 1257 . . . . . . . . . . . . . 14 (((𝐾 ∈ HL ∧ 𝑆𝐵) ∧ 𝑦𝐵) → (𝑆 = ( 𝑦) ↔ 𝑦 = ( 𝑆)))
4036, 39syl5rbbr 274 . . . . . . . . . . . . 13 (((𝐾 ∈ HL ∧ 𝑆𝐵) ∧ 𝑦𝐵) → (𝑦 = ( 𝑆) ↔ ( 𝑦) = 𝑆))
4140pm5.32da 671 . . . . . . . . . . . 12 ((𝐾 ∈ HL ∧ 𝑆𝐵) → ((𝑦𝐵𝑦 = ( 𝑆)) ↔ (𝑦𝐵 ∧ ( 𝑦) = 𝑆)))
4235, 41bitrd 267 . . . . . . . . . . 11 ((𝐾 ∈ HL ∧ 𝑆𝐵) → (𝑦 = ( 𝑆) ↔ (𝑦𝐵 ∧ ( 𝑦) = 𝑆)))
4329, 42sylan2 490 . . . . . . . . . 10 ((𝐾 ∈ HL ∧ (∀𝑖𝐼 𝑆𝐵𝑖𝐼)) → (𝑦 = ( 𝑆) ↔ (𝑦𝐵 ∧ ( 𝑦) = 𝑆)))
4443anassrs 678 . . . . . . . . 9 (((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) ∧ 𝑖𝐼) → (𝑦 = ( 𝑆) ↔ (𝑦𝐵 ∧ ( 𝑦) = 𝑆)))
4528, 44rexbida 3029 . . . . . . . 8 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → (∃𝑖𝐼 𝑦 = ( 𝑆) ↔ ∃𝑖𝐼 (𝑦𝐵 ∧ ( 𝑦) = 𝑆)))
46 r19.42v 3073 . . . . . . . 8 (∃𝑖𝐼 (𝑦𝐵 ∧ ( 𝑦) = 𝑆) ↔ (𝑦𝐵 ∧ ∃𝑖𝐼 ( 𝑦) = 𝑆))
4745, 46syl6rbb 276 . . . . . . 7 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → ((𝑦𝐵 ∧ ∃𝑖𝐼 ( 𝑦) = 𝑆) ↔ ∃𝑖𝐼 𝑦 = ( 𝑆)))
4847abbidv 2728 . . . . . 6 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → {𝑦 ∣ (𝑦𝐵 ∧ ∃𝑖𝐼 ( 𝑦) = 𝑆)} = {𝑦 ∣ ∃𝑖𝐼 𝑦 = ( 𝑆)})
49 eqeq1 2614 . . . . . . . 8 (𝑦 = 𝑥 → (𝑦 = ( 𝑆) ↔ 𝑥 = ( 𝑆)))
5049rexbidv 3034 . . . . . . 7 (𝑦 = 𝑥 → (∃𝑖𝐼 𝑦 = ( 𝑆) ↔ ∃𝑖𝐼 𝑥 = ( 𝑆)))
5150cbvabv 2734 . . . . . 6 {𝑦 ∣ ∃𝑖𝐼 𝑦 = ( 𝑆)} = {𝑥 ∣ ∃𝑖𝐼 𝑥 = ( 𝑆)}
5248, 51syl6eq 2660 . . . . 5 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → {𝑦 ∣ (𝑦𝐵 ∧ ∃𝑖𝐼 ( 𝑦) = 𝑆)} = {𝑥 ∣ ∃𝑖𝐼 𝑥 = ( 𝑆)})
5326, 52syl5eq 2656 . . . 4 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → {𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}} = {𝑥 ∣ ∃𝑖𝐼 𝑥 = ( 𝑆)})
5453fveq2d 6107 . . 3 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → (𝑈‘{𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}}) = (𝑈‘{𝑥 ∣ ∃𝑖𝐼 𝑥 = ( 𝑆)}))
5554fveq2d 6107 . 2 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → ( ‘(𝑈‘{𝑦𝐵 ∣ ( 𝑦) ∈ {𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}})) = ( ‘(𝑈‘{𝑥 ∣ ∃𝑖𝐼 𝑥 = ( 𝑆)})))
5618, 55eqtrd 2644 1 ((𝐾 ∈ HL ∧ ∀𝑖𝐼 𝑆𝐵) → (𝐺‘{𝑥 ∣ ∃𝑖𝐼 𝑥 = 𝑆}) = ( ‘(𝑈‘{𝑥 ∣ ∃𝑖𝐼 𝑥 = ( 𝑆)})))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 195  wa 383   = wceq 1475  wcel 1977  {cab 2596  wral 2896  wrex 2897  {crab 2900  wss 3540  cfv 5804  Basecbs 15695  occoc 15776  lubclub 16765  glbcglb 16766  OPcops 33477  HLchlt 33655
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-rep 4699  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847  ax-riotaBAD 33257
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-nel 2783  df-ral 2901  df-rex 2902  df-reu 2903  df-rmo 2904  df-rab 2905  df-v 3175  df-sbc 3403  df-csb 3500  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-iun 4457  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-f1 5809  df-fo 5810  df-f1o 5811  df-fv 5812  df-riota 6511  df-ov 6552  df-undef 7286  df-lub 16797  df-glb 16798  df-clat 16931  df-oposet 33481  df-ol 33483  df-oml 33484  df-hlat 33656
This theorem is referenced by:  polval2N  34210
  Copyright terms: Public domain W3C validator