gtiso - Mathbox for Thierry Arnoux

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

Theorem gtiso 33158

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**
Step	Hyp	Ref	Expression
1		eqid 2762	. . . . 5 ⊢ ((𝐴 × 𝐴) ∖ < ) = ((𝐴 × 𝐴) ∖ < )
2		eqid 2762	. . . . 5 ⊢ ((𝐵 × 𝐵) ∖ ^◡ < ) = ((𝐵 × 𝐵) ∖ ^◡ < )
3	1, 2	isocnv3 7336	. . . 4 ⊢ (𝐹 Isom < , ^◡ < (𝐴, 𝐵) ↔ 𝐹 Isom ((𝐴 × 𝐴) ∖ < ), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵))
4	3	a1i 11	. . 3 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ⊆ ℝ^*) → (𝐹 Isom < , ^◡ < (𝐴, 𝐵) ↔ 𝐹 Isom ((𝐴 × 𝐴) ∖ < ), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵)))
5		df-le 11274	. . . . . . . . . 10 ⊢ ≤ = ((ℝ^* × ℝ^*) ∖ ^◡ < )
6	5	cnveqi 5858	. . . . . . . . 9 ⊢ ^◡ ≤ = ^◡((ℝ^* × ℝ^*) ∖ ^◡ < )
7		cnvdif 6138	. . . . . . . . 9 ⊢ ^◡((ℝ^* × ℝ^) ∖ ^◡ < ) = (^◡(ℝ^ × ℝ^*) ∖ ^◡^◡ < )
8		cnvxp 6152	. . . . . . . . . 10 ⊢ ^◡(ℝ^* × ℝ^) = (ℝ^ × ℝ^*)
9		ltrel 11296	. . . . . . . . . . 11 ⊢ Rel <
10		dfrel2 6186	. . . . . . . . . . 11 ⊢ (Rel < ↔ ^◡^◡ < = < )
11	9, 10	mpbi 233	. . . . . . . . . 10 ⊢ ^◡^◡ < = <
12	8, 11	difeq12i 4075	. . . . . . . . 9 ⊢ (^◡(ℝ^* × ℝ^) ∖ ^◡^◡ < ) = ((ℝ^ × ℝ^*) ∖ < )
13	6, 7, 12	3eqtri 2789	. . . . . . . 8 ⊢ ^◡ ≤ = ((ℝ^* × ℝ^*) ∖ < )
14	13	ineq1i 4165	. . . . . . 7 ⊢ (^◡ ≤ ∩ (𝐴 × 𝐴)) = (((ℝ^* × ℝ^*) ∖ < ) ∩ (𝐴 × 𝐴))
15		indif1 4231	. . . . . . 7 ⊢ (((ℝ^* × ℝ^) ∖ < ) ∩ (𝐴 × 𝐴)) = (((ℝ^ × ℝ^*) ∩ (𝐴 × 𝐴)) ∖ < )
16	14, 15	eqtri 2785	. . . . . 6 ⊢ (^◡ ≤ ∩ (𝐴 × 𝐴)) = (((ℝ^* × ℝ^*) ∩ (𝐴 × 𝐴)) ∖ < )
17		xpss12 5674	. . . . . . . . 9 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐴 ⊆ ℝ^) → (𝐴 × 𝐴) ⊆ (ℝ^ × ℝ^*))
18	17	anidms 577	. . . . . . . 8 ⊢ (𝐴 ⊆ ℝ^* → (𝐴 × 𝐴) ⊆ (ℝ^* × ℝ^*))
19		sseqin2 4172	. . . . . . . 8 ⊢ ((𝐴 × 𝐴) ⊆ (ℝ^* × ℝ^) ↔ ((ℝ^ × ℝ^*) ∩ (𝐴 × 𝐴)) = (𝐴 × 𝐴))
20	18, 19	sylib 221	. . . . . . 7 ⊢ (𝐴 ⊆ ℝ^* → ((ℝ^* × ℝ^*) ∩ (𝐴 × 𝐴)) = (𝐴 × 𝐴))
21	20	difeq1d 4076	. . . . . 6 ⊢ (𝐴 ⊆ ℝ^* → (((ℝ^* × ℝ^*) ∩ (𝐴 × 𝐴)) ∖ < ) = ((𝐴 × 𝐴) ∖ < ))
22	16, 21	eqtr2id 2810	. . . . 5 ⊢ (𝐴 ⊆ ℝ^* → ((𝐴 × 𝐴) ∖ < ) = (^◡ ≤ ∩ (𝐴 × 𝐴)))
23	22	adantr 486	. . . 4 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ⊆ ℝ^*) → ((𝐴 × 𝐴) ∖ < ) = (^◡ ≤ ∩ (𝐴 × 𝐴)))
24		isoeq2 7322	. . . 4 ⊢ (((𝐴 × 𝐴) ∖ < ) = (^◡ ≤ ∩ (𝐴 × 𝐴)) → (𝐹 Isom ((𝐴 × 𝐴) ∖ < ), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom (^◡ ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵)))
25	23, 24	syl 18	. . 3 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ⊆ ℝ^*) → (𝐹 Isom ((𝐴 × 𝐴) ∖ < ), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom (^◡ ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵)))
26	5	ineq1i 4165	. . . . . . 7 ⊢ ( ≤ ∩ (𝐵 × 𝐵)) = (((ℝ^* × ℝ^*) ∖ ^◡ < ) ∩ (𝐵 × 𝐵))
27		indif1 4231	. . . . . . 7 ⊢ (((ℝ^* × ℝ^) ∖ ^◡ < ) ∩ (𝐵 × 𝐵)) = (((ℝ^ × ℝ^*) ∩ (𝐵 × 𝐵)) ∖ ^◡ < )
28	26, 27	eqtri 2785	. . . . . 6 ⊢ ( ≤ ∩ (𝐵 × 𝐵)) = (((ℝ^* × ℝ^*) ∩ (𝐵 × 𝐵)) ∖ ^◡ < )
29		xpss12 5674	. . . . . . . . 9 ⊢ ((𝐵 ⊆ ℝ^* ∧ 𝐵 ⊆ ℝ^) → (𝐵 × 𝐵) ⊆ (ℝ^ × ℝ^*))
30	29	anidms 577	. . . . . . . 8 ⊢ (𝐵 ⊆ ℝ^* → (𝐵 × 𝐵) ⊆ (ℝ^* × ℝ^*))
31		sseqin2 4172	. . . . . . . 8 ⊢ ((𝐵 × 𝐵) ⊆ (ℝ^* × ℝ^) ↔ ((ℝ^ × ℝ^*) ∩ (𝐵 × 𝐵)) = (𝐵 × 𝐵))
32	30, 31	sylib 221	. . . . . . 7 ⊢ (𝐵 ⊆ ℝ^* → ((ℝ^* × ℝ^*) ∩ (𝐵 × 𝐵)) = (𝐵 × 𝐵))
33	32	difeq1d 4076	. . . . . 6 ⊢ (𝐵 ⊆ ℝ^* → (((ℝ^* × ℝ^*) ∩ (𝐵 × 𝐵)) ∖ ^◡ < ) = ((𝐵 × 𝐵) ∖ ^◡ < ))
34	28, 33	eqtr2id 2810	. . . . 5 ⊢ (𝐵 ⊆ ℝ^* → ((𝐵 × 𝐵) ∖ ^◡ < ) = ( ≤ ∩ (𝐵 × 𝐵)))
35	34	adantl 487	. . . 4 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ⊆ ℝ^*) → ((𝐵 × 𝐵) ∖ ^◡ < ) = ( ≤ ∩ (𝐵 × 𝐵)))
36		isoeq3 7323	. . . 4 ⊢ (((𝐵 × 𝐵) ∖ ^◡ < ) = ( ≤ ∩ (𝐵 × 𝐵)) → (𝐹 Isom (^◡ ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom (^◡ ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
37	35, 36	syl 18	. . 3 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ⊆ ℝ^*) → (𝐹 Isom (^◡ ≤ ∩ (𝐴 × 𝐴)), ((𝐵 × 𝐵) ∖ ^◡ < )(𝐴, 𝐵) ↔ 𝐹 Isom (^◡ ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
38	4, 25, 37	3bitrd 308	. 2 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ⊆ ℝ^*) → (𝐹 Isom < , ^◡ < (𝐴, 𝐵) ↔ 𝐹 Isom (^◡ ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵)))
39		isocnv2 7335	. . 3 ⊢ (𝐹 Isom ^◡ ≤ , ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ^◡^◡ ≤ , ^◡ ≤ (𝐴, 𝐵))
40		isores2 7337	. . . 4 ⊢ (𝐹 Isom ^◡ ≤ , ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ^◡ ≤ , ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
41		isores1 7338	. . . 4 ⊢ (𝐹 Isom ^◡ ≤ , ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵) ↔ 𝐹 Isom (^◡ ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
42	40, 41	bitri 278	. . 3 ⊢ (𝐹 Isom ^◡ ≤ , ≤ (𝐴, 𝐵) ↔ 𝐹 Isom (^◡ ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
43		lerel 11298	. . . . 5 ⊢ Rel ≤
44		dfrel2 6186	. . . . 5 ⊢ (Rel ≤ ↔ ^◡^◡ ≤ = ≤ )
45	43, 44	mpbi 233	. . . 4 ⊢ ^◡^◡ ≤ = ≤
46		isoeq2 7322	. . . 4 ⊢ (^◡^◡ ≤ = ≤ → (𝐹 Isom ^◡^◡ ≤ , ^◡ ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ≤ , ^◡ ≤ (𝐴, 𝐵)))
47	45, 46	ax-mp 5	. . 3 ⊢ (𝐹 Isom ^◡^◡ ≤ , ^◡ ≤ (𝐴, 𝐵) ↔ 𝐹 Isom ≤ , ^◡ ≤ (𝐴, 𝐵))
48	39, 42, 47	3bitr3ri 305	. 2 ⊢ (𝐹 Isom ≤ , ^◡ ≤ (𝐴, 𝐵) ↔ 𝐹 Isom (^◡ ≤ ∩ (𝐴 × 𝐴)), ( ≤ ∩ (𝐵 × 𝐵))(𝐴, 𝐵))
49	38, 48	bitr4di 292	1 ⊢ ((𝐴 ⊆ ℝ^* ∧ 𝐵 ⊆ ℝ^*) → (𝐹 Isom < , ^◡ < (𝐴, 𝐵) ↔ 𝐹 Isom ≤ , ^◡ ≤ (𝐴, 𝐵)))

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∖ cdif 3899 ∩ cin 3901 ⊆ wss 3902 × cxp 5657 ^◡ccnv 5658 Rel wrel 5664 Isom wiso 6538 ℝ^*cxr 11267 < clt 11268 ≤ cle 11269

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 2215 ax-ext 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402

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 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-ne 2958 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-uni 4871 df-br 5108 df-opab 5172 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-res 5671 df-ima 5672 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-isom 6546 df-xr 11272 df-ltxr 11273 df-le 11274

This theorem is used by: xrge0iifhmeo 34431

W3C validator