Theorem lub0N 39594

Description: The least upper bound of the empty set is the zero element. (Contributed by NM, 15-Sep-2013.) (New usage is discouraged.)

Hypotheses

Ref	Expression
lub0.u	⊢ 1 = (lub‘𝐾)
lub0.z	⊢ 0 = (0.‘𝐾)

Assertion

Ref	Expression
lub0N	⊢ (𝐾 ∈ OP → ( 1 ‘∅) = 0 )

Proof of Theorem lub0N

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		lub0.u	. . 3 ⊢ 1 = (lub‘𝐾)
4		biid 261	. . 3 ⊢ ((∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)) ↔ (∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)))
5		id 22	. . 3 ⊢ (𝐾 ∈ OP → 𝐾 ∈ OP)
6		0ss 4354	. . . 4 ⊢ ∅ ⊆ (Base‘𝐾)
7	6	a1i 11	. . 3 ⊢ (𝐾 ∈ OP → ∅ ⊆ (Base‘𝐾))
8	1, 2, 3, 4, 5, 7	lubval 18291	. 2 ⊢ (𝐾 ∈ OP → ( 1 ‘∅) = (℩𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧))))
9		lub0.z	. . . 4 ⊢ 0 = (0.‘𝐾)
10	1, 9	op0cl 39589	. . 3 ⊢ (𝐾 ∈ OP → 0 ∈ (Base‘𝐾))
11		ral0 4453	. . . . . . 7 ⊢ ∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑧
12	11	a1bi 362	. . . . . 6 ⊢ (𝑥(le‘𝐾)𝑧 ↔ (∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧))
13	12	ralbii 3084	. . . . 5 ⊢ (∀𝑧 ∈ (Base‘𝐾)𝑥(le‘𝐾)𝑧 ↔ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧))
14		ral0 4453	. . . . . 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‘𝐾)) → 0 ∈ (Base‘𝐾))
18		breq2 5104	. . . . . . . 8 ⊢ (𝑧 = 0 → (𝑥(le‘𝐾)𝑧 ↔ 𝑥(le‘𝐾) 0 ))
19	18	rspcv 3574	. . . . . . 7 ⊢ ( 0 ∈ (Base‘𝐾) → (∀𝑧 ∈ (Base‘𝐾)𝑥(le‘𝐾)𝑧 → 𝑥(le‘𝐾) 0 ))
20	17, 19	syl 17	. . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (∀𝑧 ∈ (Base‘𝐾)𝑥(le‘𝐾)𝑧 → 𝑥(le‘𝐾) 0 ))
21	1, 2, 9	ople0 39592	. . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑥(le‘𝐾) 0 ↔ 𝑥 = 0 ))
22	20, 21	sylibd 239	. . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (∀𝑧 ∈ (Base‘𝐾)𝑥(le‘𝐾)𝑧 → 𝑥 = 0 ))
23	1, 2, 9	op0le 39591	. . . . . . . . . 10 ⊢ ((𝐾 ∈ OP ∧ 𝑧 ∈ (Base‘𝐾)) → 0 (le‘𝐾)𝑧)
24	23	adantlr 716	. . . . . . . . 9 ⊢ (((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) ∧ 𝑧 ∈ (Base‘𝐾)) → 0 (le‘𝐾)𝑧)
25	24	ex 412	. . . . . . . 8 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑧 ∈ (Base‘𝐾) → 0 (le‘𝐾)𝑧))
26		breq1 5103	. . . . . . . . 9 ⊢ (𝑥 = 0 → (𝑥(le‘𝐾)𝑧 ↔ 0 (le‘𝐾)𝑧))
27	26	biimprcd 250	. . . . . . . 8 ⊢ ( 0 (le‘𝐾)𝑧 → (𝑥 = 0 → 𝑥(le‘𝐾)𝑧))
28	25, 27	syl6 35	. . . . . . 7 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑧 ∈ (Base‘𝐾) → (𝑥 = 0 → 𝑥(le‘𝐾)𝑧)))
29	28	com23 86	. . . . . 6 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑥 = 0 → (𝑧 ∈ (Base‘𝐾) → 𝑥(le‘𝐾)𝑧)))
30	29	ralrimdv 3136	. . . . 5 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (𝑥 = 0 → ∀𝑧 ∈ (Base‘𝐾)𝑥(le‘𝐾)𝑧))
31	22, 30	impbid 212	. . . 4 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → (∀𝑧 ∈ (Base‘𝐾)𝑥(le‘𝐾)𝑧 ↔ 𝑥 = 0 ))
32	16, 31	bitr3id 285	. . 3 ⊢ ((𝐾 ∈ OP ∧ 𝑥 ∈ (Base‘𝐾)) → ((∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧)) ↔ 𝑥 = 0 ))
33	10, 32	riota5 7356	. 2 ⊢ (𝐾 ∈ OP → (℩𝑥 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑥 ∧ ∀𝑧 ∈ (Base‘𝐾)(∀𝑦 ∈ ∅ 𝑦(le‘𝐾)𝑧 → 𝑥(le‘𝐾)𝑧))) = 0 )
34	8, 33	eqtrd 2772	1 ⊢ (𝐾 ∈ OP → ( 1 ‘∅) = 0 )

Syntax hints:   → wi 4   ∧ wa 395   = wceq 1542   ∈ wcel 2114  ∀wral 3052   ⊆ wss 3903  ∅c0 4287   class class class wbr 5100  ‘cfv 6502  ℩crio 7326  Basecbs 17150  lecple 17198  lubclub 18246  0.cp0 18358  OPcops 39577

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 5226  ax-sep 5245  ax-nul 5255  ax-pow 5314  ax-pr 5381

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 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5529  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-iota 6458  df-fun 6504  df-fn 6505  df-f 6506  df-f1 6507  df-fo 6508  df-f1o 6509  df-fv 6510  df-riota 7327  df-ov 7373  df-proset 18231  df-poset 18250  df-lub 18281  df-glb 18282  df-p0 18360  df-oposet 39581

This theorem is referenced by: (None)