Theorem glb0N 39175

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 2735	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
2		eqid 2735	. . 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 4406	. . . 4 ⊢ ∅ ⊆ (Base‘𝐾)
7	6	a1i 11	. . 3 ⊢ (𝐾 ∈ OP → ∅ ⊆ (Base‘𝐾))
8	1, 2, 3, 4, 5, 7	glbval 18427	. 2 ⊢ (𝐾 ∈ OP → (𝐺‘∅) = (℩𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑥(le‘𝐾)𝑦 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦 → 𝑧(le‘𝐾)𝑥))))
9		glb0.u	. . . 4 ⊢ 1 = (1.‘𝐾)
10	1, 9	op1cl 39167	. . 3 ⊢ (𝐾 ∈ OP → 1 ∈ (Base‘𝐾))
11		ral0 4519	. . . . . . 7 ⊢ ∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦
12	11	a1bi 362	. . . . . 6 ⊢ (𝑧(le‘𝐾)𝑥 ↔ (∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦 → 𝑧(le‘𝐾)𝑥))
13	12	ralbii 3091	. . . . 5 ⊢ (∀𝑧 ∈ (Base‘𝐾)𝑧(le‘𝐾)𝑥 ↔ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦 → 𝑧(le‘𝐾)𝑥))
14		ral0 4519	. . . . . 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 5151	. . . . . . . 8 ⊢ (𝑧 = 1 → (𝑧(le‘𝐾)𝑥 ↔ 1 (le‘𝐾)𝑥))
19	18	rspcv 3618	. . . . . . 7 ⊢ ( 1 ∈ (Base‘𝐾) → (∀𝑧 ∈ (Base‘𝐾)𝑧(le‘𝐾)𝑥 → 1 (le‘𝐾)𝑥))
20	17, 19	syl 17	. . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (∀𝑧 ∈ (Base‘𝐾)𝑧(le‘𝐾)𝑥 → 1 (le‘𝐾)𝑥))
21	1, 2, 9	op1le 39174	. . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → ( 1 (le‘𝐾)𝑥 ↔ 𝑥 = 1 ))
22	20, 21	sylibd 239	. . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (∀𝑧 ∈ (Base‘𝐾)𝑧(le‘𝐾)𝑥 → 𝑥 = 1 ))
23	1, 2, 9	ople1 39173	. . . . . . . . . 10 ⊢ ((𝐾 ∈ OP ∧ 𝑧 ∈ (Base‘𝐾)) → 𝑧(le‘𝐾) 1 )
24	23	adantlr 715	. . . . . . . . 9 ⊢ (((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) ∧ 𝑧 ∈ (Base‘𝐾)) → 𝑧(le‘𝐾) 1 )
25	24	ex 412	. . . . . . . 8 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑧 ∈ (Base‘𝐾) → 𝑧(le‘𝐾) 1 ))
26		breq2 5152	. . . . . . . . 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 3150	. . . . 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 7417	. 2 ⊢ (𝐾 ∈ OP → (℩𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑥(le‘𝐾)𝑦 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑧(le‘𝐾)𝑦 → 𝑧(le‘𝐾)𝑥))) = 1 )
34	8, 33	eqtrd 2775	1 ⊢ (𝐾 ∈ OP → (𝐺‘∅) = 1 )

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1537   ∈ wcel 2106  ∀wral 3059   ⊆ wss 3963  ∅c0 4339   class class class wbr 5148  ‘cfv 6563  ℩crio 7387  Basecbs 17245  lecple 17305  glbcglb 18368  1.cp1 18482  OPcops 39154

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-proset 18352  df-poset 18371  df-lub 18404  df-glb 18405  df-p1 18484  df-oposet 39158

This theorem is referenced by:  pmapglb2N  39754  pmapglb2xN  39755