ioorinv2 - Metamath Proof Explorer

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

Theorem ioorinv2 25629

Description: The function 𝐹 is an "inverse" of sorts to the open interval function. (Contributed by Mario Carneiro, 26-Mar-2015.) (Revised by AV, 13-Sep-2020.)

**Hypothesis**
Ref	Expression
ioorf.1	⊢ 𝐹 = (𝑥 ∈ ran (,) ↦ if(𝑥 = ∅, ⟨0, 0⟩, ⟨inf(𝑥, ℝ^, < ), sup(𝑥, ℝ^, < )⟩))

**Assertion**
Ref	Expression
ioorinv2	⊢ ((𝐴(,)𝐵) ≠ ∅ → (𝐹‘(𝐴(,)𝐵)) = ⟨𝐴, 𝐵⟩)

Distinct variable groups: 𝑥,𝐴 𝑥,𝐵 Allowed substitution hint: 𝐹(𝑥)

Proof of Theorem ioorinv2 Dummy variables 𝑤 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		ioorebas 13511	. . 3 ⊢ (𝐴(,)𝐵) ∈ ran (,)
2		ioorf.1	. . . 4 ⊢ 𝐹 = (𝑥 ∈ ran (,) ↦ if(𝑥 = ∅, ⟨0, 0⟩, ⟨inf(𝑥, ℝ^, < ), sup(𝑥, ℝ^, < )⟩))
3	2	ioorval 25628	. . 3 ⊢ ((𝐴(,)𝐵) ∈ ran (,) → (𝐹‘(𝐴(,)𝐵)) = if((𝐴(,)𝐵) = ∅, ⟨0, 0⟩, ⟨inf((𝐴(,)𝐵), ℝ^, < ), sup((𝐴(,)𝐵), ℝ^, < )⟩))
4	1, 3	ax-mp 5	. 2 ⊢ (𝐹‘(𝐴(,)𝐵)) = if((𝐴(,)𝐵) = ∅, ⟨0, 0⟩, ⟨inf((𝐴(,)𝐵), ℝ^, < ), sup((𝐴(,)𝐵), ℝ^, < )⟩)
5		ifnefalse 4560	. . 3 ⊢ ((𝐴(,)𝐵) ≠ ∅ → if((𝐴(,)𝐵) = ∅, ⟨0, 0⟩, ⟨inf((𝐴(,)𝐵), ℝ^, < ), sup((𝐴(,)𝐵), ℝ^, < )⟩) = ⟨inf((𝐴(,)𝐵), ℝ^, < ), sup((𝐴(,)𝐵), ℝ^, < )⟩)
6		n0 4376	. . . . . . 7 ⊢ ((𝐴(,)𝐵) ≠ ∅ ↔ ∃𝑥 𝑥 ∈ (𝐴(,)𝐵))
7		eliooxr 13465	. . . . . . . 8 ⊢ (𝑥 ∈ (𝐴(,)𝐵) → (𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*))
8	7	exlimiv 1929	. . . . . . 7 ⊢ (∃𝑥 𝑥 ∈ (𝐴(,)𝐵) → (𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*))
9	6, 8	sylbi 217	. . . . . 6 ⊢ ((𝐴(,)𝐵) ≠ ∅ → (𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*))
10	9	simpld 494	. . . . 5 ⊢ ((𝐴(,)𝐵) ≠ ∅ → 𝐴 ∈ ℝ^*)
11	9	simprd 495	. . . . 5 ⊢ ((𝐴(,)𝐵) ≠ ∅ → 𝐵 ∈ ℝ^*)
12		id 22	. . . . 5 ⊢ ((𝐴(,)𝐵) ≠ ∅ → (𝐴(,)𝐵) ≠ ∅)
13		df-ioo 13411	. . . . . 6 ⊢ (,) = (𝑥 ∈ ℝ^, 𝑦 ∈ ℝ^ ↦ {𝑧 ∈ ℝ^* ∣ (𝑥 < 𝑧 ∧ 𝑧 < 𝑦)})
14		idd 24	. . . . . 6 ⊢ ((𝑤 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝑤 < 𝐵 → 𝑤 < 𝐵))
15		xrltle 13211	. . . . . 6 ⊢ ((𝑤 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^*) → (𝑤 < 𝐵 → 𝑤 ≤ 𝐵))
16		idd 24	. . . . . 6 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝑤 ∈ ℝ^*) → (𝐴 < 𝑤 → 𝐴 < 𝑤))
17		xrltle 13211	. . . . . 6 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝑤 ∈ ℝ^*) → (𝐴 < 𝑤 → 𝐴 ≤ 𝑤))
18	13, 14, 15, 16, 17	ixxlb 13429	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ (𝐴(,)𝐵) ≠ ∅) → inf((𝐴(,)𝐵), ℝ^*, < ) = 𝐴)
19	10, 11, 12, 18	syl3anc 1371	. . . 4 ⊢ ((𝐴(,)𝐵) ≠ ∅ → inf((𝐴(,)𝐵), ℝ^*, < ) = 𝐴)
20	13, 14, 15, 16, 17	ixxub 13428	. . . . 5 ⊢ ((𝐴 ∈ ℝ^* ∧ 𝐵 ∈ ℝ^* ∧ (𝐴(,)𝐵) ≠ ∅) → sup((𝐴(,)𝐵), ℝ^*, < ) = 𝐵)
21	10, 11, 12, 20	syl3anc 1371	. . . 4 ⊢ ((𝐴(,)𝐵) ≠ ∅ → sup((𝐴(,)𝐵), ℝ^*, < ) = 𝐵)
22	19, 21	opeq12d 4905	. . 3 ⊢ ((𝐴(,)𝐵) ≠ ∅ → ⟨inf((𝐴(,)𝐵), ℝ^, < ), sup((𝐴(,)𝐵), ℝ^, < )⟩ = ⟨𝐴, 𝐵⟩)
23	5, 22	eqtrd 2780	. 2 ⊢ ((𝐴(,)𝐵) ≠ ∅ → if((𝐴(,)𝐵) = ∅, ⟨0, 0⟩, ⟨inf((𝐴(,)𝐵), ℝ^, < ), sup((𝐴(,)𝐵), ℝ^, < )⟩) = ⟨𝐴, 𝐵⟩)
24	4, 23	eqtrid 2792	1 ⊢ ((𝐴(,)𝐵) ≠ ∅ → (𝐹‘(𝐴(,)𝐵)) = ⟨𝐴, 𝐵⟩)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1537 ∃wex 1777 ∈ wcel 2108 ≠ wne 2946 ∅c0 4352 ifcif 4548 ⟨cop 4654 class class class wbr 5166 ↦ cmpt 5249 ran crn 5701 ‘cfv 6573 (class class class)co 7448 supcsup 9509 infcinf 9510 0cc0 11184 ℝ^*cxr 11323 < clt 11324 (,)cioo 13407

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7770 ax-cnex 11240 ax-resscn 11241 ax-1cn 11242 ax-icn 11243 ax-addcl 11244 ax-addrcl 11245 ax-mulcl 11246 ax-mulrcl 11247 ax-mulcom 11248 ax-addass 11249 ax-mulass 11250 ax-distr 11251 ax-i2m1 11252 ax-1ne0 11253 ax-1rid 11254 ax-rnegex 11255 ax-rrecex 11256 ax-cnre 11257 ax-pre-lttri 11258 ax-pre-lttrn 11259 ax-pre-ltadd 11260 ax-pre-mulgt0 11261 ax-pre-sup 11262

This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6332 df-ord 6398 df-on 6399 df-lim 6400 df-suc 6401 df-iota 6525 df-fun 6575 df-fn 6576 df-f 6577 df-f1 6578 df-fo 6579 df-f1o 6580 df-fv 6581 df-riota 7404 df-ov 7451 df-oprab 7452 df-mpo 7453 df-om 7904 df-1st 8030 df-2nd 8031 df-frecs 8322 df-wrecs 8353 df-recs 8427 df-rdg 8466 df-er 8763 df-en 9004 df-dom 9005 df-sdom 9006 df-sup 9511 df-inf 9512 df-pnf 11326 df-mnf 11327 df-xr 11328 df-ltxr 11329 df-le 11330 df-sub 11522 df-neg 11523 df-div 11948 df-nn 12294 df-n0 12554 df-z 12640 df-uz 12904 df-q 13014 df-ioo 13411

This theorem is referenced by: ioorinv 25630 ioorcl 25631

W3C validator