Theorem glbconxN 39372

Description: De Morgan's law for GLB and LUB. Index-set version of glbconN 39370, 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.

Step	Hyp	Ref	Expression
1		vex 3451	. . . . . 6 ⊢ 𝑦 ∈ V
2		eqeq1 2733	. . . . . . 7 ⊢ (𝑥 = 𝑦 → (𝑥 = 𝑆 ↔ 𝑦 = 𝑆))
3	2	rexbidv 3157	. . . . . 6 ⊢ (𝑥 = 𝑦 → (∃𝑖 ∈ 𝐼 𝑥 = 𝑆 ↔ ∃𝑖 ∈ 𝐼 𝑦 = 𝑆))
4	1, 3	elab 3646	. . . . 5 ⊢ (𝑦 ∈ {𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = 𝑆} ↔ ∃𝑖 ∈ 𝐼 𝑦 = 𝑆)
5		nfra1 3261	. . . . . 6 ⊢ Ⅎ𝑖∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵
6		nfv 1914	. . . . . 6 ⊢ Ⅎ𝑖 𝑦 ∈ 𝐵
7		rsp 3225	. . . . . . 7 ⊢ (∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵 → (𝑖 ∈ 𝐼 → 𝑆 ∈ 𝐵))
8		eleq1a 2823	. . . . . . 7 ⊢ (𝑆 ∈ 𝐵 → (𝑦 = 𝑆 → 𝑦 ∈ 𝐵))
9	7, 8	syl6 35	. . . . . 6 ⊢ (∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵 → (𝑖 ∈ 𝐼 → (𝑦 = 𝑆 → 𝑦 ∈ 𝐵)))
10	5, 6, 9	rexlimd 3244	. . . . 5 ⊢ (∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵 → (∃𝑖 ∈ 𝐼 𝑦 = 𝑆 → 𝑦 ∈ 𝐵))
11	4, 10	biimtrid 242	. . . 4 ⊢ (∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵 → (𝑦 ∈ {𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = 𝑆} → 𝑦 ∈ 𝐵))
12	11	ssrdv 3952	. . 3 ⊢ (∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵 → {𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = 𝑆} ⊆ 𝐵)
13		glbcon.b	. . . 4 ⊢ 𝐵 = (Base‘𝐾)
14		glbcon.u	. . . 4 ⊢ 𝑈 = (lub‘𝐾)
15		glbcon.g	. . . 4 ⊢ 𝐺 = (glb‘𝐾)
16		glbcon.o	. . . 4 ⊢ ⊥ = (oc‘𝐾)
17	13, 14, 15, 16	glbconN 39370	. . 3 ⊢ ((𝐾 ∈ HL ∧ {𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = 𝑆} ⊆ 𝐵) → (𝐺‘{𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = 𝑆}) = ( ⊥ ‘(𝑈‘{𝑦 ∈ 𝐵 ∣ ( ⊥ ‘𝑦) ∈ {𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = 𝑆}})))
18	12, 17	sylan2 593	. 2 ⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) → (𝐺‘{𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = 𝑆}) = ( ⊥ ‘(𝑈‘{𝑦 ∈ 𝐵 ∣ ( ⊥ ‘𝑦) ∈ {𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = 𝑆}})))
19		fvex 6871	. . . . . . . 8 ⊢ ( ⊥ ‘𝑦) ∈ V
20		eqeq1 2733	. . . . . . . . 9 ⊢ (𝑥 = ( ⊥ ‘𝑦) → (𝑥 = 𝑆 ↔ ( ⊥ ‘𝑦) = 𝑆))
21	20	rexbidv 3157	. . . . . . . 8 ⊢ (𝑥 = ( ⊥ ‘𝑦) → (∃𝑖 ∈ 𝐼 𝑥 = 𝑆 ↔ ∃𝑖 ∈ 𝐼 ( ⊥ ‘𝑦) = 𝑆))
22	19, 21	elab 3646	. . . . . . 7 ⊢ (( ⊥ ‘𝑦) ∈ {𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = 𝑆} ↔ ∃𝑖 ∈ 𝐼 ( ⊥ ‘𝑦) = 𝑆)
23	22	rabbii 3411	. . . . . 6 ⊢ {𝑦 ∈ 𝐵 ∣ ( ⊥ ‘𝑦) ∈ {𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = 𝑆}} = {𝑦 ∈ 𝐵 ∣ ∃𝑖 ∈ 𝐼 ( ⊥ ‘𝑦) = 𝑆}
24		df-rab 3406	. . . . . 6 ⊢ {𝑦 ∈ 𝐵 ∣ ∃𝑖 ∈ 𝐼 ( ⊥ ‘𝑦) = 𝑆} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ ∃𝑖 ∈ 𝐼 ( ⊥ ‘𝑦) = 𝑆)}
25	23, 24	eqtri 2752	. . . . 5 ⊢ {𝑦 ∈ 𝐵 ∣ ( ⊥ ‘𝑦) ∈ {𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = 𝑆}} = {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ ∃𝑖 ∈ 𝐼 ( ⊥ ‘𝑦) = 𝑆)}
26		nfv 1914	. . . . . . . . . 10 ⊢ Ⅎ𝑖 𝐾 ∈ HL
27	26, 5	nfan 1899	. . . . . . . . 9 ⊢ Ⅎ𝑖(𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵)
28		rspa 3226	. . . . . . . . . . 11 ⊢ ((∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵 ∧ 𝑖 ∈ 𝐼) → 𝑆 ∈ 𝐵)
29		hlop 39355	. . . . . . . . . . . . . . 15 ⊢ (𝐾 ∈ HL → 𝐾 ∈ OP)
30	13, 16	opoccl 39187	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ OP ∧ 𝑆 ∈ 𝐵) → ( ⊥ ‘𝑆) ∈ 𝐵)
31	29, 30	sylan 580	. . . . . . . . . . . . . 14 ⊢ ((𝐾 ∈ HL ∧ 𝑆 ∈ 𝐵) → ( ⊥ ‘𝑆) ∈ 𝐵)
32		eleq1a 2823	. . . . . . . . . . . . . 14 ⊢ (( ⊥ ‘𝑆) ∈ 𝐵 → (𝑦 = ( ⊥ ‘𝑆) → 𝑦 ∈ 𝐵))
33	31, 32	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝐾 ∈ HL ∧ 𝑆 ∈ 𝐵) → (𝑦 = ( ⊥ ‘𝑆) → 𝑦 ∈ 𝐵))
34	33	pm4.71rd 562	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ 𝑆 ∈ 𝐵) → (𝑦 = ( ⊥ ‘𝑆) ↔ (𝑦 ∈ 𝐵 ∧ 𝑦 = ( ⊥ ‘𝑆))))
35	13, 16	opcon2b 39190	. . . . . . . . . . . . . . . 16 ⊢ ((𝐾 ∈ OP ∧ 𝑆 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑆 = ( ⊥ ‘𝑦) ↔ 𝑦 = ( ⊥ ‘𝑆)))
36	29, 35	syl3an1 1163	. . . . . . . . . . . . . . 15 ⊢ ((𝐾 ∈ HL ∧ 𝑆 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) → (𝑆 = ( ⊥ ‘𝑦) ↔ 𝑦 = ( ⊥ ‘𝑆)))
37	36	3expa 1118	. . . . . . . . . . . . . 14 ⊢ (((𝐾 ∈ HL ∧ 𝑆 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → (𝑆 = ( ⊥ ‘𝑦) ↔ 𝑦 = ( ⊥ ‘𝑆)))
38		eqcom 2736	. . . . . . . . . . . . . 14 ⊢ (𝑆 = ( ⊥ ‘𝑦) ↔ ( ⊥ ‘𝑦) = 𝑆)
39	37, 38	bitr3di 286	. . . . . . . . . . . . 13 ⊢ (((𝐾 ∈ HL ∧ 𝑆 ∈ 𝐵) ∧ 𝑦 ∈ 𝐵) → (𝑦 = ( ⊥ ‘𝑆) ↔ ( ⊥ ‘𝑦) = 𝑆))
40	39	pm5.32da 579	. . . . . . . . . . . 12 ⊢ ((𝐾 ∈ HL ∧ 𝑆 ∈ 𝐵) → ((𝑦 ∈ 𝐵 ∧ 𝑦 = ( ⊥ ‘𝑆)) ↔ (𝑦 ∈ 𝐵 ∧ ( ⊥ ‘𝑦) = 𝑆)))
41	34, 40	bitrd 279	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ HL ∧ 𝑆 ∈ 𝐵) → (𝑦 = ( ⊥ ‘𝑆) ↔ (𝑦 ∈ 𝐵 ∧ ( ⊥ ‘𝑦) = 𝑆)))
42	28, 41	sylan2 593	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ (∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵 ∧ 𝑖 ∈ 𝐼)) → (𝑦 = ( ⊥ ‘𝑆) ↔ (𝑦 ∈ 𝐵 ∧ ( ⊥ ‘𝑦) = 𝑆)))
43	42	anassrs 467	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) ∧ 𝑖 ∈ 𝐼) → (𝑦 = ( ⊥ ‘𝑆) ↔ (𝑦 ∈ 𝐵 ∧ ( ⊥ ‘𝑦) = 𝑆)))
44	27, 43	rexbida 3249	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) → (∃𝑖 ∈ 𝐼 𝑦 = ( ⊥ ‘𝑆) ↔ ∃𝑖 ∈ 𝐼 (𝑦 ∈ 𝐵 ∧ ( ⊥ ‘𝑦) = 𝑆)))
45		r19.42v 3169	. . . . . . . 8 ⊢ (∃𝑖 ∈ 𝐼 (𝑦 ∈ 𝐵 ∧ ( ⊥ ‘𝑦) = 𝑆) ↔ (𝑦 ∈ 𝐵 ∧ ∃𝑖 ∈ 𝐼 ( ⊥ ‘𝑦) = 𝑆))
46	44, 45	bitr2di 288	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) → ((𝑦 ∈ 𝐵 ∧ ∃𝑖 ∈ 𝐼 ( ⊥ ‘𝑦) = 𝑆) ↔ ∃𝑖 ∈ 𝐼 𝑦 = ( ⊥ ‘𝑆)))
47	46	abbidv 2795	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) → {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ ∃𝑖 ∈ 𝐼 ( ⊥ ‘𝑦) = 𝑆)} = {𝑦 ∣ ∃𝑖 ∈ 𝐼 𝑦 = ( ⊥ ‘𝑆)})
48		eqeq1 2733	. . . . . . . 8 ⊢ (𝑦 = 𝑥 → (𝑦 = ( ⊥ ‘𝑆) ↔ 𝑥 = ( ⊥ ‘𝑆)))
49	48	rexbidv 3157	. . . . . . 7 ⊢ (𝑦 = 𝑥 → (∃𝑖 ∈ 𝐼 𝑦 = ( ⊥ ‘𝑆) ↔ ∃𝑖 ∈ 𝐼 𝑥 = ( ⊥ ‘𝑆)))
50	49	cbvabv 2799	. . . . . 6 ⊢ {𝑦 ∣ ∃𝑖 ∈ 𝐼 𝑦 = ( ⊥ ‘𝑆)} = {𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = ( ⊥ ‘𝑆)}
51	47, 50	eqtrdi 2780	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) → {𝑦 ∣ (𝑦 ∈ 𝐵 ∧ ∃𝑖 ∈ 𝐼 ( ⊥ ‘𝑦) = 𝑆)} = {𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = ( ⊥ ‘𝑆)})
52	25, 51	eqtrid 2776	. . . 4 ⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) → {𝑦 ∈ 𝐵 ∣ ( ⊥ ‘𝑦) ∈ {𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = 𝑆}} = {𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = ( ⊥ ‘𝑆)})
53	52	fveq2d 6862	. . 3 ⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) → (𝑈‘{𝑦 ∈ 𝐵 ∣ ( ⊥ ‘𝑦) ∈ {𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = 𝑆}}) = (𝑈‘{𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = ( ⊥ ‘𝑆)}))
54	53	fveq2d 6862	. 2 ⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) → ( ⊥ ‘(𝑈‘{𝑦 ∈ 𝐵 ∣ ( ⊥ ‘𝑦) ∈ {𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = 𝑆}})) = ( ⊥ ‘(𝑈‘{𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = ( ⊥ ‘𝑆)})))
55	18, 54	eqtrd 2764	1 ⊢ ((𝐾 ∈ HL ∧ ∀𝑖 ∈ 𝐼 𝑆 ∈ 𝐵) → (𝐺‘{𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = 𝑆}) = ( ⊥ ‘(𝑈‘{𝑥 ∣ ∃𝑖 ∈ 𝐼 𝑥 = ( ⊥ ‘𝑆)})))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   = wceq 1540   ∈ wcel 2109  {cab 2707  ∀wral 3044  ∃wrex 3053  {crab 3405   ⊆ wss 3914  ‘cfv 6511  Basecbs 17179  occoc 17228  lubclub 18270  glbcglb 18271  OPcops 39165  HLchlt 39343

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 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-riota 7344  df-ov 7390  df-lub 18305  df-glb 18306  df-clat 18458  df-oposet 39169  df-ol 39171  df-oml 39172  df-hlat 39344

This theorem is referenced by:  polval2N  39900