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 33393
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 2766 . . . . 5 ((𝐴 × 𝐴) ∖ < ) = ((𝐴 × 𝐴) ∖ < )
2 eqid 2766 . . . . 5 ((𝐵 × 𝐵) ∖ ◡ < ) = ((𝐵 × 𝐵) ∖ ◡ < )
31, 2isocnv3 7370 . . . 4 (𝐹 Isom < , ◡ < (𝐴, 𝐵) ↔ 𝐹 Isom ((𝐴 × 𝐴) ∖ < ), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵))
43a1i 11 . . 3 ((𝐴 ⊆ ℝ* ∧ 𝐵 ⊆ ℝ*) → (𝐹 Isom < , ◡ < (𝐴, 𝐵) ↔ 𝐹 Isom ((𝐴 × 𝐴) ∖ < ), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵)))
5 df-le 11387 . . . . . . . . . 10 ≤ = ((ℝ* × ℝ*) ∖ ◡ < )
65cnveqi 5863 . . . . . . . . 9 ◡ ≤ = ◡((ℝ* × ℝ*) ∖ ◡ < )
7 cnvdif 6151 . . . . . . . . 9 ◡((ℝ* × ℝ*) ∖ ◡ < ) = (◡(ℝ* × ℝ*) ∖ ◡◡ < )
8 cnvxp 6164 . . . . . . . . . 10 ◡(ℝ* × ℝ*) = (ℝ* × ℝ*)
9 ltrel 11409 . . . . . . . . . . 11 Rel <
10 dfrel2 6198 . . . . . . . . . . 11 (Rel < ↔ ◡◡ < = < )
119, 10mpbi 233 . . . . . . . . . 10 ◡◡ < = <
128, 11difeq12i 4063 . . . . . . . . 9 (◡(ℝ* × ℝ*) ∖ ◡◡ < ) = ((ℝ* × ℝ*) ∖ < )
136, 7, 123eqtri 2793 . . . . . . . 8 ◡ ≤ = ((ℝ* × ℝ*) ∖ < )
1413ineq1i 4115 . . . . . . 7 (◡ ≤ ∩ (𝐴 × 𝐴)) = (((ℝ* × ℝ*) ∖ < ) ∩ (𝐴 × 𝐴))
15 indif1 4229 . . . . . . 7 (((ℝ* × ℝ*) ∖ < ) ∩ (𝐴 × 𝐴)) = (((ℝ* × ℝ*) ∩ (𝐴 × 𝐴)) ∖ < )
1614, 15eqtri 2789 . . . . . 6 (◡ ≤ ∩ (𝐴 × 𝐴)) = (((ℝ* × ℝ*) ∩ (𝐴 × 𝐴)) ∖ < )
17 xpss12 5672 . . . . . . . . 9 ((𝐴 ⊆ ℝ* ∧ 𝐴 ⊆ ℝ*) → (𝐴 × 𝐴) ⊆ (ℝ* × ℝ*))
1817anidms 577 . . . . . . . 8 (𝐴 ⊆ ℝ* → (𝐴 × 𝐴) ⊆ (ℝ* × ℝ*))
19 sseqin2 4122 . . . . . . . 8 ((𝐴 × 𝐴) ⊆ (ℝ* × ℝ*) ↔ ((ℝ* × ℝ*) ∩ (𝐴 × 𝐴)) = (𝐴 × 𝐴))
2018, 19sylib 221 . . . . . . 7 (𝐴 ⊆ ℝ* → ((ℝ* × ℝ*) ∩ (𝐴 × 𝐴)) = (𝐴 × 𝐴))
2120difeq1d 4064 . . . . . 6 (𝐴 ⊆ ℝ* → (((ℝ* × ℝ*) ∩ (𝐴 × 𝐴)) ∖ < ) = ((𝐴 × 𝐴) ∖ < ))
2216, 21eqtr2id 2814 . . . . 5 (𝐴 ⊆ ℝ* → ((𝐴 × 𝐴) ∖ < ) = (◡ ≤ ∩ (𝐴 × 𝐴)))
2322adantr 486 . . . 4 ((𝐴 ⊆ ℝ* ∧ 𝐵 ⊆ ℝ*) → ((𝐴 × 𝐴) ∖ < ) = (◡ ≤ ∩ (𝐴 × 𝐴)))
24 isoeq2 7356 . . . 4 (((𝐴 × 𝐴) ∖ < ) = (◡ ≤ ∩ (𝐴 × 𝐴)) → (𝐹 Isom ((𝐴 × 𝐴) ∖ < ), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom (◡ ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵)))
2523, 24syl 18 . . 3 ((𝐴 ⊆ ℝ* ∧ 𝐵 ⊆ ℝ*) → (𝐹 Isom ((𝐴 × 𝐴) ∖ < ), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom (◡ ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵)))
265ineq1i 4115 . . . . . . 7 ( ≤ ∩ (𝐵 × 𝐵)) = (((ℝ* × ℝ*) ∖ ◡ < ) ∩ (𝐵 × 𝐵))
27 indif1 4229 . . . . . . 7 (((ℝ* × ℝ*) ∖ ◡ < ) ∩ (𝐵 × 𝐵)) = (((ℝ* × ℝ*) ∩ (𝐵 × 𝐵)) ∖ ◡ < )
2826, 27eqtri 2789 . . . . . 6 ( ≤ ∩ (𝐵 × 𝐵)) = (((ℝ* × ℝ*) ∩ (𝐵 × 𝐵)) ∖ ◡ < )
29 xpss12 5672 . . . . . . . . 9 ((𝐵 ⊆ ℝ* ∧ 𝐵 ⊆ ℝ*) → (𝐵 × 𝐵) ⊆ (ℝ* × ℝ*))
3029anidms 577 . . . . . . . 8 (𝐵 ⊆ ℝ* → (𝐵 × 𝐵) ⊆ (ℝ* × ℝ*))
31 sseqin2 4122 . . . . . . . 8 ((𝐵 × 𝐵) ⊆ (ℝ* × ℝ*) ↔ ((ℝ* × ℝ*) ∩ (𝐵 × 𝐵)) = (𝐵 × 𝐵))
3230, 31sylib 221 . . . . . . 7 (𝐵 ⊆ ℝ* → ((ℝ* × ℝ*) ∩ (𝐵 × 𝐵)) = (𝐵 × 𝐵))
3332difeq1d 4064 . . . . . 6 (𝐵 ⊆ ℝ* → (((ℝ* × ℝ*) ∩ (𝐵 × 𝐵)) ∖ ◡ < ) = ((𝐵 × 𝐵) ∖ ◡ < ))
3428, 33eqtr2id 2814 . . . . 5 (𝐵 ⊆ ℝ* → ((𝐵 × 𝐵) ∖ ◡ < ) = ( ≤ ∩ (𝐵 × 𝐵)))
3534adantl 487 . . . 4 ((𝐴 ⊆ ℝ* ∧ 𝐵 ⊆ ℝ*) → ((𝐵 × 𝐵) ∖ ◡ < ) = ( ≤ ∩ (𝐵 × 𝐵)))
36 isoeq3 7357 . . . 4 (((𝐵 × 𝐵) ∖ ◡ < ) = ( ≤ ∩ (𝐵 × 𝐵)) → (𝐹 Isom (◡ ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom (◡ ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
3735, 36syl 18 . . 3 ((𝐴 ⊆ ℝ* ∧ 𝐵 ⊆ ℝ*) → (𝐹 Isom (◡ ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom (◡ ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
384, 25, 373bitrd 308 . 2 ((𝐴 ⊆ ℝ* ∧ 𝐵 ⊆ ℝ*) → (𝐹 Isom < , ◡ < (𝐴, 𝐵) ↔ 𝐹 Isom (◡ ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
39 isocnv2 7369 . . 3 (𝐹 Isom ◡ ≤ , ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ◡◡ ≤ , ◡ ≤ (𝐴, 𝐵))
40 isores2 7371 . . . 4 (𝐹 Isom ◡ ≤ , ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ◡ ≤ , ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
41 isores1 7372 . . . 4 (𝐹 Isom ◡ ≤ , ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵) ↔ 𝐹 Isom (◡ ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
4240, 41bitri 278 . . 3 (𝐹 Isom ◡ ≤ , ≤ (𝐴, 𝐵) ↔ 𝐹 Isom (◡ ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
43 lerel 11411 . . . . 5 Rel ≤
44 dfrel2 6198 . . . . 5 (Rel ≤ ↔ ◡◡ ≤ = ≤ )
4543, 44mpbi 233 . . . 4 ◡◡ ≤ = ≤
46 isoeq2 7356 . . . 4 (◡◡ ≤ = ≤ → (𝐹 Isom ◡◡ ≤ , ◡ ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ≤ , ◡ ≤ (𝐴, 𝐵)))
4745, 46ax-mp 5 . . 3 (𝐹 Isom ◡◡ ≤ , ◡ ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ≤ , ◡ ≤ (𝐴, 𝐵))
4839, 42, 473bitr3ri 305 . 2 (𝐹 Isom ≤ , ◡ ≤ (𝐴, 𝐵) ↔ 𝐹 Isom (◡ ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
4938, 48bitr4di 292 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  Rel wrel 5662   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-xr 11385  df-ltxr 11386  df-le 11387
This theorem is used by:  xrge0iifhmeo  34680
  Copyright terms: Public domain W3C validator