pstmfval - Mathbox for Thierry Arnoux

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

Theorem pstmfval 33175

Description: Function value of the metric induced by a pseudometric 𝐷 (Contributed by Thierry Arnoux, 11-Feb-2018.)

**Hypothesis**
Ref	Expression
pstmval.1	⊢ ∼ = (~_Met‘𝐷)

**Assertion**
Ref	Expression
pstmfval	⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ([𝐴] ∼ (pstoMet‘𝐷)[𝐵] ∼ ) = (𝐴𝐷𝐵))

Proof of Theorem pstmfval Dummy variables 𝑎 𝑏 𝑥 𝑦 𝑧 𝑒 𝑓 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		pstmval.1	. . . . 5 ⊢ ∼ = (~_Met‘𝐷)
2	1	pstmval 33174	. . . 4 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (pstoMet‘𝐷) = (𝑥 ∈ (𝑋 / ∼ ), 𝑦 ∈ (𝑋 / ∼ ) ↦ ∪ {𝑧 ∣ ∃𝑎 ∈ 𝑥 ∃𝑏 ∈ 𝑦 𝑧 = (𝑎𝐷𝑏)}))
3	2	3ad2ant1 1132	. . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (pstoMet‘𝐷) = (𝑥 ∈ (𝑋 / ∼ ), 𝑦 ∈ (𝑋 / ∼ ) ↦ ∪ {𝑧 ∣ ∃𝑎 ∈ 𝑥 ∃𝑏 ∈ 𝑦 𝑧 = (𝑎𝐷𝑏)}))
4	3	oveqd 7429	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ([𝐴] ∼ (pstoMet‘𝐷)[𝐵] ∼ ) = ([𝐴] ∼ (𝑥 ∈ (𝑋 / ∼ ), 𝑦 ∈ (𝑋 / ∼ ) ↦ ∪ {𝑧 ∣ ∃𝑎 ∈ 𝑥 ∃𝑏 ∈ 𝑦 𝑧 = (𝑎𝐷𝑏)})[𝐵] ∼ ))
5	1	fvexi 6905	. . . . 5 ⊢ ∼ ∈ V
6	5	ecelqsi 8771	. . . 4 ⊢ (𝐴 ∈ 𝑋 → [𝐴] ∼ ∈ (𝑋 / ∼ ))
7	6	3ad2ant2 1133	. . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → [𝐴] ∼ ∈ (𝑋 / ∼ ))
8	5	ecelqsi 8771	. . . 4 ⊢ (𝐵 ∈ 𝑋 → [𝐵] ∼ ∈ (𝑋 / ∼ ))
9	8	3ad2ant3 1134	. . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → [𝐵] ∼ ∈ (𝑋 / ∼ ))
10		rexeq 3320	. . . . . 6 ⊢ (𝑥 = [𝐴] ∼ → (∃𝑎 ∈ 𝑥 ∃𝑏 ∈ 𝑦 𝑧 = (𝑎𝐷𝑏) ↔ ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ 𝑦 𝑧 = (𝑎𝐷𝑏)))
11	10	abbidv 2800	. . . . 5 ⊢ (𝑥 = [𝐴] ∼ → {𝑧 ∣ ∃𝑎 ∈ 𝑥 ∃𝑏 ∈ 𝑦 𝑧 = (𝑎𝐷𝑏)} = {𝑧 ∣ ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ 𝑦 𝑧 = (𝑎𝐷𝑏)})
12	11	unieqd 4922	. . . 4 ⊢ (𝑥 = [𝐴] ∼ → ∪ {𝑧 ∣ ∃𝑎 ∈ 𝑥 ∃𝑏 ∈ 𝑦 𝑧 = (𝑎𝐷𝑏)} = ∪ {𝑧 ∣ ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ 𝑦 𝑧 = (𝑎𝐷𝑏)})
13		rexeq 3320	. . . . . . 7 ⊢ (𝑦 = [𝐵] ∼ → (∃𝑏 ∈ 𝑦 𝑧 = (𝑎𝐷𝑏) ↔ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏)))
14	13	rexbidv 3177	. . . . . 6 ⊢ (𝑦 = [𝐵] ∼ → (∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ 𝑦 𝑧 = (𝑎𝐷𝑏) ↔ ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏)))
15	14	abbidv 2800	. . . . 5 ⊢ (𝑦 = [𝐵] ∼ → {𝑧 ∣ ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ 𝑦 𝑧 = (𝑎𝐷𝑏)} = {𝑧 ∣ ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏)})
16	15	unieqd 4922	. . . 4 ⊢ (𝑦 = [𝐵] ∼ → ∪ {𝑧 ∣ ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ 𝑦 𝑧 = (𝑎𝐷𝑏)} = ∪ {𝑧 ∣ ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏)})
17		eqid 2731	. . . 4 ⊢ (𝑥 ∈ (𝑋 / ∼ ), 𝑦 ∈ (𝑋 / ∼ ) ↦ ∪ {𝑧 ∣ ∃𝑎 ∈ 𝑥 ∃𝑏 ∈ 𝑦 𝑧 = (𝑎𝐷𝑏)}) = (𝑥 ∈ (𝑋 / ∼ ), 𝑦 ∈ (𝑋 / ∼ ) ↦ ∪ {𝑧 ∣ ∃𝑎 ∈ 𝑥 ∃𝑏 ∈ 𝑦 𝑧 = (𝑎𝐷𝑏)})
18		ecexg 8711	. . . . . . 7 ⊢ ( ∼ ∈ V → [𝐴] ∼ ∈ V)
19	5, 18	ax-mp 5	. . . . . 6 ⊢ [𝐴] ∼ ∈ V
20		ecexg 8711	. . . . . . 7 ⊢ ( ∼ ∈ V → [𝐵] ∼ ∈ V)
21	5, 20	ax-mp 5	. . . . . 6 ⊢ [𝐵] ∼ ∈ V
22	19, 21	ab2rexex 7970	. . . . 5 ⊢ {𝑧 ∣ ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏)} ∈ V
23	22	uniex 7735	. . . 4 ⊢ ∪ {𝑧 ∣ ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏)} ∈ V
24	12, 16, 17, 23	ovmpo 7571	. . 3 ⊢ (([𝐴] ∼ ∈ (𝑋 / ∼ ) ∧ [𝐵] ∼ ∈ (𝑋 / ∼ )) → ([𝐴] ∼ (𝑥 ∈ (𝑋 / ∼ ), 𝑦 ∈ (𝑋 / ∼ ) ↦ ∪ {𝑧 ∣ ∃𝑎 ∈ 𝑥 ∃𝑏 ∈ 𝑦 𝑧 = (𝑎𝐷𝑏)})[𝐵] ∼ ) = ∪ {𝑧 ∣ ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏)})
25	7, 9, 24	syl2anc 583	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ([𝐴] ∼ (𝑥 ∈ (𝑋 / ∼ ), 𝑦 ∈ (𝑋 / ∼ ) ↦ ∪ {𝑧 ∣ ∃𝑎 ∈ 𝑥 ∃𝑏 ∈ 𝑦 𝑧 = (𝑎𝐷𝑏)})[𝐵] ∼ ) = ∪ {𝑧 ∣ ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏)})
26		simpr3 1195	. . . . . . . . . . 11 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝑒 ∈ [𝐴] ∼ ∧ 𝑓 ∈ [𝐵] ∼ ∧ 𝑧 = (𝑒𝐷𝑓))) → 𝑧 = (𝑒𝐷𝑓))
27		simpl1 1190	. . . . . . . . . . . 12 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝑒 ∈ [𝐴] ∼ ∧ 𝑓 ∈ [𝐵] ∼ ∧ 𝑧 = (𝑒𝐷𝑓))) → 𝐷 ∈ (PsMet‘𝑋))
28		simpr1 1193	. . . . . . . . . . . . . 14 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝑒 ∈ [𝐴] ∼ ∧ 𝑓 ∈ [𝐵] ∼ ∧ 𝑧 = (𝑒𝐷𝑓))) → 𝑒 ∈ [𝐴] ∼ )
29		metidss 33170	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝐷 ∈ (PsMet‘𝑋) → (~_Met‘𝐷) ⊆ (𝑋 × 𝑋))
30	1, 29	eqsstrid 4030	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ∼ ⊆ (𝑋 × 𝑋))
31		xpss 5692	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑋 × 𝑋) ⊆ (V × V)
32	30, 31	sstrdi 3994	. . . . . . . . . . . . . . . . . 18 ⊢ (𝐷 ∈ (PsMet‘𝑋) → ∼ ⊆ (V × V))
33		df-rel 5683	. . . . . . . . . . . . . . . . . 18 ⊢ (Rel ∼ ↔ ∼ ⊆ (V × V))
34	32, 33	sylibr 233	. . . . . . . . . . . . . . . . 17 ⊢ (𝐷 ∈ (PsMet‘𝑋) → Rel ∼ )
35	34	3ad2ant1 1132	. . . . . . . . . . . . . . . 16 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → Rel ∼ )
36	35	adantr 480	. . . . . . . . . . . . . . 15 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝑒 ∈ [𝐴] ∼ ∧ 𝑓 ∈ [𝐵] ∼ ∧ 𝑧 = (𝑒𝐷𝑓))) → Rel ∼ )
37		relelec 8752	. . . . . . . . . . . . . . 15 ⊢ (Rel ∼ → (𝑒 ∈ [𝐴] ∼ ↔ 𝐴 ∼ 𝑒))
38	36, 37	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝑒 ∈ [𝐴] ∼ ∧ 𝑓 ∈ [𝐵] ∼ ∧ 𝑧 = (𝑒𝐷𝑓))) → (𝑒 ∈ [𝐴] ∼ ↔ 𝐴 ∼ 𝑒))
39	28, 38	mpbid 231	. . . . . . . . . . . . 13 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝑒 ∈ [𝐴] ∼ ∧ 𝑓 ∈ [𝐵] ∼ ∧ 𝑧 = (𝑒𝐷𝑓))) → 𝐴 ∼ 𝑒)
40	1	breqi 5154	. . . . . . . . . . . . 13 ⊢ (𝐴 ∼ 𝑒 ↔ 𝐴(~_Met‘𝐷)𝑒)
41	39, 40	sylib 217	. . . . . . . . . . . 12 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝑒 ∈ [𝐴] ∼ ∧ 𝑓 ∈ [𝐵] ∼ ∧ 𝑧 = (𝑒𝐷𝑓))) → 𝐴(~_Met‘𝐷)𝑒)
42		simpr2 1194	. . . . . . . . . . . . . 14 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝑒 ∈ [𝐴] ∼ ∧ 𝑓 ∈ [𝐵] ∼ ∧ 𝑧 = (𝑒𝐷𝑓))) → 𝑓 ∈ [𝐵] ∼ )
43		relelec 8752	. . . . . . . . . . . . . . 15 ⊢ (Rel ∼ → (𝑓 ∈ [𝐵] ∼ ↔ 𝐵 ∼ 𝑓))
44	36, 43	syl 17	. . . . . . . . . . . . . 14 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝑒 ∈ [𝐴] ∼ ∧ 𝑓 ∈ [𝐵] ∼ ∧ 𝑧 = (𝑒𝐷𝑓))) → (𝑓 ∈ [𝐵] ∼ ↔ 𝐵 ∼ 𝑓))
45	42, 44	mpbid 231	. . . . . . . . . . . . 13 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝑒 ∈ [𝐴] ∼ ∧ 𝑓 ∈ [𝐵] ∼ ∧ 𝑧 = (𝑒𝐷𝑓))) → 𝐵 ∼ 𝑓)
46	1	breqi 5154	. . . . . . . . . . . . 13 ⊢ (𝐵 ∼ 𝑓 ↔ 𝐵(~_Met‘𝐷)𝑓)
47	45, 46	sylib 217	. . . . . . . . . . . 12 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝑒 ∈ [𝐴] ∼ ∧ 𝑓 ∈ [𝐵] ∼ ∧ 𝑧 = (𝑒𝐷𝑓))) → 𝐵(~_Met‘𝐷)𝑓)
48		metideq 33172	. . . . . . . . . . . 12 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐴(~_Met‘𝐷)𝑒 ∧ 𝐵(~_Met‘𝐷)𝑓)) → (𝐴𝐷𝐵) = (𝑒𝐷𝑓))
49	27, 41, 47, 48	syl12anc 834	. . . . . . . . . . 11 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝑒 ∈ [𝐴] ∼ ∧ 𝑓 ∈ [𝐵] ∼ ∧ 𝑧 = (𝑒𝐷𝑓))) → (𝐴𝐷𝐵) = (𝑒𝐷𝑓))
50	26, 49	eqtr4d 2774	. . . . . . . . . 10 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ (𝑒 ∈ [𝐴] ∼ ∧ 𝑓 ∈ [𝐵] ∼ ∧ 𝑧 = (𝑒𝐷𝑓))) → 𝑧 = (𝐴𝐷𝐵))
51	50	adantlr 712	. . . . . . . . 9 ⊢ ((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏)) ∧ (𝑒 ∈ [𝐴] ∼ ∧ 𝑓 ∈ [𝐵] ∼ ∧ 𝑧 = (𝑒𝐷𝑓))) → 𝑧 = (𝐴𝐷𝐵))
52	51	3anassrs 1359	. . . . . . . 8 ⊢ ((((((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏)) ∧ 𝑒 ∈ [𝐴] ∼ ) ∧ 𝑓 ∈ [𝐵] ∼ ) ∧ 𝑧 = (𝑒𝐷𝑓)) → 𝑧 = (𝐴𝐷𝐵))
53		oveq1 7419	. . . . . . . . . . . 12 ⊢ (𝑎 = 𝑒 → (𝑎𝐷𝑏) = (𝑒𝐷𝑏))
54	53	eqeq2d 2742	. . . . . . . . . . 11 ⊢ (𝑎 = 𝑒 → (𝑧 = (𝑎𝐷𝑏) ↔ 𝑧 = (𝑒𝐷𝑏)))
55		oveq2 7420	. . . . . . . . . . . 12 ⊢ (𝑏 = 𝑓 → (𝑒𝐷𝑏) = (𝑒𝐷𝑓))
56	55	eqeq2d 2742	. . . . . . . . . . 11 ⊢ (𝑏 = 𝑓 → (𝑧 = (𝑒𝐷𝑏) ↔ 𝑧 = (𝑒𝐷𝑓)))
57	54, 56	cbvrex2vw 3238	. . . . . . . . . 10 ⊢ (∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏) ↔ ∃𝑒 ∈ [ 𝐴] ∼ ∃𝑓 ∈ [ 𝐵] ∼ 𝑧 = (𝑒𝐷𝑓))
58	57	biimpi 215	. . . . . . . . 9 ⊢ (∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏) → ∃𝑒 ∈ [ 𝐴] ∼ ∃𝑓 ∈ [ 𝐵] ∼ 𝑧 = (𝑒𝐷𝑓))
59	58	adantl 481	. . . . . . . 8 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏)) → ∃𝑒 ∈ [ 𝐴] ∼ ∃𝑓 ∈ [ 𝐵] ∼ 𝑧 = (𝑒𝐷𝑓))
60	52, 59	r19.29vva 3212	. . . . . . 7 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏)) → 𝑧 = (𝐴𝐷𝐵))
61		simpl1 1190	. . . . . . . . . 10 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝑧 = (𝐴𝐷𝐵)) → 𝐷 ∈ (PsMet‘𝑋))
62		simpl2 1191	. . . . . . . . . 10 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝑧 = (𝐴𝐷𝐵)) → 𝐴 ∈ 𝑋)
63		psmet0 24035	. . . . . . . . . 10 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋) → (𝐴𝐷𝐴) = 0)
64	61, 62, 63	syl2anc 583	. . . . . . . . 9 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝑧 = (𝐴𝐷𝐵)) → (𝐴𝐷𝐴) = 0)
65		relelec 8752	. . . . . . . . . . 11 ⊢ (Rel ∼ → (𝐴 ∈ [𝐴] ∼ ↔ 𝐴 ∼ 𝐴))
66	61, 34, 65	3syl 18	. . . . . . . . . 10 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝑧 = (𝐴𝐷𝐵)) → (𝐴 ∈ [𝐴] ∼ ↔ 𝐴 ∼ 𝐴))
67	1	a1i 11	. . . . . . . . . . 11 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝑧 = (𝐴𝐷𝐵)) → ∼ = (~_Met‘𝐷))
68	67	breqd 5159	. . . . . . . . . 10 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝑧 = (𝐴𝐷𝐵)) → (𝐴 ∼ 𝐴 ↔ 𝐴(~_Met‘𝐷)𝐴))
69		metidv 33171	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐴 ∈ 𝑋 ∧ 𝐴 ∈ 𝑋)) → (𝐴(~_Met‘𝐷)𝐴 ↔ (𝐴𝐷𝐴) = 0))
70	61, 62, 62, 69	syl12anc 834	. . . . . . . . . 10 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝑧 = (𝐴𝐷𝐵)) → (𝐴(~_Met‘𝐷)𝐴 ↔ (𝐴𝐷𝐴) = 0))
71	66, 68, 70	3bitrd 305	. . . . . . . . 9 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝑧 = (𝐴𝐷𝐵)) → (𝐴 ∈ [𝐴] ∼ ↔ (𝐴𝐷𝐴) = 0))
72	64, 71	mpbird 257	. . . . . . . 8 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝑧 = (𝐴𝐷𝐵)) → 𝐴 ∈ [𝐴] ∼ )
73		simpl3 1192	. . . . . . . . . 10 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝑧 = (𝐴𝐷𝐵)) → 𝐵 ∈ 𝑋)
74		psmet0 24035	. . . . . . . . . 10 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐵 ∈ 𝑋) → (𝐵𝐷𝐵) = 0)
75	61, 73, 74	syl2anc 583	. . . . . . . . 9 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝑧 = (𝐴𝐷𝐵)) → (𝐵𝐷𝐵) = 0)
76		relelec 8752	. . . . . . . . . . 11 ⊢ (Rel ∼ → (𝐵 ∈ [𝐵] ∼ ↔ 𝐵 ∼ 𝐵))
77	61, 34, 76	3syl 18	. . . . . . . . . 10 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝑧 = (𝐴𝐷𝐵)) → (𝐵 ∈ [𝐵] ∼ ↔ 𝐵 ∼ 𝐵))
78	67	breqd 5159	. . . . . . . . . 10 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝑧 = (𝐴𝐷𝐵)) → (𝐵 ∼ 𝐵 ↔ 𝐵(~_Met‘𝐷)𝐵))
79		metidv 33171	. . . . . . . . . . 11 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ (𝐵 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋)) → (𝐵(~_Met‘𝐷)𝐵 ↔ (𝐵𝐷𝐵) = 0))
80	61, 73, 73, 79	syl12anc 834	. . . . . . . . . 10 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝑧 = (𝐴𝐷𝐵)) → (𝐵(~_Met‘𝐷)𝐵 ↔ (𝐵𝐷𝐵) = 0))
81	77, 78, 80	3bitrd 305	. . . . . . . . 9 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝑧 = (𝐴𝐷𝐵)) → (𝐵 ∈ [𝐵] ∼ ↔ (𝐵𝐷𝐵) = 0))
82	75, 81	mpbird 257	. . . . . . . 8 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝑧 = (𝐴𝐷𝐵)) → 𝐵 ∈ [𝐵] ∼ )
83		simpr 484	. . . . . . . 8 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝑧 = (𝐴𝐷𝐵)) → 𝑧 = (𝐴𝐷𝐵))
84		rspceov 7459	. . . . . . . 8 ⊢ ((𝐴 ∈ [𝐴] ∼ ∧ 𝐵 ∈ [𝐵] ∼ ∧ 𝑧 = (𝐴𝐷𝐵)) → ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏))
85	72, 82, 83, 84	syl3anc 1370	. . . . . . 7 ⊢ (((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) ∧ 𝑧 = (𝐴𝐷𝐵)) → ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏))
86	60, 85	impbida 798	. . . . . 6 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → (∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏) ↔ 𝑧 = (𝐴𝐷𝐵)))
87	86	abbidv 2800	. . . . 5 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → {𝑧 ∣ ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏)} = {𝑧 ∣ 𝑧 = (𝐴𝐷𝐵)})
88		df-sn 4629	. . . . 5 ⊢ {(𝐴𝐷𝐵)} = {𝑧 ∣ 𝑧 = (𝐴𝐷𝐵)}
89	87, 88	eqtr4di 2789	. . . 4 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → {𝑧 ∣ ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏)} = {(𝐴𝐷𝐵)})
90	89	unieqd 4922	. . 3 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ∪ {𝑧 ∣ ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏)} = ∪ {(𝐴𝐷𝐵)})
91		ovex 7445	. . . 4 ⊢ (𝐴𝐷𝐵) ∈ V
92	91	unisn 4930	. . 3 ⊢ ∪ {(𝐴𝐷𝐵)} = (𝐴𝐷𝐵)
93	90, 92	eqtrdi 2787	. 2 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ∪ {𝑧 ∣ ∃𝑎 ∈ [ 𝐴] ∼ ∃𝑏 ∈ [ 𝐵] ∼ 𝑧 = (𝑎𝐷𝑏)} = (𝐴𝐷𝐵))
94	4, 25, 93	3eqtrd 2775	1 ⊢ ((𝐷 ∈ (PsMet‘𝑋) ∧ 𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋) → ([𝐴] ∼ (pstoMet‘𝐷)[𝐵] ∼ ) = (𝐴𝐷𝐵))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 205 ∧ wa 395 ∧ w3a 1086 = wceq 1540 ∈ wcel 2105 {cab 2708 ∃wrex 3069 Vcvv 3473 ⊆ wss 3948 {csn 4628 ∪ cuni 4908 class class class wbr 5148 × cxp 5674 Rel wrel 5681 ‘cfv 6543 (class class class)co 7412 ∈ cmpo 7414 [cec 8705 / cqs 8706 0cc0 11114 PsMetcpsmet 21129 ~_Metcmetid 33165 pstoMetcpstm 33166

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2702 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5363 ax-pr 5427 ax-un 7729 ax-cnex 11170 ax-resscn 11171 ax-1cn 11172 ax-icn 11173 ax-addcl 11174 ax-addrcl 11175 ax-mulcl 11176 ax-mulrcl 11177 ax-mulcom 11178 ax-addass 11179 ax-mulass 11180 ax-distr 11181 ax-i2m1 11182 ax-1ne0 11183 ax-1rid 11184 ax-rnegex 11185 ax-rrecex 11186 ax-cnre 11187 ax-pre-lttri 11188 ax-pre-lttrn 11189 ax-pre-ltadd 11190

This theorem depends on definitions: df-bi 206 df-an 396 df-or 845 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2533 df-eu 2562 df-clab 2709 df-cleq 2723 df-clel 2809 df-nfc 2884 df-ne 2940 df-nel 3046 df-ral 3061 df-rex 3070 df-reu 3376 df-rab 3432 df-v 3475 df-sbc 3778 df-csb 3894 df-dif 3951 df-un 3953 df-in 3955 df-ss 3965 df-nul 4323 df-if 4529 df-pw 4604 df-sn 4629 df-pr 4631 df-op 4635 df-uni 4909 df-iun 4999 df-br 5149 df-opab 5211 df-mpt 5232 df-id 5574 df-po 5588 df-so 5589 df-xp 5682 df-rel 5683 df-cnv 5684 df-co 5685 df-dm 5686 df-rn 5687 df-res 5688 df-ima 5689 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-ov 7415 df-oprab 7416 df-mpo 7417 df-1st 7979 df-2nd 7980 df-er 8707 df-ec 8709 df-qs 8713 df-map 8826 df-en 8944 df-dom 8945 df-sdom 8946 df-pnf 11255 df-mnf 11256 df-xr 11257 df-ltxr 11258 df-le 11259 df-xadd 13098 df-psmet 21137 df-metid 33167 df-pstm 33168

This theorem is referenced by: pstmxmet 33176

W3C validator