Theorem isdrs 18236

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 6842	. . . . . 6 ⊢ (𝑓 = 𝐾 → (Base‘𝑓) = (Base‘𝐾))
2		isdrs.b	. . . . . 6 ⊢ 𝐵 = (Base‘𝐾)
3	1, 2	eqtr4di 2790	. . . . 5 ⊢ (𝑓 = 𝐾 → (Base‘𝑓) = 𝐵)
4		fveq2 6842	. . . . . . 7 ⊢ (𝑓 = 𝐾 → (le‘𝑓) = (le‘𝐾))
5		isdrs.l	. . . . . . 7 ⊢ ≤ = (le‘𝐾)
6	4, 5	eqtr4di 2790	. . . . . 6 ⊢ (𝑓 = 𝐾 → (le‘𝑓) = ≤ )
7	6	sbceq1d 3747	. . . . 5 ⊢ (𝑓 = 𝐾 → ([(le‘𝑓) / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)) ↔ [ ≤ / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧))))
8	3, 7	sbceqbid 3749	. . . 4 ⊢ (𝑓 = 𝐾 → ([(Base‘𝑓) / 𝑏][(le‘𝑓) / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)) ↔ [𝐵 / 𝑏][ ≤ / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧))))
9	2	fvexi 6856	. . . . 5 ⊢ 𝐵 ∈ V
10	5	fvexi 6856	. . . . 5 ⊢ ≤ ∈ V
11		neeq1 2995	. . . . . . 7 ⊢ (𝑏 = 𝐵 → (𝑏 ≠ ∅ ↔ 𝐵 ≠ ∅))
12	11	adantr 480	. . . . . 6 ⊢ ((𝑏 = 𝐵 ∧ 𝑟 = ≤ ) → (𝑏 ≠ ∅ ↔ 𝐵 ≠ ∅))
13		rexeq 3294	. . . . . . . . 9 ⊢ (𝑏 = 𝐵 → (∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ ∃𝑧 ∈ 𝐵 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)))
14	13	raleqbi1dv 3310	. . . . . . . 8 ⊢ (𝑏 = 𝐵 → (∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)))
15	14	raleqbi1dv 3310	. . . . . . 7 ⊢ (𝑏 = 𝐵 → (∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)))
16		breq 5102	. . . . . . . . . 10 ⊢ (𝑟 = ≤ → (𝑥𝑟𝑧 ↔ 𝑥 ≤ 𝑧))
17		breq 5102	. . . . . . . . . 10 ⊢ (𝑟 = ≤ → (𝑦𝑟𝑧 ↔ 𝑦 ≤ 𝑧))
18	16, 17	anbi12d 633	. . . . . . . . 9 ⊢ (𝑟 = ≤ → ((𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)))
19	18	rexbidv 3162	. . . . . . . 8 ⊢ (𝑟 = ≤ → (∃𝑧 ∈ 𝐵 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)))
20	19	2ralbidv 3202	. . . . . . 7 ⊢ (𝑟 = ≤ → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)))
21	15, 20	sylan9bb 509	. . . . . 6 ⊢ ((𝑏 = 𝐵 ∧ 𝑟 = ≤ ) → (∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧) ↔ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)))
22	12, 21	anbi12d 633	. . . . 5 ⊢ ((𝑏 = 𝐵 ∧ 𝑟 = ≤ ) → ((𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)) ↔ (𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧))))
23	9, 10, 22	sbc2ie 3818	. . . 4 ⊢ ([𝐵 / 𝑏][ ≤ / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)) ↔ (𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)))
24	8, 23	bitrdi 287	. . 3 ⊢ (𝑓 = 𝐾 → ([(Base‘𝑓) / 𝑏][(le‘𝑓) / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧)) ↔ (𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧))))
25		df-drs 18230	. . 3 ⊢ Dirset = {𝑓 ∈ Proset ∣ [(Base‘𝑓) / 𝑏][(le‘𝑓) / 𝑟](𝑏 ≠ ∅ ∧ ∀𝑥 ∈ 𝑏 ∀𝑦 ∈ 𝑏 ∃𝑧 ∈ 𝑏 (𝑥𝑟𝑧 ∧ 𝑦𝑟𝑧))}
26	24, 25	elrab2 3651	. 2 ⊢ (𝐾 ∈ Dirset ↔ (𝐾 ∈ Proset ∧ (𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧))))
27		3anass 1095	. 2 ⊢ ((𝐾 ∈ Proset ∧ 𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)) ↔ (𝐾 ∈ Proset ∧ (𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧))))
28	26, 27	bitr4i 278	1 ⊢ (𝐾 ∈ Dirset ↔ (𝐾 ∈ Proset ∧ 𝐵 ≠ ∅ ∧ ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 ∃𝑧 ∈ 𝐵 (𝑥 ≤ 𝑧 ∧ 𝑦 ≤ 𝑧)))

Syntax hints:   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  ∃wrex 3062  [wsbc 3742  ∅c0 4287   class class class wbr 5100  ‘cfv 6500  Basecbs 17148  lecple 17196   Proset cproset 18227  Dirsetcdrs 18228

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-ext 2709  ax-nul 5253

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-sb 2069  df-clab 2716  df-cleq 2729  df-clel 2812  df-ne 2934  df-ral 3053  df-rex 3063  df-rab 3402  df-v 3444  df-sbc 3743  df-dif 3906  df-un 3908  df-ss 3920  df-nul 4288  df-if 4482  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-br 5101  df-iota 6456  df-fv 6508  df-drs 18230

This theorem is referenced by:  drsdir  18237  drsprs  18238  drsbn0  18239  isdrs2  18241  isipodrs  18472