Theorem isdrs 18507

Description: Property of being a directed set. (Contributed by Stefan O'Rear, 1-Feb-2015.)

Hypotheses

Ref	Expression
isdrs.b	⊢ 𝐵 = (Base‘𝐾)
isdrs.l	⊢ ≤ = (le‘𝐾)

Assertion

Ref	Expression
isdrs	⊢ (𝐾 ∈ Dirset ↔ (𝐾 ∈ Proset ∧ 𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)))

Distinct variable groups:   𝑥,𝐾,𝑦,𝑧   𝑥,𝐵,𝑦,𝑧   𝑥, ≤ ,𝑦,𝑧

Proof of Theorem isdrs

Dummy variables 𝑓 𝑏 𝑟 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		fveq2 6911	. . . . . 6 ⊢ (𝑓 = 𝐾 → (Base‘𝑓) = (Base‘𝐾))
2		isdrs.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐾)
3	1, 2	eqtr4di 2816	. . . . 5 ⊢ (𝑓 = 𝐾 → (Base‘𝑓) = 𝐵)
4		fveq2 6911	. . . . . . 7 ⊢ (𝑓 = 𝐾 → (le‘𝑓) = (le‘𝐾))
5		isdrs.l	. . . . . . 7 ⊢ ≤ = (le‘𝐾)
6	4, 5	eqtr4di 2816	. . . . . 6 ⊢ (𝑓 = 𝐾 → (le‘𝑓) = ≤ )
7	6	sbceq1d 3747	. . . . 5 ⊢ (𝑓 = 𝐾 → ([(le‘𝑓) / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)) ↔ [ ≤ / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧))))
8	3, 7	sbceqbid 3749	. . . 4 ⊢ (𝑓 = 𝐾 → ([(Base‘𝑓) / 𝑏][(le‘𝑓) / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)) ↔ [𝐵 / 𝑏][ ≤ / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧))))
9	2	fvexi 6925	. . . . 5 ⊢ 𝐵 ∈ V
10	5	fvexi 6925	. . . . 5 ⊢ ≤ ∈ V
11		neeq1 3021	. . . . . . 7 ⊢ (𝑏 = 𝐵 → (𝑏 ≠ ∅ ↔ 𝐵 ≠ ∅))
12	11	adantr 486	. . . . . 6 ⊢ ((𝑏 = 𝐵 ∧ 𝑟 = ≤ ) → (𝑏 ≠ ∅ ↔ 𝐵 ≠ ∅))
13		rexeq 3319	. . . . . . . . 9 ⊢ (𝑏 = 𝐵 → (∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ ∃𝑧 ∈ 𝐵 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)))
14	13	raleqbi1dv 3333	. . . . . . . 8 ⊢ (𝑏 = 𝐵 → (∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)))
15	14	raleqbi1dv 3333	. . . . . . 7 ⊢ (𝑏 = 𝐵 → (∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)))
16		breq 5108	. . . . . . . . . 10 ⊢ (𝑟 = ≤ → (𝑥𝑟𝑧 ↔ 𝑥 ≤ 𝑧))
17		breq 5108	. . . . . . . . . 10 ⊢ (𝑟 = ≤ → (𝑦𝑟𝑧 ↔ 𝑦 ≤ 𝑧))
18	16, 17	anbi12d 644	. . . . . . . . 9 ⊢ (𝑟 = ≤ → ((𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)))
19	18	rexbidv 3190	. . . . . . . 8 ⊢ (𝑟 = ≤ → (∃𝑧 ∈ 𝐵 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)))
20	19	2ralbidv 3230	. . . . . . 7 ⊢ (𝑟 = ≤ → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)))
21	15, 20	sylan9bb 519	. . . . . 6 ⊢ ((𝑏 = 𝐵 ∧ 𝑟 = ≤ ) → (∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)))
22	12, 21	anbi12d 644	. . . . 5 ⊢ ((𝑏 = 𝐵 ∧ 𝑟 = ≤ ) → ((𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)) ↔ (𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧))))
23	9, 10, 22	sbc2ie 3818	. . . 4 ⊢ ([𝐵 / 𝑏][ ≤ / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)) ↔ (𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)))
24	8, 23	bitrdi 290	. . 3 ⊢ (𝑓 = 𝐾 → ([(Base‘𝑓) / 𝑏][(le‘𝑓) / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)) ↔ (𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧))))
25		df-drs 18501	. . 3 ⊢ Dirset = {𝑓 ∈ Proset ∣ [(Base‘𝑓) / 𝑏][(le‘𝑓) / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧))}
26	24, 25	elrab2 3652	. 2 ⊢ (𝐾 ∈ Dirset ↔ (𝐾 ∈ Proset ∧ (𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧))))
27		3anass 1111	. 2 ⊢ ((𝐾 ∈ Proset ∧ 𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)) ↔ (𝐾 ∈ Proset ∧ (𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧))))
28	26, 27	bitr4i 281	1 ⊢ (𝐾 ∈ Dirset ↔ (𝐾 ∈ Proset ∧ 𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)))

This proof depends on syntax axioms:   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147   ≠ wne 2959  ∀wral 3080  ∃wrex 3090  [wsbc 3742  ∅c0 4281   class class class wbr 5106  ‘cfv 6561  Basecbs 17419  lecple 17467   Proset cproset 18498  Dirsetcdrs 18499

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-ext 2735  ax-nul 5264

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-iota 6515  df-fv 6569  df-drs 18501

This theorem is used by:  drsdir  18508  drsprs  18509  drsbn0  18510  isdrs2  18512  isipodrs  18743