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

Theorem leiso 14604
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 11349 . . . . . . 7 ≤ = ((ℝ* × ℝ*) ∖ ◡ < )
21ineq1i 4162 . . . . . 6 ( ≤ ∩ (𝐴 × 𝐴)) = (((ℝ* × ℝ*) ∖ ◡ < ) ∩ (𝐴 × 𝐴))
3 indif1 4228 . . . . . 6 (((ℝ* × ℝ*) ∖ ◡ < ) ∩ (𝐴 × 𝐴)) = (((ℝ* × ℝ*) ∩ (𝐴 × 𝐴)) ∖ ◡ < )
42, 3eqtri 2784 . . . . 5 ( ≤ ∩ (𝐴 × 𝐴)) = (((ℝ* × ℝ*) ∩ (𝐴 × 𝐴)) ∖ ◡ < )
5 xpss12 5666 . . . . . . . 8 ((𝐴 ⊆ ℝ* ∧ 𝐴 ⊆ ℝ*) → (𝐴 × 𝐴) ⊆ (ℝ* × ℝ*))
65anidms 577 . . . . . . 7 (𝐴 ⊆ ℝ* → (𝐴 × 𝐴) ⊆ (ℝ* × ℝ*))
7 sseqin2 4169 . . . . . . 7 ((𝐴 × 𝐴) ⊆ (ℝ* × ℝ*) ↔ ((ℝ* × ℝ*) ∩ (𝐴 × 𝐴)) = (𝐴 × 𝐴))
86, 7sylib 221 . . . . . 6 (𝐴 ⊆ ℝ* → ((ℝ* × ℝ*) ∩ (𝐴 × 𝐴)) = (𝐴 × 𝐴))
98difeq1d 4073 . . . . 5 (𝐴 ⊆ ℝ* → (((ℝ* × ℝ*) ∩ (𝐴 × 𝐴)) ∖ ◡ < ) = ((𝐴 × 𝐴) ∖ ◡ < ))
104, 9eqtr2id 2809 . . . 4 (𝐴 ⊆ ℝ* → ((𝐴 × 𝐴) ∖ ◡ < ) = ( ≤ ∩ (𝐴 × 𝐴)))
11 isoeq2 7326 . . . 4 (((𝐴 × 𝐴) ∖ ◡ < ) = ( ≤ ∩ (𝐴 × 𝐴)) → (𝐹 Isom ((𝐴 × 𝐴) ∖ ◡ < ), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵)))
1210, 11syl 18 . . 3 (𝐴 ⊆ ℝ* → (𝐹 Isom ((𝐴 × 𝐴) ∖ ◡ < ), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵)))
131ineq1i 4162 . . . . . 6 ( ≤ ∩ (𝐵 × 𝐵)) = (((ℝ* × ℝ*) ∖ ◡ < ) ∩ (𝐵 × 𝐵))
14 indif1 4228 . . . . . 6 (((ℝ* × ℝ*) ∖ ◡ < ) ∩ (𝐵 × 𝐵)) = (((ℝ* × ℝ*) ∩ (𝐵 × 𝐵)) ∖ ◡ < )
1513, 14eqtri 2784 . . . . 5 ( ≤ ∩ (𝐵 × 𝐵)) = (((ℝ* × ℝ*) ∩ (𝐵 × 𝐵)) ∖ ◡ < )
16 xpss12 5666 . . . . . . . 8 ((𝐵 ⊆ ℝ* ∧ 𝐵 ⊆ ℝ*) → (𝐵 × 𝐵) ⊆ (ℝ* × ℝ*))
1716anidms 577 . . . . . . 7 (𝐵 ⊆ ℝ* → (𝐵 × 𝐵) ⊆ (ℝ* × ℝ*))
18 sseqin2 4169 . . . . . . 7 ((𝐵 × 𝐵) ⊆ (ℝ* × ℝ*) ↔ ((ℝ* × ℝ*) ∩ (𝐵 × 𝐵)) = (𝐵 × 𝐵))
1917, 18sylib 221 . . . . . 6 (𝐵 ⊆ ℝ* → ((ℝ* × ℝ*) ∩ (𝐵 × 𝐵)) = (𝐵 × 𝐵))
2019difeq1d 4073 . . . . 5 (𝐵 ⊆ ℝ* → (((ℝ* × ℝ*) ∩ (𝐵 × 𝐵)) ∖ ◡ < ) = ((𝐵 × 𝐵) ∖ ◡ < ))
2115, 20eqtr2id 2809 . . . 4 (𝐵 ⊆ ℝ* → ((𝐵 × 𝐵) ∖ ◡ < ) = ( ≤ ∩ (𝐵 × 𝐵)))
22 isoeq3 7327 . . . 4 (((𝐵 × 𝐵) ∖ ◡ < ) = ( ≤ ∩ (𝐵 × 𝐵)) → (𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
2321, 22syl 18 . . 3 (𝐵 ⊆ ℝ* → (𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
2412, 23sylan9bb 519 . 2 ((𝐴 ⊆ ℝ* ∧ 𝐵 ⊆ ℝ*) → (𝐹 Isom ((𝐴 × 𝐴) ∖ ◡ < ), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
25 isocnv2 7339 . . 3 (𝐹 Isom < , < (𝐴, 𝐵) ↔ 𝐹 Isom ◡ < , ◡ < (𝐴, 𝐵))
26 eqid 2761 . . . 4 ((𝐴 × 𝐴) ∖ ◡ < ) = ((𝐴 × 𝐴) ∖ ◡ < )
27 eqid 2761 . . . 4 ((𝐵 × 𝐵) ∖ ◡ < ) = ((𝐵 × 𝐵) ∖ ◡ < )
2826, 27isocnv3 7340 . . 3 (𝐹 Isom ◡ < , ◡ < (𝐴, 𝐵) ↔ 𝐹 Isom ((𝐴 × 𝐴) ∖ ◡ < ), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵))
2925, 28bitri 278 . 2 (𝐹 Isom < , < (𝐴, 𝐵) ↔ 𝐹 Isom ((𝐴 × 𝐴) ∖ ◡ < ), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵))
30 isores1 7342 . . 3 (𝐹 Isom ≤ , ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ≤ (𝐴, 𝐵))
31 isores2 7341 . . 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 1570   ∖ cdif 3896   ∩ cin 3898   ⊆ wss 3899   × cxp 5649  ◡ccnv 5650   Isom wiso 6539  ℝ*cxr 11342   < clt 11343   ≤ cle 11344
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-isom 6547  df-le 11349
This theorem is used by:  leisorel  14605  icopnfhmeo  25264  iccpnfhmeo  25266  xrhmeo  25267
  Copyright terms: Public domain W3C validator