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 14396

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 11186	. . . . . . 7 ⊢ ≤ = ((ℝ^* × ℝ^*) ∖ ^◡ < )
2	1	ineq1i 4170	. . . . . 6 ⊢ ( ≤ ∩ (𝐴 × 𝐴)) = (((ℝ^* × ℝ^*) ∖ ^◡ < ) ∩ (𝐴 × 𝐴))
3		indif1 4236	. . . . . 6 ⊢ (((ℝ^* × ℝ^) ∖ ^◡ < ) ∩ (𝐴 × 𝐴)) = (((ℝ^ × ℝ^*) ∩ (𝐴 × 𝐴)) ∖ ^◡ < )
4	2, 3	eqtri 2760	. . . . 5 ⊢ ( ≤ ∩ (𝐴 × 𝐴)) = (((ℝ^* × ℝ^*) ∩ (𝐴 × 𝐴)) ∖ ^◡ < )
5		xpss12 5649	. . . . . . . 8 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐴 ⊆ ℝ^) → (𝐴 × 𝐴) ⊆ (ℝ^ × ℝ^*))
6	5	anidms 566	. . . . . . 7 ⊢ (𝐴 ⊆ ℝ^* → (𝐴 × 𝐴) ⊆ (ℝ^* × ℝ^*))
7		sseqin2 4177	. . . . . . 7 ⊢ ((𝐴 × 𝐴) ⊆ (ℝ^* × ℝ^) ↔ ((ℝ^ × ℝ^*) ∩ (𝐴 × 𝐴)) = (𝐴 × 𝐴))
8	6, 7	sylib 218	. . . . . 6 ⊢ (𝐴 ⊆ ℝ^* → ((ℝ^* × ℝ^*) ∩ (𝐴 × 𝐴)) = (𝐴 × 𝐴))
9	8	difeq1d 4079	. . . . 5 ⊢ (𝐴 ⊆ ℝ^* → (((ℝ^* × ℝ^*) ∩ (𝐴 × 𝐴)) ∖ ^◡ < ) = ((𝐴 × 𝐴) ∖ ^◡ < ))
10	4, 9	eqtr2id 2785	. . . 4 ⊢ (𝐴 ⊆ ℝ^* → ((𝐴 × 𝐴) ∖ ^◡ < ) = ( ≤ ∩ (𝐴 × 𝐴)))
11		isoeq2 7276	. . . 4 ⊢ (((𝐴 × 𝐴) ∖ ^◡ < ) = ( ≤ ∩ (𝐴 × 𝐴)) → (𝐹 Isom ((𝐴 × 𝐴) ∖ ^◡ < ), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵)))
12	10, 11	syl 17	. . 3 ⊢ (𝐴 ⊆ ℝ^* → (𝐹 Isom ((𝐴 × 𝐴) ∖ ^◡ < ), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵)))
13	1	ineq1i 4170	. . . . . 6 ⊢ ( ≤ ∩ (𝐵 × 𝐵)) = (((ℝ^* × ℝ^*) ∖ ^◡ < ) ∩ (𝐵 × 𝐵))
14		indif1 4236	. . . . . 6 ⊢ (((ℝ^* × ℝ^) ∖ ^◡ < ) ∩ (𝐵 × 𝐵)) = (((ℝ^ × ℝ^*) ∩ (𝐵 × 𝐵)) ∖ ^◡ < )
15	13, 14	eqtri 2760	. . . . 5 ⊢ ( ≤ ∩ (𝐵 × 𝐵)) = (((ℝ^* × ℝ^*) ∩ (𝐵 × 𝐵)) ∖ ^◡ < )
16		xpss12 5649	. . . . . . . 8 ⊢ ((𝐵 ⊆ ℝ^* ∧ 𝐵 ⊆ ℝ^) → (𝐵 × 𝐵) ⊆ (ℝ^ × ℝ^*))
17	16	anidms 566	. . . . . . 7 ⊢ (𝐵 ⊆ ℝ^* → (𝐵 × 𝐵) ⊆ (ℝ^* × ℝ^*))
18		sseqin2 4177	. . . . . . 7 ⊢ ((𝐵 × 𝐵) ⊆ (ℝ^* × ℝ^) ↔ ((ℝ^ × ℝ^*) ∩ (𝐵 × 𝐵)) = (𝐵 × 𝐵))
19	17, 18	sylib 218	. . . . . 6 ⊢ (𝐵 ⊆ ℝ^* → ((ℝ^* × ℝ^*) ∩ (𝐵 × 𝐵)) = (𝐵 × 𝐵))
20	19	difeq1d 4079	. . . . 5 ⊢ (𝐵 ⊆ ℝ^* → (((ℝ^* × ℝ^*) ∩ (𝐵 × 𝐵)) ∖ ^◡ < ) = ((𝐵 × 𝐵) ∖ ^◡ < ))
21	15, 20	eqtr2id 2785	. . . 4 ⊢ (𝐵 ⊆ ℝ^* → ((𝐵 × 𝐵) ∖ ^◡ < ) = ( ≤ ∩ (𝐵 × 𝐵)))
22		isoeq3 7277	. . . 4 ⊢ (((𝐵 × 𝐵) ∖ ^◡ < ) = ( ≤ ∩ (𝐵 × 𝐵)) → (𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
23	21, 22	syl 17	. . 3 ⊢ (𝐵 ⊆ ℝ^* → (𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
24	12, 23	sylan9bb 509	. 2 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ⊆ ℝ^*) → (𝐹 Isom ((𝐴 × 𝐴) ∖ ^◡ < ), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
25		isocnv2 7289	. . 3 ⊢ (𝐹 Isom < , < (𝐴, 𝐵) ↔ 𝐹 Isom ^◡ < , ^◡ < (𝐴, 𝐵))
26		eqid 2737	. . . 4 ⊢ ((𝐴 × 𝐴) ∖ ^◡ < ) = ((𝐴 × 𝐴) ∖ ^◡ < )
27		eqid 2737	. . . 4 ⊢ ((𝐵 × 𝐵) ∖ ^◡ < ) = ((𝐵 × 𝐵) ∖ ^◡ < )
28	26, 27	isocnv3 7290	. . 3 ⊢ (𝐹 Isom ^◡ < , ^◡ < (𝐴, 𝐵) ↔ 𝐹 Isom ((𝐴 × 𝐴) ∖ ^◡ < ), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵))
29	25, 28	bitri 275	. 2 ⊢ (𝐹 Isom < , < (𝐴, 𝐵) ↔ 𝐹 Isom ((𝐴 × 𝐴) ∖ ^◡ < ), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵))
30		isores1 7292	. . 3 ⊢ (𝐹 Isom ≤ , ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ≤ (𝐴, 𝐵))
31		isores2 7291	. . 3 ⊢ (𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
32	30, 31	bitri 275	. 2 ⊢ (𝐹 Isom ≤ , ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
33	24, 29, 32	3bitr4g 314	1 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ⊆ ℝ^*) → (𝐹 Isom < , < (𝐴, 𝐵) ↔ 𝐹 Isom ≤ , ≤ (𝐴, 𝐵)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∖ cdif 3900 ∩ cin 3902 ⊆ wss 3903 × cxp 5632 ^◡ccnv 5633 Isom wiso 6503 ℝ^*cxr 11179 < clt 11180 ≤ cle 11181

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-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 ax-sep 5245 ax-nul 5255 ax-pr 5381

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-nf 1786 df-sb 2069 df-mo 2540 df-eu 2570 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-dif 3906 df-un 3908 df-in 3910 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-opab 5163 df-id 5529 df-xp 5640 df-rel 5641 df-cnv 5642 df-co 5643 df-dm 5644 df-rn 5645 df-res 5646 df-ima 5647 df-iota 6458 df-fun 6504 df-fn 6505 df-f 6506 df-f1 6507 df-fo 6508 df-f1o 6509 df-fv 6510 df-isom 6511 df-le 11186

This theorem is referenced by: leisorel 14397 icopnfhmeo 24914 iccpnfhmeo 24916 xrhmeo 24917

W3C validator