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 14499

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 11252	. . . . . . 7 ⊢ ≤ = ((ℝ^* × ℝ^*) ∖ ^◡ < )
2	1	ineq1i 4177	. . . . . 6 ⊢ ( ≤ ∩ (𝐴 × 𝐴)) = (((ℝ^* × ℝ^*) ∖ ^◡ < ) ∩ (𝐴 × 𝐴))
3		indif1 4243	. . . . . 6 ⊢ (((ℝ^* × ℝ^) ∖ ^◡ < ) ∩ (𝐴 × 𝐴)) = (((ℝ^ × ℝ^*) ∩ (𝐴 × 𝐴)) ∖ ^◡ < )
4	2, 3	eqtri 2793	. . . . 5 ⊢ ( ≤ ∩ (𝐴 × 𝐴)) = (((ℝ^* × ℝ^*) ∩ (𝐴 × 𝐴)) ∖ ^◡ < )
5		xpss12 5680	. . . . . . . 8 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐴 ⊆ ℝ^) → (𝐴 × 𝐴) ⊆ (ℝ^ × ℝ^*))
6	5	anidms 576	. . . . . . 7 ⊢ (𝐴 ⊆ ℝ^* → (𝐴 × 𝐴) ⊆ (ℝ^* × ℝ^*))
7		sseqin2 4184	. . . . . . 7 ⊢ ((𝐴 × 𝐴) ⊆ (ℝ^* × ℝ^) ↔ ((ℝ^ × ℝ^*) ∩ (𝐴 × 𝐴)) = (𝐴 × 𝐴))
8	6, 7	sylib 221	. . . . . 6 ⊢ (𝐴 ⊆ ℝ^* → ((ℝ^* × ℝ^*) ∩ (𝐴 × 𝐴)) = (𝐴 × 𝐴))
9	8	difeq1d 4088	. . . . 5 ⊢ (𝐴 ⊆ ℝ^* → (((ℝ^* × ℝ^*) ∩ (𝐴 × 𝐴)) ∖ ^◡ < ) = ((𝐴 × 𝐴) ∖ ^◡ < ))
10	4, 9	eqtr2id 2818	. . . 4 ⊢ (𝐴 ⊆ ℝ^* → ((𝐴 × 𝐴) ∖ ^◡ < ) = ( ≤ ∩ (𝐴 × 𝐴)))
11		isoeq2 7320	. . . 4 ⊢ (((𝐴 × 𝐴) ∖ ^◡ < ) = ( ≤ ∩ (𝐴 × 𝐴)) → (𝐹 Isom ((𝐴 × 𝐴) ∖ ^◡ < ), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵)))
12	10, 11	syl 18	. . 3 ⊢ (𝐴 ⊆ ℝ^* → (𝐹 Isom ((𝐴 × 𝐴) ∖ ^◡ < ), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵)))
13	1	ineq1i 4177	. . . . . 6 ⊢ ( ≤ ∩ (𝐵 × 𝐵)) = (((ℝ^* × ℝ^*) ∖ ^◡ < ) ∩ (𝐵 × 𝐵))
14		indif1 4243	. . . . . 6 ⊢ (((ℝ^* × ℝ^) ∖ ^◡ < ) ∩ (𝐵 × 𝐵)) = (((ℝ^ × ℝ^*) ∩ (𝐵 × 𝐵)) ∖ ^◡ < )
15	13, 14	eqtri 2793	. . . . 5 ⊢ ( ≤ ∩ (𝐵 × 𝐵)) = (((ℝ^* × ℝ^*) ∩ (𝐵 × 𝐵)) ∖ ^◡ < )
16		xpss12 5680	. . . . . . . 8 ⊢ ((𝐵 ⊆ ℝ^* ∧ 𝐵 ⊆ ℝ^) → (𝐵 × 𝐵) ⊆ (ℝ^ × ℝ^*))
17	16	anidms 576	. . . . . . 7 ⊢ (𝐵 ⊆ ℝ^* → (𝐵 × 𝐵) ⊆ (ℝ^* × ℝ^*))
18		sseqin2 4184	. . . . . . 7 ⊢ ((𝐵 × 𝐵) ⊆ (ℝ^* × ℝ^) ↔ ((ℝ^ × ℝ^*) ∩ (𝐵 × 𝐵)) = (𝐵 × 𝐵))
19	17, 18	sylib 221	. . . . . 6 ⊢ (𝐵 ⊆ ℝ^* → ((ℝ^* × ℝ^*) ∩ (𝐵 × 𝐵)) = (𝐵 × 𝐵))
20	19	difeq1d 4088	. . . . 5 ⊢ (𝐵 ⊆ ℝ^* → (((ℝ^* × ℝ^*) ∩ (𝐵 × 𝐵)) ∖ ^◡ < ) = ((𝐵 × 𝐵) ∖ ^◡ < ))
21	15, 20	eqtr2id 2818	. . . 4 ⊢ (𝐵 ⊆ ℝ^* → ((𝐵 × 𝐵) ∖ ^◡ < ) = ( ≤ ∩ (𝐵 × 𝐵)))
22		isoeq3 7321	. . . 4 ⊢ (((𝐵 × 𝐵) ∖ ^◡ < ) = ( ≤ ∩ (𝐵 × 𝐵)) → (𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
23	21, 22	syl 18	. . 3 ⊢ (𝐵 ⊆ ℝ^* → (𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
24	12, 23	sylan9bb 518	. 2 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ⊆ ℝ^*) → (𝐹 Isom ((𝐴 × 𝐴) ∖ ^◡ < ), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
25		isocnv2 7333	. . 3 ⊢ (𝐹 Isom < , < (𝐴, 𝐵) ↔ 𝐹 Isom ^◡ < , ^◡ < (𝐴, 𝐵))
26		eqid 2770	. . . 4 ⊢ ((𝐴 × 𝐴) ∖ ^◡ < ) = ((𝐴 × 𝐴) ∖ ^◡ < )
27		eqid 2770	. . . 4 ⊢ ((𝐵 × 𝐵) ∖ ^◡ < ) = ((𝐵 × 𝐵) ∖ ^◡ < )
28	26, 27	isocnv3 7334	. . 3 ⊢ (𝐹 Isom ^◡ < , ^◡ < (𝐴, 𝐵) ↔ 𝐹 Isom ((𝐴 × 𝐴) ∖ ^◡ < ), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵))
29	25, 28	bitri 278	. 2 ⊢ (𝐹 Isom < , < (𝐴, 𝐵) ↔ 𝐹 Isom ((𝐴 × 𝐴) ∖ ^◡ < ), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵))
30		isores1 7336	. . 3 ⊢ (𝐹 Isom ≤ , ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ≤ (𝐴, 𝐵))
31		isores2 7335	. . 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

Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1568 ∖ cdif 3910 ∩ cin 3912 ⊆ wss 3913 × cxp 5663 ^◡ccnv 5664 Isom wiso 6541 ℝ^*cxr 11245 < clt 11246 ≤ cle 11247

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1823 ax-4 1837 ax-5 1938 ax-6 1995 ax-7 2036 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2199 ax-12 2220 ax-ext 2742 ax-sep 5262 ax-nul 5274 ax-pr 5408

This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1571 df-fal 1581 df-ex 1808 df-nf 1812 df-sb 2099 df-mo 2574 df-eu 2604 df-clab 2749 df-cleq 2762 df-clel 2845 df-ne 2966 df-ral 3087 df-rex 3097 df-rab 3424 df-v 3464 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4878 df-br 5115 df-opab 5179 df-id 5560 df-xp 5671 df-rel 5672 df-cnv 5673 df-co 5674 df-dm 5675 df-rn 5676 df-res 5677 df-ima 5678 df-iota 6496 df-fun 6542 df-fn 6543 df-f 6544 df-f1 6545 df-fo 6546 df-f1o 6547 df-fv 6548 df-isom 6549 df-le 11252

This theorem is referenced by: leisorel 14500 icopnfhmeo 25085 iccpnfhmeo 25087 xrhmeo 25088

W3C validator