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

Theorem leiso 14644
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
StepHypRef Expression
1 df-le 11387 . . . . . . 7 ≤ = ((ℝ* × ℝ*) ∖ ◡ < )
21ineq1i 4115 . . . . . 6 ( ≤ ∩ (𝐴 × 𝐴)) = (((ℝ* × ℝ*) ∖ ◡ < ) ∩ (𝐴 × 𝐴))
3 indif1 4229 . . . . . 6 (((ℝ* × ℝ*) ∖ ◡ < ) ∩ (𝐴 × 𝐴)) = (((ℝ* × ℝ*) ∩ (𝐴 × 𝐴)) ∖ ◡ < )
42, 3eqtri 2789 . . . . 5 ( ≤ ∩ (𝐴 × 𝐴)) = (((ℝ* × ℝ*) ∩ (𝐴 × 𝐴)) ∖ ◡ < )
5 xpss12 5672 . . . . . . . 8 ((𝐴 ⊆ ℝ* ∧ 𝐴 ⊆ ℝ*) → (𝐴 × 𝐴) ⊆ (ℝ* × ℝ*))
65anidms 577 . . . . . . 7 (𝐴 ⊆ ℝ* → (𝐴 × 𝐴) ⊆ (ℝ* × ℝ*))
7 sseqin2 4122 . . . . . . 7 ((𝐴 × 𝐴) ⊆ (ℝ* × ℝ*) ↔ ((ℝ* × ℝ*) ∩ (𝐴 × 𝐴)) = (𝐴 × 𝐴))
86, 7sylib 221 . . . . . 6 (𝐴 ⊆ ℝ* → ((ℝ* × ℝ*) ∩ (𝐴 × 𝐴)) = (𝐴 × 𝐴))
98difeq1d 4064 . . . . 5 (𝐴 ⊆ ℝ* → (((ℝ* × ℝ*) ∩ (𝐴 × 𝐴)) ∖ ◡ < ) = ((𝐴 × 𝐴) ∖ ◡ < ))
104, 9eqtr2id 2814 . . . 4 (𝐴 ⊆ ℝ* → ((𝐴 × 𝐴) ∖ ◡ < ) = ( ≤ ∩ (𝐴 × 𝐴)))
11 isoeq2 7356 . . . 4 (((𝐴 × 𝐴) ∖ ◡ < ) = ( ≤ ∩ (𝐴 × 𝐴)) → (𝐹 Isom ((𝐴 × 𝐴) ∖ ◡ < ), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵)))
1210, 11syl 18 . . 3 (𝐴 ⊆ ℝ* → (𝐹 Isom ((𝐴 × 𝐴) ∖ ◡ < ), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵)))
131ineq1i 4115 . . . . . 6 ( ≤ ∩ (𝐵 × 𝐵)) = (((ℝ* × ℝ*) ∖ ◡ < ) ∩ (𝐵 × 𝐵))
14 indif1 4229 . . . . . 6 (((ℝ* × ℝ*) ∖ ◡ < ) ∩ (𝐵 × 𝐵)) = (((ℝ* × ℝ*) ∩ (𝐵 × 𝐵)) ∖ ◡ < )
1513, 14eqtri 2789 . . . . 5 ( ≤ ∩ (𝐵 × 𝐵)) = (((ℝ* × ℝ*) ∩ (𝐵 × 𝐵)) ∖ ◡ < )
16 xpss12 5672 . . . . . . . 8 ((𝐵 ⊆ ℝ* ∧ 𝐵 ⊆ ℝ*) → (𝐵 × 𝐵) ⊆ (ℝ* × ℝ*))
1716anidms 577 . . . . . . 7 (𝐵 ⊆ ℝ* → (𝐵 × 𝐵) ⊆ (ℝ* × ℝ*))
18 sseqin2 4122 . . . . . . 7 ((𝐵 × 𝐵) ⊆ (ℝ* × ℝ*) ↔ ((ℝ* × ℝ*) ∩ (𝐵 × 𝐵)) = (𝐵 × 𝐵))
1917, 18sylib 221 . . . . . 6 (𝐵 ⊆ ℝ* → ((ℝ* × ℝ*) ∩ (𝐵 × 𝐵)) = (𝐵 × 𝐵))
2019difeq1d 4064 . . . . 5 (𝐵 ⊆ ℝ* → (((ℝ* × ℝ*) ∩ (𝐵 × 𝐵)) ∖ ◡ < ) = ((𝐵 × 𝐵) ∖ ◡ < ))
2115, 20eqtr2id 2814 . . . 4 (𝐵 ⊆ ℝ* → ((𝐵 × 𝐵) ∖ ◡ < ) = ( ≤ ∩ (𝐵 × 𝐵)))
22 isoeq3 7357 . . . 4 (((𝐵 × 𝐵) ∖ ◡ < ) = ( ≤ ∩ (𝐵 × 𝐵)) → (𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
2321, 22syl 18 . . 3 (𝐵 ⊆ ℝ* → (𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
2412, 23sylan9bb 519 . 2 ((𝐴 ⊆ ℝ* ∧ 𝐵 ⊆ ℝ*) → (𝐹 Isom ((𝐴 × 𝐴) ∖ ◡ < ), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
25 isocnv2 7369 . . 3 (𝐹 Isom < , < (𝐴, 𝐵) ↔ 𝐹 Isom ◡ < , ◡ < (𝐴, 𝐵))
26 eqid 2766 . . . 4 ((𝐴 × 𝐴) ∖ ◡ < ) = ((𝐴 × 𝐴) ∖ ◡ < )
27 eqid 2766 . . . 4 ((𝐵 × 𝐵) ∖ ◡ < ) = ((𝐵 × 𝐵) ∖ ◡ < )
2826, 27isocnv3 7370 . . 3 (𝐹 Isom ◡ < , ◡ < (𝐴, 𝐵) ↔ 𝐹 Isom ((𝐴 × 𝐴) ∖ ◡ < ), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵))
2925, 28bitri 278 . 2 (𝐹 Isom < , < (𝐴, 𝐵) ↔ 𝐹 Isom ((𝐴 × 𝐴) ∖ ◡ < ), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵))
30 isores1 7372 . . 3 (𝐹 Isom ≤ , ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ≤ (𝐴, 𝐵))
31 isores2 7371 . . 3 (𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
3230, 31bitri 278 . 2 (𝐹 Isom ≤ , ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
3324, 29, 323bitr4g 317 1 ((𝐴 ⊆ ℝ* ∧ 𝐵 ⊆ ℝ*) → (𝐹 Isom < , < (𝐴, 𝐵) ↔ 𝐹 Isom ≤ , ≤ (𝐴, 𝐵)))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1572   ⊆ wss 3899   ∖ cdif 4047   ∩ cin 4091   × cxp 5655  ◡ccnv 5656   Isom wiso 6566  ℝ*cxr 11380   < clt 11381   ≤ cle 11382
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1830  ax-4 1844  ax-5 1947  ax-6 2004  ax-7 2045  ax-8 2152  ax-9 2160  ax-10 2183  ax-11 2200  ax-12 2219  ax-ext 2738  ax-sep 5254  ax-nul 5265  ax-pr 5397
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1106  df-tru 1575  df-fal 1585  df-ex 1815  df-nf 1819  df-sb 2104  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2842  df-ne 2963  df-ral 3084  df-rex 3094  df-rab 3416  df-v 3455  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-sn 4588  df-pr 4590  df-op 4840  df-uni 4872  df-br 5108  df-opab 5173  df-id 5552  df-xp 5663  df-rel 5664  df-cnv 5665  df-co 5666  df-dm 5667  df-rn 5668  df-res 5669  df-ima 5670  df-iota 6519  df-fun 6567  df-fn 6568  df-f 6569  df-f1 6570  df-fo 6571  df-f1o 6572  df-fv 6573  df-isom 6574  df-le 11387
This theorem is used by:  leisorel  14645  icopnfhmeo  25321  iccpnfhmeo  25323  xrhmeo  25324
  Copyright terms: Public domain W3C validator