Theorem wemaplem1 9524

Description: Value of the lexicographic order on a sequence space. (Contributed by Stefan O'Rear, 18-Jan-2015.)

Hypothesis

Ref	Expression
wemapso.t	⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐴 ((𝑥‘𝑧)𝑆(𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐴 (𝑤𝑅𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤)))}

Assertion

Ref	Expression
wemaplem1	⊢ ((𝑃 ∈ 𝑉 ∧ 𝑄 ∈ 𝑊) → (𝑃𝑇𝑄 ↔ ∃𝑎 ∈ 𝐴 ((𝑃‘𝑎)𝑆(𝑄‘𝑎) ∧ ∀𝑏 ∈ 𝐴 (𝑏𝑅𝑎 → (𝑃‘𝑏) = (𝑄‘𝑏)))))

Distinct variable groups:   𝑎,𝑏,𝑥   𝑇,𝑎,𝑏   𝑤,𝑎,𝑦,𝑧,𝑏,𝑥,𝐴   𝑃,𝑎,𝑏,𝑤,𝑥,𝑦,𝑧   𝑄,𝑎,𝑏,𝑤,𝑥,𝑦,𝑧   𝑅,𝑎,𝑏,𝑤,𝑥,𝑦,𝑧   𝑆,𝑎,𝑏,𝑤,𝑥,𝑦,𝑧

Allowed substitution hints:   𝑇(𝑥, 𝑦, 𝑧, 𝑤)   𝑉(𝑥, 𝑦, 𝑧, 𝑤, 𝑎, 𝑏)   𝑊(𝑥, 𝑦, 𝑧, 𝑤, 𝑎, 𝑏)

Proof of Theorem wemaplem1

