Theorem ismet 24675

Description: Express the predicate "𝐷 is a metric." (Contributed by NM, 25-Aug-2006.) (Revised by Mario Carneiro, 14-Aug-2015.)

Assertion

Ref	Expression
ismet	⊢ (𝑋 ∈ 𝐴 → (𝐷 ∈ (Met‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) + (𝑧𝐷𝑦))))))

Distinct variable groups:   𝑥,𝑦,𝑧,𝐷   𝑥,𝑋,𝑦,𝑧

Allowed substitution hints:   𝐴(𝑥, 𝑦, 𝑧)

Proof of Theorem ismet

Dummy variables 𝑑 𝑡 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3475	. . . . 5 ⊢ (𝑋 ∈ 𝐴 → 𝑋 ∈ V)
2		xpeq12 5681	. . . . . . . . 9 ⊢ ((𝑡 = 𝑋 ∧ 𝑡 = 𝑋) → (𝑡 × 𝑡) = (𝑋 × 𝑋))
3	2	anidms 577	. . . . . . . 8 ⊢ (𝑡 = 𝑋 → (𝑡 × 𝑡) = (𝑋 × 𝑋))
4	3	oveq2d 7462	. . . . . . 7 ⊢ (𝑡 = 𝑋 → (ℝ ↑m (𝑡 × 𝑡)) = (ℝ ↑m (𝑋 × 𝑋)))
5		raleq 3320	. . . . . . . . . 10 ⊢ (𝑡 = 𝑋 → (∀𝑧 ∈ 𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) + (𝑧𝑑𝑦)) ↔ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) + (𝑧𝑑𝑦))))
6	5	anbi2d 642	. . . . . . . . 9 ⊢ (𝑡 = 𝑋 → ((((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) + (𝑧𝑑𝑦))) ↔ (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) + (𝑧𝑑𝑦)))))
7	6	raleqbi1dv 3333	. . . . . . . 8 ⊢ (𝑡 = 𝑋 → (∀𝑦 ∈ 𝑡 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) + (𝑧𝑑𝑦))) ↔ ∀𝑦 ∈ 𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) + (𝑧𝑑𝑦)))))
8	7	raleqbi1dv 3333	. . . . . . 7 ⊢ (𝑡 = 𝑋 → (∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) + (𝑧𝑑𝑦))) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) + (𝑧𝑑𝑦)))))
9	4, 8	rabeqbidv 3433	. . . . . 6 ⊢ (𝑡 = 𝑋 → {𝑑 ∈ (ℝ ↑m (𝑡 × 𝑡)) ∣ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) + (𝑧𝑑𝑦)))} = {𝑑 ∈ (ℝ ↑m (𝑋 × 𝑋)) ∣ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) + (𝑧𝑑𝑦)))})
10		df-met 21705	. . . . . 6 ⊢ Met = (𝑡 ∈ V ↦ {𝑑 ∈ (ℝ ↑m (𝑡 × 𝑡)) ∣ ∀𝑥 ∈ 𝑡 ∀𝑦 ∈ 𝑡 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑡 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) + (𝑧𝑑𝑦)))})
11		ovex 7479	. . . . . . 7 ⊢ (ℝ ↑m (𝑋 × 𝑋)) ∈ V
12	11	rabex 5305	. . . . . 6 ⊢ {𝑑 ∈ (ℝ ↑m (𝑋 × 𝑋)) ∣ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) + (𝑧𝑑𝑦)))} ∈ V
13	9, 10, 12	fvmpt 7019	. . . . 5 ⊢ (𝑋 ∈ V → (Met‘𝑋) = {𝑑 ∈ (ℝ ↑m (𝑋 × 𝑋)) ∣ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) + (𝑧𝑑𝑦)))})
14	1, 13	syl 18	. . . 4 ⊢ (𝑋 ∈ 𝐴 → (Met‘𝑋) = {𝑑 ∈ (ℝ ↑m (𝑋 × 𝑋)) ∣ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) + (𝑧𝑑𝑦)))})
15	14	eleq2d 2850	. . 3 ⊢ (𝑋 ∈ 𝐴 → (𝐷 ∈ (Met‘𝑋) ↔ 𝐷 ∈ {𝑑 ∈ (ℝ ↑m (𝑋 × 𝑋)) ∣ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) + (𝑧𝑑𝑦)))}))
16		oveq 7452	. . . . . . . 8 ⊢ (𝑑 = 𝐷 → (𝑥𝑑𝑦) = (𝑥𝐷𝑦))
17	16	eqeq1d 2765	. . . . . . 7 ⊢ (𝑑 = 𝐷 → ((𝑥𝑑𝑦) = 0 ↔ (𝑥𝐷𝑦) = 0))
18	17	bibi1d 346	. . . . . 6 ⊢ (𝑑 = 𝐷 → (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ↔ ((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦)))
19		oveq 7452	. . . . . . . . 9 ⊢ (𝑑 = 𝐷 → (𝑧𝑑𝑥) = (𝑧𝐷𝑥))
20		oveq 7452	. . . . . . . . 9 ⊢ (𝑑 = 𝐷 → (𝑧𝑑𝑦) = (𝑧𝐷𝑦))
21	19, 20	oveq12d 7464	. . . . . . . 8 ⊢ (𝑑 = 𝐷 → ((𝑧𝑑𝑥) + (𝑧𝑑𝑦)) = ((𝑧𝐷𝑥) + (𝑧𝐷𝑦)))
22	16, 21	breq12d 5119	. . . . . . 7 ⊢ (𝑑 = 𝐷 → ((𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) + (𝑧𝑑𝑦)) ↔ (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) + (𝑧𝐷𝑦))))
23	22	ralbidv 3189	. . . . . 6 ⊢ (𝑑 = 𝐷 → (∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) + (𝑧𝑑𝑦)) ↔ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) + (𝑧𝐷𝑦))))
24	18, 23	anbi12d 644	. . . . 5 ⊢ (𝑑 = 𝐷 → ((((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) + (𝑧𝑑𝑦))) ↔ (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) + (𝑧𝐷𝑦)))))
25	24	2ralbidv 3230	. . . 4 ⊢ (𝑑 = 𝐷 → (∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) + (𝑧𝑑𝑦))) ↔ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) + (𝑧𝐷𝑦)))))
26	25	elrab 3648	. . 3 ⊢ (𝐷 ∈ {𝑑 ∈ (ℝ ↑m (𝑋 × 𝑋)) ∣ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝑑𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝑑𝑦) ≤ ((𝑧𝑑𝑥) + (𝑧𝑑𝑦)))} ↔ (𝐷 ∈ (ℝ ↑m (𝑋 × 𝑋)) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) + (𝑧𝐷𝑦)))))
27	15, 26	bitrdi 290	. 2 ⊢ (𝑋 ∈ 𝐴 → (𝐷 ∈ (Met‘𝑋) ↔ (𝐷 ∈ (ℝ ↑m (𝑋 × 𝑋)) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) + (𝑧𝐷𝑦))))))
28		reex 11321	. . . 4 ⊢ ℝ ∈ V
29		sqxpexg 7796	. . . 4 ⊢ (𝑋 ∈ 𝐴 → (𝑋 × 𝑋) ∈ V)
30		elmapg 8890	. . . 4 ⊢ ((ℝ ∈ V ∧ (𝑋 × 𝑋) ∈ V) → (𝐷 ∈ (ℝ ↑m (𝑋 × 𝑋)) ↔ 𝐷:(𝑋 × 𝑋)⟶ℝ))
31	28, 29, 30	sylancr 599	. . 3 ⊢ (𝑋 ∈ 𝐴 → (𝐷 ∈ (ℝ ↑m (𝑋 × 𝑋)) ↔ 𝐷:(𝑋 × 𝑋)⟶ℝ))
32	31	anbi1d 643	. 2 ⊢ (𝑋 ∈ 𝐴 → ((𝐷 ∈ (ℝ ↑m (𝑋 × 𝑋)) ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) + (𝑧𝐷𝑦)))) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) + (𝑧𝐷𝑦))))))
33	27, 32	bitrd 282	1 ⊢ (𝑋 ∈ 𝐴 → (𝐷 ∈ (Met‘𝑋) ↔ (𝐷:(𝑋 × 𝑋)⟶ℝ ∧ ∀𝑥 ∈ 𝑋 ∀𝑦 ∈ 𝑋 (((𝑥𝐷𝑦) = 0 ↔ 𝑥 = 𝑦) ∧ ∀𝑧 ∈ 𝑋 (𝑥𝐷𝑦) ≤ ((𝑧𝐷𝑥) + (𝑧𝐷𝑦))))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416  Vcvv 3454   class class class wbr 5106   × cxp 5654  ⟶wf 6557  ‘cfv 6561  (class class class)co 7446   ↑_m cmap 8878  ℝcr 11229  0cc0 11230   + caddc 11233   ≤ cle 11374  Metcmet 21697

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778  ax-cnex 11286  ax-resscn 11287

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-sbc 3743  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-br 5107  df-opab 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-map 8880  df-met 21705

This theorem is used by:  ismeti  24677  metflem  24680  ismet2  24685  dscmet  24924  nrmmetd  24926  rrxmet  25762  metf1o  38892  rrnmet  38966