leiso - Metamath Proof Explorer

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

Theorem leiso 14628

Description: Two ways to write a strictly increasing function on the reals. (Contributed by Mario Carneiro, 9-Sep-2015.)

**Assertion**
Ref	Expression
leiso	⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ⊆ ℝ^*) → (𝐹 Isom < , < (𝐴, 𝐵) ↔ 𝐹 Isom ≤ , ≤ (𝐴, 𝐵)))

**Proof of Theorem leiso**
Step	Hyp	Ref	Expression
1		df-le 11373	. . . . . . 7 ⊢ ≤ = ((ℝ^* × ℝ^*) ∖ ^◡ < )
2	1	ineq1i 4116	. . . . . 6 ⊢ ( ≤ ∩ (𝐴 × 𝐴)) = (((ℝ^* × ℝ^*) ∖ ^◡ < ) ∩ (𝐴 × 𝐴))
3		indif1 4230	. . . . . 6 ⊢ (((ℝ^* × ℝ^) ∖ ^◡ < ) ∩ (𝐴 × 𝐴)) = (((ℝ^ × ℝ^*) ∩ (𝐴 × 𝐴)) ∖ ^◡ < )
4	2, 3	eqtri 2786	. . . . 5 ⊢ ( ≤ ∩ (𝐴 × 𝐴)) = (((ℝ^* × ℝ^*) ∩ (𝐴 × 𝐴)) ∖ ^◡ < )
5		xpss12 5670	. . . . . . . 8 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐴 ⊆ ℝ^) → (𝐴 × 𝐴) ⊆ (ℝ^ × ℝ^*))
6	5	anidms 577	. . . . . . 7 ⊢ (𝐴 ⊆ ℝ^* → (𝐴 × 𝐴) ⊆ (ℝ^* × ℝ^*))
7		sseqin2 4123	. . . . . . 7 ⊢ ((𝐴 × 𝐴) ⊆ (ℝ^* × ℝ^) ↔ ((ℝ^ × ℝ^*) ∩ (𝐴 × 𝐴)) = (𝐴 × 𝐴))
8	6, 7	sylib 221	. . . . . 6 ⊢ (𝐴 ⊆ ℝ^* → ((ℝ^* × ℝ^*) ∩ (𝐴 × 𝐴)) = (𝐴 × 𝐴))
9	8	difeq1d 4065	. . . . 5 ⊢ (𝐴 ⊆ ℝ^* → (((ℝ^* × ℝ^*) ∩ (𝐴 × 𝐴)) ∖ ^◡ < ) = ((𝐴 × 𝐴) ∖ ^◡ < ))
10	4, 9	eqtr2id 2811	. . . 4 ⊢ (𝐴 ⊆ ℝ^* → ((𝐴 × 𝐴) ∖ ^◡ < ) = ( ≤ ∩ (𝐴 × 𝐴)))
11		isoeq2 7346	. . . 4 ⊢ (((𝐴 × 𝐴) ∖ ^◡ < ) = ( ≤ ∩ (𝐴 × 𝐴)) → (𝐹 Isom ((𝐴 × 𝐴) ∖ ^◡ < ), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵)))
12	10, 11	syl 18	. . 3 ⊢ (𝐴 ⊆ ℝ^* → (𝐹 Isom ((𝐴 × 𝐴) ∖ ^◡ < ), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵)))
13	1	ineq1i 4116	. . . . . 6 ⊢ ( ≤ ∩ (𝐵 × 𝐵)) = (((ℝ^* × ℝ^*) ∖ ^◡ < ) ∩ (𝐵 × 𝐵))
14		indif1 4230	. . . . . 6 ⊢ (((ℝ^* × ℝ^) ∖ ^◡ < ) ∩ (𝐵 × 𝐵)) = (((ℝ^ × ℝ^*) ∩ (𝐵 × 𝐵)) ∖ ^◡ < )
15	13, 14	eqtri 2786	. . . . 5 ⊢ ( ≤ ∩ (𝐵 × 𝐵)) = (((ℝ^* × ℝ^*) ∩ (𝐵 × 𝐵)) ∖ ^◡ < )
16		xpss12 5670	. . . . . . . 8 ⊢ ((𝐵 ⊆ ℝ^* ∧ 𝐵 ⊆ ℝ^) → (𝐵 × 𝐵) ⊆ (ℝ^ × ℝ^*))
17	16	anidms 577	. . . . . . 7 ⊢ (𝐵 ⊆ ℝ^* → (𝐵 × 𝐵) ⊆ (ℝ^* × ℝ^*))
18		sseqin2 4123	. . . . . . 7 ⊢ ((𝐵 × 𝐵) ⊆ (ℝ^* × ℝ^) ↔ ((ℝ^ × ℝ^*) ∩ (𝐵 × 𝐵)) = (𝐵 × 𝐵))
19	17, 18	sylib 221	. . . . . 6 ⊢ (𝐵 ⊆ ℝ^* → ((ℝ^* × ℝ^*) ∩ (𝐵 × 𝐵)) = (𝐵 × 𝐵))
20	19	difeq1d 4065	. . . . 5 ⊢ (𝐵 ⊆ ℝ^* → (((ℝ^* × ℝ^*) ∩ (𝐵 × 𝐵)) ∖ ^◡ < ) = ((𝐵 × 𝐵) ∖ ^◡ < ))
21	15, 20	eqtr2id 2811	. . . 4 ⊢ (𝐵 ⊆ ℝ^* → ((𝐵 × 𝐵) ∖ ^◡ < ) = ( ≤ ∩ (𝐵 × 𝐵)))
22		isoeq3 7347	. . . 4 ⊢ (((𝐵 × 𝐵) ∖ ^◡ < ) = ( ≤ ∩ (𝐵 × 𝐵)) → (𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
23	21, 22	syl 18	. . 3 ⊢ (𝐵 ⊆ ℝ^* → (𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
24	12, 23	sylan9bb 519	. 2 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ⊆ ℝ^*) → (𝐹 Isom ((𝐴 × 𝐴) ∖ ^◡ < ), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
25		isocnv2 7359	. . 3 ⊢ (𝐹 Isom < , < (𝐴, 𝐵) ↔ 𝐹 Isom ^◡ < , ^◡ < (𝐴, 𝐵))
26		eqid 2763	. . . 4 ⊢ ((𝐴 × 𝐴) ∖ ^◡ < ) = ((𝐴 × 𝐴) ∖ ^◡ < )
27		eqid 2763	. . . 4 ⊢ ((𝐵 × 𝐵) ∖ ^◡ < ) = ((𝐵 × 𝐵) ∖ ^◡ < )
28	26, 27	isocnv3 7360	. . 3 ⊢ (𝐹 Isom ^◡ < , ^◡ < (𝐴, 𝐵) ↔ 𝐹 Isom ((𝐴 × 𝐴) ∖ ^◡ < ), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵))
29	25, 28	bitri 278	. 2 ⊢ (𝐹 Isom < , < (𝐴, 𝐵) ↔ 𝐹 Isom ((𝐴 × 𝐴) ∖ ^◡ < ), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵))
30		isores1 7362	. . 3 ⊢ (𝐹 Isom ≤ , ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ≤ (𝐴, 𝐵))
31		isores2 7361	. . 3 ⊢ (𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
32	30, 31	bitri 278	. 2 ⊢ (𝐹 Isom ≤ , ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
33	24, 29, 32	3bitr4g 317	1 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ⊆ ℝ^*) → (𝐹 Isom < , < (𝐴, 𝐵) ↔ 𝐹 Isom ≤ , ≤ (𝐴, 𝐵)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ⊆ wss 3900 ∖ cdif 4048 ∩ cin 4092 × cxp 5653 ^◡ccnv 5654 Isom wiso 6556 ℝ^*cxr 11366 < clt 11367 ≤ cle 11368

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-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5252 ax-nul 5263 ax-pr 5395

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-nf 1817 df-sb 2102 df-mo 2567 df-eu 2597 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-ss 3901 df-dif 4050 df-in 4094 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-opab 5171 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6509 df-fun 6557 df-fn 6558 df-f 6559 df-f1 6560 df-fo 6561 df-f1o 6562 df-fv 6563 df-isom 6564 df-le 11373

This theorem is used by: leisorel 14629 icopnfhmeo 25291 iccpnfhmeo 25293 xrhmeo 25294

W3C validator