Users' Mathboxes Mathbox for Thierry Arnoux < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  gtiso Structured version   Visualization version   GIF version

Theorem gtiso 32905
Description: Two ways to write a strictly decreasing function on the reals. (Contributed by Thierry Arnoux, 6-Apr-2017.)
Assertion
Ref Expression
gtiso ((𝐴 ⊆ ℝ*𝐵 ⊆ ℝ*) → (𝐹 Isom < , < (𝐴, 𝐵) ↔ 𝐹 Isom ≤ , ≤ (𝐴, 𝐵)))

Proof of Theorem gtiso
StepHypRef Expression
1 eqid 2764 . . . . 5 ((𝐴 × 𝐴) ∖ < ) = ((𝐴 × 𝐴) ∖ < )
2 eqid 2764 . . . . 5 ((𝐵 × 𝐵) ∖ < ) = ((𝐵 × 𝐵) ∖ < )
31, 2isocnv3 7318 . . . 4 (𝐹 Isom < , < (𝐴, 𝐵) ↔ 𝐹 Isom ((𝐴 × 𝐴) ∖ < ), ((𝐵 × 𝐵) ∖ < )(𝐴, 𝐵))
43a1i 11 . . 3 ((𝐴 ⊆ ℝ*𝐵 ⊆ ℝ*) → (𝐹 Isom < , < (𝐴, 𝐵) ↔ 𝐹 Isom ((𝐴 × 𝐴) ∖ < ), ((𝐵 × 𝐵) ∖ < )(𝐴, 𝐵)))
5 df-le 11224 . . . . . . . . . 10 ≤ = ((ℝ* × ℝ*) ∖ < )
65cnveqi 5848 . . . . . . . . 9 ≤ = ((ℝ* × ℝ*) ∖ < )
7 cnvdif 6129 . . . . . . . . 9 ((ℝ* × ℝ*) ∖ < ) = ((ℝ* × ℝ*) ∖ < )
8 cnvxp 6144 . . . . . . . . . 10 (ℝ* × ℝ*) = (ℝ* × ℝ*)
9 ltrel 11246 . . . . . . . . . . 11 Rel <
10 dfrel2 6177 . . . . . . . . . . 11 (Rel < ↔ < = < )
119, 10mpbi 232 . . . . . . . . . 10 < = <
128, 11difeq12i 4080 . . . . . . . . 9 ((ℝ* × ℝ*) ∖ < ) = ((ℝ* × ℝ*) ∖ < )
136, 7, 123eqtri 2791 . . . . . . . 8 ≤ = ((ℝ* × ℝ*) ∖ < )
1413ineq1i 4170 . . . . . . 7 ( ≤ ∩ (𝐴 × 𝐴)) = (((ℝ* × ℝ*) ∖ < ) ∩ (𝐴 × 𝐴))
15 indif1 4236 . . . . . . 7 (((ℝ* × ℝ*) ∖ < ) ∩ (𝐴 × 𝐴)) = (((ℝ* × ℝ*) ∩ (𝐴 × 𝐴)) ∖ < )
1614, 15eqtri 2787 . . . . . 6 ( ≤ ∩ (𝐴 × 𝐴)) = (((ℝ* × ℝ*) ∩ (𝐴 × 𝐴)) ∖ < )
17 xpss12 5664 . . . . . . . . 9 ((𝐴 ⊆ ℝ*𝐴 ⊆ ℝ*) → (𝐴 × 𝐴) ⊆ (ℝ* × ℝ*))
1817anidms 574 . . . . . . . 8 (𝐴 ⊆ ℝ* → (𝐴 × 𝐴) ⊆ (ℝ* × ℝ*))
19 sseqin2 4177 . . . . . . . 8 ((𝐴 × 𝐴) ⊆ (ℝ* × ℝ*) ↔ ((ℝ* × ℝ*) ∩ (𝐴 × 𝐴)) = (𝐴 × 𝐴))
2018, 19sylib 220 . . . . . . 7 (𝐴 ⊆ ℝ* → ((ℝ* × ℝ*) ∩ (𝐴 × 𝐴)) = (𝐴 × 𝐴))
2120difeq1d 4081 . . . . . 6 (𝐴 ⊆ ℝ* → (((ℝ* × ℝ*) ∩ (𝐴 × 𝐴)) ∖ < ) = ((𝐴 × 𝐴) ∖ < ))
2216, 21eqtr2id 2812 . . . . 5 (𝐴 ⊆ ℝ* → ((𝐴 × 𝐴) ∖ < ) = ( ≤ ∩ (𝐴 × 𝐴)))
2322adantr 484 . . . 4 ((𝐴 ⊆ ℝ*𝐵 ⊆ ℝ*) → ((𝐴 × 𝐴) ∖ < ) = ( ≤ ∩ (𝐴 × 𝐴)))
24 isoeq2 7304 . . . 4 (((𝐴 × 𝐴) ∖ < ) = ( ≤ ∩ (𝐴 × 𝐴)) → (𝐹 Isom ((𝐴 × 𝐴) ∖ < ), ((𝐵 × 𝐵) ∖ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ < )(𝐴, 𝐵)))
2523, 24syl 17 . . 3 ((𝐴 ⊆ ℝ*𝐵 ⊆ ℝ*) → (𝐹 Isom ((𝐴 × 𝐴) ∖ < ), ((𝐵 × 𝐵) ∖ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ < )(𝐴, 𝐵)))
265ineq1i 4170 . . . . . . 7 ( ≤ ∩ (𝐵 × 𝐵)) = (((ℝ* × ℝ*) ∖ < ) ∩ (𝐵 × 𝐵))
27 indif1 4236 . . . . . . 7 (((ℝ* × ℝ*) ∖ < ) ∩ (𝐵 × 𝐵)) = (((ℝ* × ℝ*) ∩ (𝐵 × 𝐵)) ∖ < )
2826, 27eqtri 2787 . . . . . 6 ( ≤ ∩ (𝐵 × 𝐵)) = (((ℝ* × ℝ*) ∩ (𝐵 × 𝐵)) ∖ < )
29 xpss12 5664 . . . . . . . . 9 ((𝐵 ⊆ ℝ*𝐵 ⊆ ℝ*) → (𝐵 × 𝐵) ⊆ (ℝ* × ℝ*))
3029anidms 574 . . . . . . . 8 (𝐵 ⊆ ℝ* → (𝐵 × 𝐵) ⊆ (ℝ* × ℝ*))
31 sseqin2 4177 . . . . . . . 8 ((𝐵 × 𝐵) ⊆ (ℝ* × ℝ*) ↔ ((ℝ* × ℝ*) ∩ (𝐵 × 𝐵)) = (𝐵 × 𝐵))
3230, 31sylib 220 . . . . . . 7 (𝐵 ⊆ ℝ* → ((ℝ* × ℝ*) ∩ (𝐵 × 𝐵)) = (𝐵 × 𝐵))
3332difeq1d 4081 . . . . . 6 (𝐵 ⊆ ℝ* → (((ℝ* × ℝ*) ∩ (𝐵 × 𝐵)) ∖ < ) = ((𝐵 × 𝐵) ∖ < ))
3428, 33eqtr2id 2812 . . . . 5 (𝐵 ⊆ ℝ* → ((𝐵 × 𝐵) ∖ < ) = ( ≤ ∩ (𝐵 × 𝐵)))
3534adantl 485 . . . 4 ((𝐴 ⊆ ℝ*𝐵 ⊆ ℝ*) → ((𝐵 × 𝐵) ∖ < ) = ( ≤ ∩ (𝐵 × 𝐵)))
36 isoeq3 7305 . . . 4 (((𝐵 × 𝐵) ∖ < ) = ( ≤ ∩ (𝐵 × 𝐵)) → (𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
3735, 36syl 17 . . 3 ((𝐴 ⊆ ℝ*𝐵 ⊆ ℝ*) → (𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ < )(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
384, 25, 373bitrd 307 . 2 ((𝐴 ⊆ ℝ*𝐵 ⊆ ℝ*) → (𝐹 Isom < , < (𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
39 isocnv2 7317 . . 3 (𝐹 Isom ≤ , ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ≤ , ≤ (𝐴, 𝐵))
40 isores2 7319 . . . 4 (𝐹 Isom ≤ , ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ≤ , ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
41 isores1 7320 . . . 4 (𝐹 Isom ≤ , ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
4240, 41bitri 277 . . 3 (𝐹 Isom ≤ , ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
43 lerel 11248 . . . . 5 Rel ≤
44 dfrel2 6177 . . . . 5 (Rel ≤ ↔ ≤ = ≤ )
4543, 44mpbi 232 . . . 4 ≤ = ≤
46 isoeq2 7304 . . . 4 ( ≤ = ≤ → (𝐹 Isom ≤ , ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ≤ , ≤ (𝐴, 𝐵)))
4745, 46ax-mp 5 . . 3 (𝐹 Isom ≤ , ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ≤ , ≤ (𝐴, 𝐵))
4839, 42, 473bitr3ri 304 . 2 (𝐹 Isom ≤ , ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ( ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
4938, 48bitr4di 291 1 ((𝐴 ⊆ ℝ*𝐵 ⊆ ℝ*) → (𝐹 Isom < , < (𝐴, 𝐵) ↔ 𝐹 Isom ≤ , ≤ (𝐴, 𝐵)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399   = wceq 1562  cdif 3903  cin 3905  wss 3906   × cxp 5647  ccnv 5648  Rel wrel 5654   Isom wiso 6524  *cxr 11217   < clt 11218  cle 11219
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1817  ax-4 1831  ax-5 1932  ax-6 1989  ax-7 2030  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2214  ax-ext 2736  ax-sep 5248  ax-nul 5258  ax-pr 5392
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1101  df-tru 1565  df-fal 1575  df-ex 1802  df-nf 1806  df-sb 2093  df-mo 2568  df-eu 2598  df-clab 2743  df-cleq 2756  df-clel 2839  df-ne 2960  df-ral 3079  df-rex 3089  df-rab 3417  df-v 3458  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4288  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5103  df-opab 5165  df-id 5544  df-xp 5655  df-rel 5656  df-cnv 5657  df-co 5658  df-dm 5659  df-rn 5660  df-res 5661  df-ima 5662  df-iota 6479  df-fun 6525  df-fn 6526  df-f 6527  df-f1 6528  df-fo 6529  df-f1o 6530  df-fv 6531  df-isom 6532  df-xr 11222  df-ltxr 11223  df-le 11224
This theorem is referenced by:  xrge0iifhmeo  34235
  Copyright terms: Public domain W3C validator