Step	Hyp	Ref	Expression
1		fveq1 6876	. . . . . 6 ⊢ (𝑥 = 𝑃 → (𝑥‘𝑧) = (𝑃‘𝑧))
2		fveq1 6876	. . . . . 6 ⊢ (𝑦 = 𝑄 → (𝑦‘𝑧) = (𝑄‘𝑧))
3	1, 2	breqan12d 5119	. . . . 5 ⊢ ((𝑥 = 𝑃 ∧ 𝑦 = 𝑄) → ((𝑥‘𝑧)𝑆(𝑦‘𝑧) ↔ (𝑃‘𝑧)𝑆(𝑄‘𝑧)))
4		fveq1 6876	. . . . . . . 8 ⊢ (𝑥 = 𝑃 → (𝑥‘𝑤) = (𝑃‘𝑤))
5		fveq1 6876	. . . . . . . 8 ⊢ (𝑦 = 𝑄 → (𝑦‘𝑤) = (𝑄‘𝑤))
6	4, 5	eqeqan12d 2775	. . . . . . 7 ⊢ ((𝑥 = 𝑃 ∧ 𝑦 = 𝑄) → ((𝑥‘𝑤) = (𝑦‘𝑤) ↔ (𝑃‘𝑤) = (𝑄‘𝑤)))
7	6	imbi2d 343	. . . . . 6 ⊢ ((𝑥 = 𝑃 ∧ 𝑦 = 𝑄) → ((𝑤𝑅𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤)) ↔ (𝑤𝑅𝑧 → (𝑃‘𝑤) = (𝑄‘𝑤))))
8	7	ralbidv 3186	. . . . 5 ⊢ ((𝑥 = 𝑃 ∧ 𝑦 = 𝑄) → (∀𝑤 ∈ 𝐴 (𝑤𝑅𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤)) ↔ ∀𝑤 ∈ 𝐴 (𝑤𝑅𝑧 → (𝑃‘𝑤) = (𝑄‘𝑤))))
9	3, 8	anbi12d 644	. . . 4 ⊢ ((𝑥 = 𝑃 ∧ 𝑦 = 𝑄) → (((𝑥‘𝑧)𝑆(𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐴 (𝑤𝑅𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ↔ ((𝑃‘𝑧)𝑆(𝑄‘𝑧) ∧ ∀𝑤 ∈ 𝐴 (𝑤𝑅𝑧 → (𝑃‘𝑤) = (𝑄‘𝑤)))))
10	9	rexbidv 3187	. . 3 ⊢ ((𝑥 = 𝑃 ∧ 𝑦 = 𝑄) → (∃𝑧 ∈ 𝐴 ((𝑥‘𝑧)𝑆(𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐴 (𝑤𝑅𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ↔ ∃𝑧 ∈ 𝐴 ((𝑃‘𝑧)𝑆(𝑄‘𝑧) ∧ ∀𝑤 ∈ 𝐴 (𝑤𝑅𝑧 → (𝑃‘𝑤) = (𝑄‘𝑤)))))
11		fveq2 6877	. . . . . 6 ⊢ (𝑧 = 𝑎 → (𝑃‘𝑧) = (𝑃‘𝑎))
12		fveq2 6877	. . . . . 6 ⊢ (𝑧 = 𝑎 → (𝑄‘𝑧) = (𝑄‘𝑎))
13	11, 12	breq12d 5116	. . . . 5 ⊢ (𝑧 = 𝑎 → ((𝑃‘𝑧)𝑆(𝑄‘𝑧) ↔ (𝑃‘𝑎)𝑆(𝑄‘𝑎)))
14		breq2 5107	. . . . . . . 8 ⊢ (𝑧 = 𝑎 → (𝑤𝑅𝑧 ↔ 𝑤𝑅𝑎))
15	14	imbi1d 344	. . . . . . 7 ⊢ (𝑧 = 𝑎 → ((𝑤𝑅𝑧 → (𝑃‘𝑤) = (𝑄‘𝑤)) ↔ (𝑤𝑅𝑎 → (𝑃‘𝑤) = (𝑄‘𝑤))))
16	15	ralbidv 3186	. . . . . 6 ⊢ (𝑧 = 𝑎 → (∀𝑤 ∈ 𝐴 (𝑤𝑅𝑧 → (𝑃‘𝑤) = (𝑄‘𝑤)) ↔ ∀𝑤 ∈ 𝐴 (𝑤𝑅𝑎 → (𝑃‘𝑤) = (𝑄‘𝑤))))
17		breq1 5106	. . . . . . . 8 ⊢ (𝑤 = 𝑏 → (𝑤𝑅𝑎 ↔ 𝑏𝑅𝑎))
18		fveq2 6877	. . . . . . . . 9 ⊢ (𝑤 = 𝑏 → (𝑃‘𝑤) = (𝑃‘𝑏))
19		fveq2 6877	. . . . . . . . 9 ⊢ (𝑤 = 𝑏 → (𝑄‘𝑤) = (𝑄‘𝑏))
20	18, 19	eqeq12d 2777	. . . . . . . 8 ⊢ (𝑤 = 𝑏 → ((𝑃‘𝑤) = (𝑄‘𝑤) ↔ (𝑃‘𝑏) = (𝑄‘𝑏)))
21	17, 20	imbi12d 347	. . . . . . 7 ⊢ (𝑤 = 𝑏 → ((𝑤𝑅𝑎 → (𝑃‘𝑤) = (𝑄‘𝑤)) ↔ (𝑏𝑅𝑎 → (𝑃‘𝑏) = (𝑄‘𝑏))))
22	21	cbvralvw 3241	. . . . . 6 ⊢ (∀𝑤 ∈ 𝐴 (𝑤𝑅𝑎 → (𝑃‘𝑤) = (𝑄‘𝑤)) ↔ ∀𝑏 ∈ 𝐴 (𝑏𝑅𝑎 → (𝑃‘𝑏) = (𝑄‘𝑏)))
23	16, 22	bitrdi 290	. . . . 5 ⊢ (𝑧 = 𝑎 → (∀𝑤 ∈ 𝐴 (𝑤𝑅𝑧 → (𝑃‘𝑤) = (𝑄‘𝑤)) ↔ ∀𝑏 ∈ 𝐴 (𝑏𝑅𝑎 → (𝑃‘𝑏) = (𝑄‘𝑏))))
24	13, 23	anbi12d 644	. . . 4 ⊢ (𝑧 = 𝑎 → (((𝑃‘𝑧)𝑆(𝑄‘𝑧) ∧ ∀𝑤 ∈ 𝐴 (𝑤𝑅𝑧 → (𝑃‘𝑤) = (𝑄‘𝑤))) ↔ ((𝑃‘𝑎)𝑆(𝑄‘𝑎) ∧ ∀𝑏 ∈ 𝐴 (𝑏𝑅𝑎 → (𝑃‘𝑏) = (𝑄‘𝑏)))))
25	24	cbvrexvw 3242	. . 3 ⊢ (∃𝑧 ∈ 𝐴 ((𝑃‘𝑧)𝑆(𝑄‘𝑧) ∧ ∀𝑤 ∈ 𝐴 (𝑤𝑅𝑧 → (𝑃‘𝑤) = (𝑄‘𝑤))) ↔ ∃𝑎 ∈ 𝐴 ((𝑃‘𝑎)𝑆(𝑄‘𝑎) ∧ ∀𝑏 ∈ 𝐴 (𝑏𝑅𝑎 → (𝑃‘𝑏) = (𝑄‘𝑏))))
26	10, 25	bitrdi 290	. 2 ⊢ ((𝑥 = 𝑃 ∧ 𝑦 = 𝑄) → (∃𝑧 ∈ 𝐴 ((𝑥‘𝑧)𝑆(𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐴 (𝑤𝑅𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤))) ↔ ∃𝑎 ∈ 𝐴 ((𝑃‘𝑎)𝑆(𝑄‘𝑎) ∧ ∀𝑏 ∈ 𝐴 (𝑏𝑅𝑎 → (𝑃‘𝑏) = (𝑄‘𝑏)))))
27		wemapso.t	. 2 ⊢ 𝑇 = {⟨𝑥, 𝑦⟩ ∣ ∃𝑧 ∈ 𝐴 ((𝑥‘𝑧)𝑆(𝑦‘𝑧) ∧ ∀𝑤 ∈ 𝐴 (𝑤𝑅𝑧 → (𝑥‘𝑤) = (𝑦‘𝑤)))}
28	26, 27	brabga 5508	1 ⊢ ((𝑃 ∈ 𝑉 ∧ 𝑄 ∈ 𝑊) → (𝑃𝑇𝑄 ↔ ∃𝑎 ∈ 𝐴 ((𝑃‘𝑎)𝑆(𝑄‘𝑎) ∧ ∀𝑏 ∈ 𝐴 (𝑏𝑅𝑎 → (𝑃‘𝑏) = (𝑄‘𝑏)))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087   class class class wbr 5103  {copab 5167  ‘cfv 6531

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-ext 2733  ax-sep 5249  ax-pr 5391

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-sb 2100  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-iota 6487  df-fv 6539

This theorem is used by:  wemaplem2  9525  wemaplem3  9526  wemappo  9527  wemapsolem  9528