Theorem glb0N 39656

Description: The greatest lower bound of the empty set is the unity element. (Contributed by NM, 5-Dec-2011.) (New usage is discouraged.)

Hypotheses

Ref	Expression
glb0.g	⊢ 𝐺 = (glb‘𝐾)
glb0.u	⊢ 1 = (1.‘𝐾)

Assertion

Ref	Expression
glb0N	⊢ (𝐾 ∈ OP → (𝐺‘∅) = 1 )

Proof of Theorem glb0N

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2737	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
2		eqid 2737	. . 3 ⊢ (le‘𝐾) = (le‘𝐾)
3		glb0.g	. . 3 ⊢ 𝐺 = (glb‘𝐾)
4		biid 261	. . 3 ⊢ ((∀𝑦 ∈ ∅ 𝑥(le‘𝐾)𝑦 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦 → 𝑧(le‘𝐾)𝑥)) ↔ (∀𝑦 ∈ ∅ 𝑥(le‘𝐾)𝑦 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦 → 𝑧(le‘𝐾)𝑥)))
5		id 22	. . 3 ⊢ (𝐾 ∈ OP → 𝐾 ∈ OP)
6		0ss 4341	. . . 4 ⊢ ∅ ⊆ (Base‘𝐾)
7	6	a1i 11	. . 3 ⊢ (𝐾 ∈ OP → ∅ ⊆ (Base‘𝐾))
8	1, 2, 3, 4, 5, 7	glbval 18327	. 2 ⊢ (𝐾 ∈ OP → (𝐺‘∅) = (℩𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑥(le‘𝐾)𝑦 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦 → 𝑧(le‘𝐾)𝑥))))
9		glb0.u	. . . 4 ⊢ 1 = (1.‘𝐾)
10	1, 9	op1cl 39648	. . 3 ⊢ (𝐾 ∈ OP → 1 ∈ (Base‘𝐾))
11		ral0 4439	. . . . . . 7 ⊢ ∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦
12	11	a1bi 362	. . . . . 6 ⊢ (𝑧(le‘𝐾)𝑥 ↔ (∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦 → 𝑧(le‘𝐾)𝑥))
13	12	ralbii 3084	. . . . 5 ⊢ (∀𝑧 ∈ (Base‘𝐾)𝑧(le‘𝐾)𝑥 ↔ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦 → 𝑧(le‘𝐾)𝑥))
14		ral0 4439	. . . . . 6 ⊢ ∀𝑦 ∈ ∅ 𝑥(le‘𝐾)𝑦
15	14	biantrur 530	. . . . 5 ⊢ (∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦 → 𝑧(le‘𝐾)𝑥) ↔ (∀𝑦 ∈ ∅ 𝑥(le‘𝐾)𝑦 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦 → 𝑧(le‘𝐾)𝑥)))
16	13, 15	bitri 275	. . . 4 ⊢ (∀𝑧 ∈ (Base‘𝐾)𝑧(le‘𝐾)𝑥 ↔ (∀𝑦 ∈ ∅ 𝑥(le‘𝐾)𝑦 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦 → 𝑧(le‘𝐾)𝑥)))
17	10	adantr 480	. . . . . . 7 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → 1 ∈ (Base‘𝐾))
18		breq1 5089	. . . . . . . 8 ⊢ (𝑧 = 1 → (𝑧(le‘𝐾)𝑥 ↔ 1 (le‘𝐾)𝑥))
19	18	rspcv 3561	. . . . . . 7 ⊢ ( 1 ∈ (Base‘𝐾) → (∀𝑧 ∈ (Base‘𝐾)𝑧(le‘𝐾)𝑥 → 1 (le‘𝐾)𝑥))
20	17, 19	syl 17	. . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (∀𝑧 ∈ (Base‘𝐾)𝑧(le‘𝐾)𝑥 → 1 (le‘𝐾)𝑥))
21	1, 2, 9	op1le 39655	. . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → ( 1 (le‘𝐾)𝑥 ↔ 𝑥 = 1 ))
22	20, 21	sylibd 239	. . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (∀𝑧 ∈ (Base‘𝐾)𝑧(le‘𝐾)𝑥 → 𝑥 = 1 ))
23	1, 2, 9	ople1 39654	. . . . . . . . . 10 ⊢ ((𝐾 ∈ OP ∧ 𝑧 ∈ (Base‘𝐾)) → 𝑧(le‘𝐾) 1 )
24	23	adantlr 716	. . . . . . . . 9 ⊢ (((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) ∧ 𝑧 ∈ (Base‘𝐾)) → 𝑧(le‘𝐾) 1 )
25	24	ex 412	. . . . . . . 8 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑧 ∈ (Base‘𝐾) → 𝑧(le‘𝐾) 1 ))
26		breq2 5090	. . . . . . . . 9 ⊢ (𝑥 = 1 → (𝑧(le‘𝐾)𝑥 ↔ 𝑧(le‘𝐾) 1 ))
27	26	biimprcd 250	. . . . . . . 8 ⊢ (𝑧(le‘𝐾) 1 → (𝑥 = 1 → 𝑧(le‘𝐾)𝑥))
28	25, 27	syl6 35	. . . . . . 7 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑧 ∈ (Base‘𝐾) → (𝑥 = 1 → 𝑧(le‘𝐾)𝑥)))
29	28	com23 86	. . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑥 = 1 → (𝑧 ∈ (Base‘𝐾) → 𝑧(le‘𝐾)𝑥)))
30	29	ralrimdv 3136	. . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑥 = 1 → ∀𝑧 ∈ (Base‘𝐾)𝑧(le‘𝐾)𝑥))
31	22, 30	impbid 212	. . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (∀𝑧 ∈ (Base‘𝐾)𝑧(le‘𝐾)𝑥 ↔ 𝑥 = 1 ))
32	16, 31	bitr3id 285	. . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → ((∀𝑦 ∈ ∅ 𝑥(le‘𝐾)𝑦 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦 → 𝑧(le‘𝐾)𝑥)) ↔ 𝑥 = 1 ))
33	10, 32	riota5 7347	. 2 ⊢ (𝐾 ∈ OP → (℩𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑥(le‘𝐾)𝑦 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦 → 𝑧(le‘𝐾)𝑥))) = 1 )
34	8, 33	eqtrd 2772	1 ⊢ (𝐾 ∈ OP → (𝐺‘∅) = 1 )

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3052   ⊆ wss 3890  ∅c0 4274   class class class wbr 5086  ‘cfv 6493  ℩crio 7317  Basecbs 17173  lecple 17221  glbcglb 18270  1.cp1 18382  OPcops 39635

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5213  ax-sep 5232  ax-nul 5242  ax-pow 5303  ax-pr 5371

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6449  df-fun 6495  df-fn 6496  df-f 6497  df-f1 6498  df-fo 6499  df-f1o 6500  df-fv 6501  df-riota 7318  df-ov 7364  df-proset 18254  df-poset 18273  df-lub 18304  df-glb 18305  df-p1 18384  df-oposet 39639

This theorem is referenced by:  pmapglb2N  40234  pmapglb2xN  40235