Theorem metustto 24518

Description: Any two elements of the filter base generated by the metric 𝐷 can be compared, like for RR+ (i.e. it's totally ordered). (Contributed by Thierry Arnoux, 22-Nov-2017.) (Revised by Thierry Arnoux, 11-Feb-2018.)

Hypothesis

Ref	Expression
metust.1	⊢ 𝐹 = ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎)))

Assertion

Ref	Expression
metustto	⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴))

Distinct variable groups:   𝐵,𝑎   𝐷,𝑎   𝑋,𝑎   𝐴,𝑎   𝐹,𝑎

Proof of Theorem metustto

Dummy variable 𝑏 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simpll 767	. . . . 5 ⊢ (((𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+) ∧ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏)))) → 𝑎 ∈ ℝ+)
2	1	rpred 12986	. . . 4 ⊢ (((𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+) ∧ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏)))) → 𝑎 ∈ ℝ)
3		simplr 769	. . . . 5 ⊢ (((𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+) ∧ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏)))) → 𝑏 ∈ ℝ+)
4	3	rpred 12986	. . . 4 ⊢ (((𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+) ∧ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏)))) → 𝑏 ∈ ℝ)
5		simpllr 776	. . . . . . . 8 ⊢ ((((𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+) ∧ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏)))) ∧ 𝑎 ≤ 𝑏) → 𝑏 ∈ ℝ+)
6	5	rpred 12986	. . . . . . 7 ⊢ ((((𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+) ∧ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏)))) ∧ 𝑎 ≤ 𝑏) → 𝑏 ∈ ℝ)
7		0xr 11192	. . . . . . . . . 10 ⊢ 0 ∈ ℝ*
8	7	a1i 11	. . . . . . . . 9 ⊢ ((𝑏 ∈ ℝ ∧ 𝑎 ≤ 𝑏) → 0 ∈ ℝ*)
9		simpl 482	. . . . . . . . . 10 ⊢ ((𝑏 ∈ ℝ ∧ 𝑎 ≤ 𝑏) → 𝑏 ∈ ℝ)
10	9	rexrd 11195	. . . . . . . . 9 ⊢ ((𝑏 ∈ ℝ ∧ 𝑎 ≤ 𝑏) → 𝑏 ∈ ℝ*)
11		0le0 12282	. . . . . . . . . 10 ⊢ 0 ≤ 0
12	11	a1i 11	. . . . . . . . 9 ⊢ ((𝑏 ∈ ℝ ∧ 𝑎 ≤ 𝑏) → 0 ≤ 0)
13		simpr 484	. . . . . . . . 9 ⊢ ((𝑏 ∈ ℝ ∧ 𝑎 ≤ 𝑏) → 𝑎 ≤ 𝑏)
14		icossico 13369	. . . . . . . . 9 ⊢ (((0 ∈ ℝ* ∧ 𝑏 ∈ ℝ*) ∧ (0 ≤ 0 ∧ 𝑎 ≤ 𝑏)) → (0[,)𝑎) ⊆ (0[,)𝑏))
15	8, 10, 12, 13, 14	syl22anc 839	. . . . . . . 8 ⊢ ((𝑏 ∈ ℝ ∧ 𝑎 ≤ 𝑏) → (0[,)𝑎) ⊆ (0[,)𝑏))
16		imass2 6067	. . . . . . . 8 ⊢ ((0[,)𝑎) ⊆ (0[,)𝑏) → (◡𝐷 “ (0[,)𝑎)) ⊆ (◡𝐷 “ (0[,)𝑏)))
17	15, 16	syl 17	. . . . . . 7 ⊢ ((𝑏 ∈ ℝ ∧ 𝑎 ≤ 𝑏) → (◡𝐷 “ (0[,)𝑎)) ⊆ (◡𝐷 “ (0[,)𝑏)))
18	6, 17	sylancom 589	. . . . . 6 ⊢ ((((𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+) ∧ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏)))) ∧ 𝑎 ≤ 𝑏) → (◡𝐷 “ (0[,)𝑎)) ⊆ (◡𝐷 “ (0[,)𝑏)))
19		simplrl 777	. . . . . 6 ⊢ ((((𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+) ∧ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏)))) ∧ 𝑎 ≤ 𝑏) → 𝐴 = (◡𝐷 “ (0[,)𝑎)))
20		simplrr 778	. . . . . 6 ⊢ ((((𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+) ∧ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏)))) ∧ 𝑎 ≤ 𝑏) → 𝐵 = (◡𝐷 “ (0[,)𝑏)))
21	18, 19, 20	3sstr4d 3977	. . . . 5 ⊢ ((((𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+) ∧ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏)))) ∧ 𝑎 ≤ 𝑏) → 𝐴 ⊆ 𝐵)
22	21	orcd 874	. . . 4 ⊢ ((((𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+) ∧ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏)))) ∧ 𝑎 ≤ 𝑏) → (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴))
23		simplll 775	. . . . . . . 8 ⊢ ((((𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+) ∧ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏)))) ∧ 𝑏 ≤ 𝑎) → 𝑎 ∈ ℝ+)
24	23	rpred 12986	. . . . . . 7 ⊢ ((((𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+) ∧ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏)))) ∧ 𝑏 ≤ 𝑎) → 𝑎 ∈ ℝ)
25	7	a1i 11	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ≤ 𝑎) → 0 ∈ ℝ*)
26		simpl 482	. . . . . . . . . 10 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ≤ 𝑎) → 𝑎 ∈ ℝ)
27	26	rexrd 11195	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ≤ 𝑎) → 𝑎 ∈ ℝ*)
28	11	a1i 11	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ≤ 𝑎) → 0 ≤ 0)
29		simpr 484	. . . . . . . . 9 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ≤ 𝑎) → 𝑏 ≤ 𝑎)
30		icossico 13369	. . . . . . . . 9 ⊢ (((0 ∈ ℝ* ∧ 𝑎 ∈ ℝ*) ∧ (0 ≤ 0 ∧ 𝑏 ≤ 𝑎)) → (0[,)𝑏) ⊆ (0[,)𝑎))
31	25, 27, 28, 29, 30	syl22anc 839	. . . . . . . 8 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ≤ 𝑎) → (0[,)𝑏) ⊆ (0[,)𝑎))
32		imass2 6067	. . . . . . . 8 ⊢ ((0[,)𝑏) ⊆ (0[,)𝑎) → (◡𝐷 “ (0[,)𝑏)) ⊆ (◡𝐷 “ (0[,)𝑎)))
33	31, 32	syl 17	. . . . . . 7 ⊢ ((𝑎 ∈ ℝ ∧ 𝑏 ≤ 𝑎) → (◡𝐷 “ (0[,)𝑏)) ⊆ (◡𝐷 “ (0[,)𝑎)))
34	24, 33	sylancom 589	. . . . . 6 ⊢ ((((𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+) ∧ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏)))) ∧ 𝑏 ≤ 𝑎) → (◡𝐷 “ (0[,)𝑏)) ⊆ (◡𝐷 “ (0[,)𝑎)))
35		simplrr 778	. . . . . 6 ⊢ ((((𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+) ∧ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏)))) ∧ 𝑏 ≤ 𝑎) → 𝐵 = (◡𝐷 “ (0[,)𝑏)))
36		simplrl 777	. . . . . 6 ⊢ ((((𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+) ∧ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏)))) ∧ 𝑏 ≤ 𝑎) → 𝐴 = (◡𝐷 “ (0[,)𝑎)))
37	34, 35, 36	3sstr4d 3977	. . . . 5 ⊢ ((((𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+) ∧ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏)))) ∧ 𝑏 ≤ 𝑎) → 𝐵 ⊆ 𝐴)
38	37	olcd 875	. . . 4 ⊢ ((((𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+) ∧ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏)))) ∧ 𝑏 ≤ 𝑎) → (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴))
39	2, 4, 22, 38	lecasei 11252	. . 3 ⊢ (((𝑎 ∈ ℝ+ ∧ 𝑏 ∈ ℝ+) ∧ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏)))) → (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴))
40	39	adantlll 719	. 2 ⊢ (((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) ∧ 𝑎 ∈ ℝ+) ∧ 𝑏 ∈ ℝ+) ∧ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏)))) → (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴))
41		metust.1	. . . . . 6 ⊢ 𝐹 = ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎)))
42	41	metustel 24515	. . . . 5 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐴 ∈ 𝐹 ↔ ∃𝑎 ∈ ℝ+ 𝐴 = (◡𝐷 “ (0[,)𝑎))))
43	42	biimpa 476	. . . 4 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹) → ∃𝑎 ∈ ℝ+ 𝐴 = (◡𝐷 “ (0[,)𝑎)))
44	43	3adant3 1133	. . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → ∃𝑎 ∈ ℝ+ 𝐴 = (◡𝐷 “ (0[,)𝑎)))
45		oveq2 7375	. . . . . . . . . 10 ⊢ (𝑎 = 𝑏 → (0[,)𝑎) = (0[,)𝑏))
46	45	imaeq2d 6025	. . . . . . . . 9 ⊢ (𝑎 = 𝑏 → (◡𝐷 “ (0[,)𝑎)) = (◡𝐷 “ (0[,)𝑏)))
47	46	cbvmptv 5189	. . . . . . . 8 ⊢ (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) = (𝑏 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑏)))
48	47	rneqi 5892	. . . . . . 7 ⊢ ran (𝑎 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑎))) = ran (𝑏 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑏)))
49	41, 48	eqtri 2759	. . . . . 6 ⊢ 𝐹 = ran (𝑏 ∈ ℝ+ ↦ (◡𝐷 “ (0[,)𝑏)))
50	49	metustel 24515	. . . . 5 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (𝐵 ∈ 𝐹 ↔ ∃𝑏 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑏))))
51	50	biimpa 476	. . . 4 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐵 ∈ 𝐹) → ∃𝑏 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑏)))
52	51	3adant2 1132	. . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → ∃𝑏 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑏)))
53		reeanv 3209	. . 3 ⊢ (∃𝑎 ∈ ℝ+ ∃𝑏 ∈ ℝ+ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏))) ↔ (∃𝑎 ∈ ℝ+ 𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ ∃𝑏 ∈ ℝ+ 𝐵 = (◡𝐷 “ (0[,)𝑏))))
54	44, 52, 53	sylanbrc 584	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → ∃𝑎 ∈ ℝ+ ∃𝑏 ∈ ℝ+ (𝐴 = (◡𝐷 “ (0[,)𝑎)) ∧ 𝐵 = (◡𝐷 “ (0[,)𝑏))))
55	40, 54	r19.29vva 3197	1 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝐹 ∧ 𝐵 ∈ 𝐹) → (𝐴 ⊆ 𝐵 ∨ 𝐵 ⊆ 𝐴))

Syntax hints:   → wi 4   ∧ wa 395   ∨ wo 848   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114  ∃wrex 3061   ⊆ wss 3889   class class class wbr 5085   ↦ cmpt 5166  ^◡ccnv 5630  ran crn 5632   “ cima 5634  ‘cfv 6498  (class class class)co 7367  ℝcr 11037  0cc0 11038  ℝ^*cxr 11178   ≤ cle 11180  ℝ⁺crp 12942  [,)cico 13300  PsMetcpsmet 21336

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2708  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-addrcl 11099  ax-rnegex 11109  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-id 5526  df-po 5539  df-so 5540  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-ov 7370  df-oprab 7371  df-mpo 7372  df-1st 7942  df-2nd 7943  df-er 8643  df-en 8894  df-dom 8895  df-sdom 8896  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-rp 12943  df-ico 13304

This theorem is referenced by:  metustfbas  24522