Theorem iccen 10409

Description: Any nontrivial closed interval is equinumerous to the unit interval. (Contributed by Mario Carneiro, 26-Jul-2014.) (Revised by Mario Carneiro, 8-Sep-2015.)

Assertion

Ref	Expression
iccen	|- ( ( A e. RR /\ B e. RR /\ A < B ) -> ( 0 [,] 1 ) ~~ ( A [,] B ) )

Proof of Theorem iccen

Dummy variables x y are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		reex 8313	. . 3 |- RR e. _V
2		unitssre 10408	. . 3 |- ( 0 [,] 1 ) C_ RR
3	1, 2	ssexi 4271	. 2 |- ( 0 [,] 1 ) e. _V
4		iccssre 10357	. . . 4 |- ( ( A e. RR /\ B e. RR ) -> ( A [,] B ) C_ RR )
5		ssexg 4272	. . . 4 |- ( ( ( A [,] B ) C_ RR /\ RR e. _V ) -> ( A [,] B ) e. _V )
6	4, 1, 5	sylancl 417	. . 3 |- ( ( A e. RR /\ B e. RR ) -> ( A [,] B ) e. _V )
7	6	3adant3 1048	. 2 |- ( ( A e. RR /\ B e. RR /\ A < B ) -> ( A [,] B ) e. _V )
8		eqid 2238	. . . 4 |- ( x e. ( 0 [,] 1 ) |-> ( ( x x. B ) + ( ( 1 - x ) x. A ) ) ) = ( x e. ( 0 [,] 1 ) |-> ( ( x x. B ) + ( ( 1 - x ) x. A ) ) )
9	8	iccf1o 10407	. . 3 |- ( ( A e. RR /\ B e. RR /\ A < B ) -> ( ( x e. ( 0 [,] 1 ) |-> ( ( x x. B ) + ( ( 1 - x ) x. A ) ) ) : ( 0 [,] 1 ) -1-1-onto-> ( A [,] B ) /\ `' ( x e. ( 0 [,] 1 ) |-> ( ( x x. B ) + ( ( 1 - x ) x. A ) ) ) = ( y e. ( A [,] B ) |-> ( ( y - A ) / ( B - A ) ) ) ) )
10	9	simpld 112	. 2 |- ( ( A e. RR /\ B e. RR /\ A < B ) -> ( x e. ( 0 [,] 1 ) |-> ( ( x x. B ) + ( ( 1 - x ) x. A ) ) ) : ( 0 [,] 1 ) -1-1-onto-> ( A [,] B ) )
11		f1oen2g 7041	. 2 |- ( ( ( 0 [,] 1 ) e. _V /\ ( A [,] B ) e. _V /\ ( x e. ( 0 [,] 1 ) |-> ( ( x x. B ) + ( ( 1 - x ) x. A ) ) ) : ( 0 [,] 1 ) -1-1-onto-> ( A [,] B ) ) -> ( 0 [,] 1 ) ~~ ( A [,] B ) )
12	3, 7, 10, 11	mp3an2i 1383	1 |- ( ( A e. RR /\ B e. RR /\ A < B ) -> ( 0 [,] 1 ) ~~ ( A [,] B ) )

This proof depends on syntax axioms:   -> wi 4   /\ wa 104   /\ w3a 1009   = wceq 1402   e. wcel 2209   _Vcvv 2821   C_ wss 3220   class class class wbr 4130   |-> cmpt 4192   `'ccnv 4773   -1-1-onto->wf1o 5376  (class class class)co 6085   ~~ cen 7020   RRcr 8178   0cc0 8179   1c1 8180   + caddc 8182   x. cmul 8184   < clt 8360   - cmin 8497   / cdiv 9002   [,]cicc 10293

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8270  ax-resscn 8271  ax-1cn 8272  ax-1re 8273  ax-icn 8274  ax-addcl 8275  ax-addrcl 8276  ax-mulcl 8277  ax-mulrcl 8278  ax-addcom 8279  ax-mulcom 8280  ax-addass 8281  ax-mulass 8282  ax-distr 8283  ax-i2m1 8284  ax-0lt1 8285  ax-1rid 8286  ax-0id 8287  ax-rnegex 8288  ax-precex 8289  ax-cnre 8290  ax-pre-ltirr 8291  ax-pre-ltwlin 8292  ax-pre-lttrn 8293  ax-pre-apti 8294  ax-pre-ltadd 8295  ax-pre-mulgt0 8296  ax-pre-mulext 8297

This proof depends on definitions:  df-bi 117  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-po 4441  df-iso 4442  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-en 7023  df-pnf 8362  df-mnf 8363  df-xr 8364  df-ltxr 8365  df-le 8366  df-sub 8499  df-neg 8500  df-reap 8903  df-ap 8910  df-div 9003  df-rp 10055  df-icc 10297

This theorem is used by: (None)