dyadf - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > dyadf		Structured version Visualization version GIF version

Theorem dyadf 25519

Description: The function 𝐹 returns the endpoints of a dyadic rational covering of the real line. (Contributed by Mario Carneiro, 26-Mar-2015.)

**Hypothesis**
Ref	Expression
dyadmbl.1	⊢ 𝐹 = (𝑥 ∈ ℤ, 𝑦 ∈ ℕ₀ ↦ ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩)

**Assertion**
Ref	Expression
dyadf	⊢ 𝐹:(ℤ × ℕ₀)⟶( ≤ ∩ (ℝ × ℝ))

Distinct variable group: 𝑥,𝑦,𝐹

**Proof of Theorem dyadf**
Step	Hyp	Ref	Expression
1		zre 12592	. . . . . . . 8 ⊢ (𝑥 ∈ ℤ → 𝑥 ∈ ℝ)
2	1	adantr 480	. . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ₀) → 𝑥 ∈ ℝ)
3	2	lep1d 12175	. . . . . 6 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ₀) → 𝑥 ≤ (𝑥 + 1))
4		peano2re 11417	. . . . . . . 8 ⊢ (𝑥 ∈ ℝ → (𝑥 + 1) ∈ ℝ)
5	2, 4	syl 17	. . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ₀) → (𝑥 + 1) ∈ ℝ)
6		2nn 12315	. . . . . . . . . 10 ⊢ 2 ∈ ℕ
7		nnexpcl 14071	. . . . . . . . . 10 ⊢ ((2 ∈ ℕ ∧ 𝑦 ∈ ℕ₀) → (2↑𝑦) ∈ ℕ)
8	6, 7	mpan 689	. . . . . . . . 9 ⊢ (𝑦 ∈ ℕ₀ → (2↑𝑦) ∈ ℕ)
9	8	adantl 481	. . . . . . . 8 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ₀) → (2↑𝑦) ∈ ℕ)
10	9	nnred 12257	. . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ₀) → (2↑𝑦) ∈ ℝ)
11	9	nngt0d 12291	. . . . . . 7 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ₀) → 0 < (2↑𝑦))
12		lediv1 12109	. . . . . . 7 ⊢ ((𝑥 ∈ ℝ ∧ (𝑥 + 1) ∈ ℝ ∧ ((2↑𝑦) ∈ ℝ ∧ 0 < (2↑𝑦))) → (𝑥 ≤ (𝑥 + 1) ↔ (𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦))))
13	2, 5, 10, 11, 12	syl112anc 1372	. . . . . 6 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ₀) → (𝑥 ≤ (𝑥 + 1) ↔ (𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦))))
14	3, 13	mpbid 231	. . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ₀) → (𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦)))
15		df-br 5149	. . . . 5 ⊢ ((𝑥 / (2↑𝑦)) ≤ ((𝑥 + 1) / (2↑𝑦)) ↔ ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩ ∈ ≤ )
16	14, 15	sylib 217	. . . 4 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ₀) → ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩ ∈ ≤ )
17		nndivre 12283	. . . . . 6 ⊢ ((𝑥 ∈ ℝ ∧ (2↑𝑦) ∈ ℕ) → (𝑥 / (2↑𝑦)) ∈ ℝ)
18	1, 8, 17	syl2an 595	. . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ₀) → (𝑥 / (2↑𝑦)) ∈ ℝ)
19	1, 4	syl 17	. . . . . 6 ⊢ (𝑥 ∈ ℤ → (𝑥 + 1) ∈ ℝ)
20		nndivre 12283	. . . . . 6 ⊢ (((𝑥 + 1) ∈ ℝ ∧ (2↑𝑦) ∈ ℕ) → ((𝑥 + 1) / (2↑𝑦)) ∈ ℝ)
21	19, 8, 20	syl2an 595	. . . . 5 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ₀) → ((𝑥 + 1) / (2↑𝑦)) ∈ ℝ)
22	18, 21	opelxpd 5717	. . . 4 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ₀) → ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩ ∈ (ℝ × ℝ))
23	16, 22	elind 4194	. . 3 ⊢ ((𝑥 ∈ ℤ ∧ 𝑦 ∈ ℕ₀) → ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩ ∈ ( ≤ ∩ (ℝ × ℝ)))
24	23	rgen2 3194	. 2 ⊢ ∀𝑥 ∈ ℤ ∀𝑦 ∈ ℕ₀ ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩ ∈ ( ≤ ∩ (ℝ × ℝ))
25		dyadmbl.1	. . 3 ⊢ 𝐹 = (𝑥 ∈ ℤ, 𝑦 ∈ ℕ₀ ↦ ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩)
26	25	fmpo 8072	. 2 ⊢ (∀𝑥 ∈ ℤ ∀𝑦 ∈ ℕ₀ ⟨(𝑥 / (2↑𝑦)), ((𝑥 + 1) / (2↑𝑦))⟩ ∈ ( ≤ ∩ (ℝ × ℝ)) ↔ 𝐹:(ℤ × ℕ₀)⟶( ≤ ∩ (ℝ × ℝ)))
27	24, 26	mpbi 229	1 ⊢ 𝐹:(ℤ × ℕ₀)⟶( ≤ ∩ (ℝ × ℝ))

Colors of variables: wff setvar class

Syntax hints: ↔ wb 205 ∧ wa 395 = wceq 1534 ∈ wcel 2099 ∀wral 3058 ∩ cin 3946 ⟨cop 4635 class class class wbr 5148 × cxp 5676 ⟶wf 6544 (class class class)co 7420 ∈ cmpo 7422 ℝcr 11137 0cc0 11138 1c1 11139 + caddc 11141 < clt 11278 ≤ cle 11279 / cdiv 11901 ℕcn 12242 2c2 12297 ℕ₀cn0 12502 ℤcz 12588 ↑cexp 14058

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-sep 5299 ax-nul 5306 ax-pow 5365 ax-pr 5429 ax-un 7740 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2938 df-nel 3044 df-ral 3059 df-rex 3068 df-rmo 3373 df-reu 3374 df-rab 3430 df-v 3473 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3966 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-op 4636 df-uni 4909 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5576 df-eprel 5582 df-po 5590 df-so 5591 df-fr 5633 df-we 5635 df-xp 5684 df-rel 5685 df-cnv 5686 df-co 5687 df-dm 5688 df-rn 5689 df-res 5690 df-ima 5691 df-pred 6305 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6500 df-fun 6550 df-fn 6551 df-f 6552 df-f1 6553 df-fo 6554 df-f1o 6555 df-fv 6556 df-riota 7376 df-ov 7423 df-oprab 7424 df-mpo 7425 df-om 7871 df-1st 7993 df-2nd 7994 df-frecs 8286 df-wrecs 8317 df-recs 8391 df-rdg 8430 df-er 8724 df-en 8964 df-dom 8965 df-sdom 8966 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-div 11902 df-nn 12243 df-2 12305 df-n0 12503 df-z 12589 df-uz 12853 df-seq 13999 df-exp 14059

This theorem is referenced by: dyaddisj 25524 dyadmax 25526 dyadmbllem 25527 dyadmbl 25528 opnmbllem 25529 opnmbllem0 37129 mblfinlem2 37131

W3C validator

	
		OSZAR »