wwlktovfo - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > wwlktovfo		Structured version Visualization version GIF version

Theorem wwlktovfo 14994

Description: Lemma 3 for wrd2f1tovbij 14996. (Contributed by Alexander van der Vekens, 27-Jul-2018.)

**Hypotheses**
Ref	Expression
wwlktovf1o.d	⊢ 𝐷 = {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)}
wwlktovf1o.r	⊢ 𝑅 = {𝑛 ∈ 𝑉 ∣ {𝑃, 𝑛} ∈ 𝑋}
wwlktovf1o.f	⊢ 𝐹 = (𝑡 ∈ 𝐷 ↦ (𝑡‘1))

**Assertion**
Ref	Expression
wwlktovfo	⊢ (𝑃 ∈ 𝑉 → 𝐹:𝐷–onto→𝑅)

Distinct variable groups: 𝑡,𝐷 𝑃,𝑛,𝑡,𝑤 𝑡,𝑅 𝑛,𝑉,𝑡,𝑤 𝑛,𝑋,𝑤 Allowed substitution hints: 𝐷(𝑤,𝑛) 𝑅(𝑤,𝑛) 𝐹(𝑤,𝑡,𝑛) 𝑋(𝑡)

Proof of Theorem wwlktovfo Dummy variables 𝑝 𝑢 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		wwlktovf1o.d	. . . 4 ⊢ 𝐷 = {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)}
2		wwlktovf1o.r	. . . 4 ⊢ 𝑅 = {𝑛 ∈ 𝑉 ∣ {𝑃, 𝑛} ∈ 𝑋}
3		wwlktovf1o.f	. . . 4 ⊢ 𝐹 = (𝑡 ∈ 𝐷 ↦ (𝑡‘1))
4	1, 2, 3	wwlktovf 14992	. . 3 ⊢ 𝐹:𝐷⟶𝑅
5	4	a1i 11	. 2 ⊢ (𝑃 ∈ 𝑉 → 𝐹:𝐷⟶𝑅)
6		preq2 4739	. . . . . 6 ⊢ (𝑛 = 𝑝 → {𝑃, 𝑛} = {𝑃, 𝑝})
7	6	eleq1d 2824	. . . . 5 ⊢ (𝑛 = 𝑝 → ({𝑃, 𝑛} ∈ 𝑋 ↔ {𝑃, 𝑝} ∈ 𝑋))
8	7, 2	elrab2 3698	. . . 4 ⊢ (𝑝 ∈ 𝑅 ↔ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))
9		simpl 482	. . . . . . . . . . 11 ⊢ ((𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋) → 𝑝 ∈ 𝑉)
10	9	anim2i 617	. . . . . . . . . 10 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → (𝑃 ∈ 𝑉 ∧ 𝑝 ∈ 𝑉))
11		eqidd 2736	. . . . . . . . . 10 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → {⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = {⟨0, 𝑃⟩, ⟨1, 𝑝⟩})
12		wrdlen2i 14978	. . . . . . . . . 10 ⊢ ((𝑃 ∈ 𝑉 ∧ 𝑝 ∈ 𝑉) → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = {⟨0, 𝑃⟩, ⟨1, 𝑝⟩} → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝))))
13	10, 11, 12	sylc 65	. . . . . . . . 9 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)))
14		prex 5443	. . . . . . . . . . 11 ⊢ {⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ V
15	14	a1i 11	. . . . . . . . . 10 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → {⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ V)
16		eleq1 2827	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ↔ 𝑢 ∈ Word 𝑉))
17	16	biimpd 229	. . . . . . . . . . . . . . . . . . 19 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 → 𝑢 ∈ Word 𝑉))
18	17	adantr 480	. . . . . . . . . . . . . . . . . 18 ⊢ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 → 𝑢 ∈ Word 𝑉))
19	18	com12 32	. . . . . . . . . . . . . . . . 17 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → 𝑢 ∈ Word 𝑉))
20	19	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → 𝑢 ∈ Word 𝑉))
21	20	adantr 480	. . . . . . . . . . . . . . 15 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → 𝑢 ∈ Word 𝑉))
22	21	impcom 407	. . . . . . . . . . . . . 14 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝))) → 𝑢 ∈ Word 𝑉)
23		fveqeq2 6916	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ((♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2 ↔ (♯‘𝑢) = 2))
24	23	biimpd 229	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ((♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2 → (♯‘𝑢) = 2))
25	24	adantr 480	. . . . . . . . . . . . . . . . . . 19 ⊢ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → ((♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2 → (♯‘𝑢) = 2))
26	25	com12 32	. . . . . . . . . . . . . . . . . 18 ⊢ ((♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2 → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → (♯‘𝑢) = 2))
27	26	adantl 481	. . . . . . . . . . . . . . . . 17 ⊢ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → (♯‘𝑢) = 2))
28	27	adantr 480	. . . . . . . . . . . . . . . 16 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → (♯‘𝑢) = 2))
29	28	impcom 407	. . . . . . . . . . . . . . 15 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝))) → (♯‘𝑢) = 2)
30		fveq1 6906	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = (𝑢‘0))
31	30	eqeq1d 2737	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ↔ (𝑢‘0) = 𝑃))
32	31	biimpd 229	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 → (𝑢‘0) = 𝑃))
33	32	adantr 480	. . . . . . . . . . . . . . . . . . 19 ⊢ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 → (𝑢‘0) = 𝑃))
34	33	com12 32	. . . . . . . . . . . . . . . . . 18 ⊢ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → (𝑢‘0) = 𝑃))
35	34	adantr 480	. . . . . . . . . . . . . . . . 17 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝) → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → (𝑢‘0) = 𝑃))
36	35	adantl 481	. . . . . . . . . . . . . . . 16 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → (𝑢‘0) = 𝑃))
37	36	impcom 407	. . . . . . . . . . . . . . 15 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝))) → (𝑢‘0) = 𝑃)
38		fveq1 6906	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = (𝑢‘1))
39	38	eqeq1d 2737	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝 ↔ (𝑢‘1) = 𝑝))
40	31, 39	anbi12d 632	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝) ↔ ((𝑢‘0) = 𝑃 ∧ (𝑢‘1) = 𝑝)))
41		preq12 4740	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝑢‘0) = 𝑃 ∧ (𝑢‘1) = 𝑝) → {(𝑢‘0), (𝑢‘1)} = {𝑃, 𝑝})
42	41	eqcomd 2741	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑢‘0) = 𝑃 ∧ (𝑢‘1) = 𝑝) → {𝑃, 𝑝} = {(𝑢‘0), (𝑢‘1)})
43	42	eleq1d 2824	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑢‘0) = 𝑃 ∧ (𝑢‘1) = 𝑝) → ({𝑃, 𝑝} ∈ 𝑋 ↔ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋))
44	43	biimpd 229	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑢‘0) = 𝑃 ∧ (𝑢‘1) = 𝑝) → ({𝑃, 𝑝} ∈ 𝑋 → {(𝑢‘0), (𝑢‘1)} ∈ 𝑋))
45	40, 44	biimtrdi 253	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝) → ({𝑃, 𝑝} ∈ 𝑋 → {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)))
46	45	com12 32	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝) → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ({𝑃, 𝑝} ∈ 𝑋 → {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)))
47	46	adantl 481	. . . . . . . . . . . . . . . . . . 19 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ({𝑃, 𝑝} ∈ 𝑋 → {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)))
48	47	com13 88	. . . . . . . . . . . . . . . . . 18 ⊢ ({𝑃, 𝑝} ∈ 𝑋 → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)))
49	48	ad2antll 729	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)))
50	49	impcom 407	. . . . . . . . . . . . . . . 16 ⊢ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → {(𝑢‘0), (𝑢‘1)} ∈ 𝑋))
51	50	imp 406	. . . . . . . . . . . . . . 15 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝))) → {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)
52	29, 37, 51	3jca 1127	. . . . . . . . . . . . . 14 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝))) → ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋))
53		eqcom 2742	. . . . . . . . . . . . . . . . . . . 20 ⊢ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝 ↔ 𝑝 = ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1))
54	38	eqeq2d 2746	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → (𝑝 = ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) ↔ 𝑝 = (𝑢‘1)))
55	54	biimpd 229	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → (𝑝 = ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) → 𝑝 = (𝑢‘1)))
56	53, 55	biimtrid 242	. . . . . . . . . . . . . . . . . . 19 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝 → 𝑝 = (𝑢‘1)))
57	56	com12 32	. . . . . . . . . . . . . . . . . 18 ⊢ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝 → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → 𝑝 = (𝑢‘1)))
58	57	ad2antll 729	. . . . . . . . . . . . . . . . 17 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → 𝑝 = (𝑢‘1)))
59	58	com12 32	. . . . . . . . . . . . . . . 16 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → 𝑝 = (𝑢‘1)))
60	59	adantr 480	. . . . . . . . . . . . . . 15 ⊢ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → 𝑝 = (𝑢‘1)))
61	60	imp 406	. . . . . . . . . . . . . 14 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝))) → 𝑝 = (𝑢‘1))
62	22, 52, 61	jca31 514	. . . . . . . . . . . . 13 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝))) → ((𝑢 ∈ Word 𝑉 ∧ ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)) ∧ 𝑝 = (𝑢‘1)))
63	62	exp31 419	. . . . . . . . . . . 12 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → ((𝑢 ∈ Word 𝑉 ∧ ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)) ∧ 𝑝 = (𝑢‘1)))))
64	63	eqcoms 2743	. . . . . . . . . . 11 ⊢ (𝑢 = {⟨0, 𝑃⟩, ⟨1, 𝑝⟩} → ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → ((𝑢 ∈ Word 𝑉 ∧ ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)) ∧ 𝑝 = (𝑢‘1)))))
65	64	impcom 407	. . . . . . . . . 10 ⊢ (((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) ∧ 𝑢 = {⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → ((𝑢 ∈ Word 𝑉 ∧ ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)) ∧ 𝑝 = (𝑢‘1))))
66	15, 65	spcimedv 3595	. . . . . . . . 9 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → ∃𝑢((𝑢 ∈ Word 𝑉 ∧ ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)) ∧ 𝑝 = (𝑢‘1))))
67	13, 66	mpd 15	. . . . . . . 8 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → ∃𝑢((𝑢 ∈ Word 𝑉 ∧ ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)) ∧ 𝑝 = (𝑢‘1)))
68		fveqeq2 6916	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑢 → ((♯‘𝑤) = 2 ↔ (♯‘𝑢) = 2))
69		fveq1 6906	. . . . . . . . . . . . 13 ⊢ (𝑤 = 𝑢 → (𝑤‘0) = (𝑢‘0))
70	69	eqeq1d 2737	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑢 → ((𝑤‘0) = 𝑃 ↔ (𝑢‘0) = 𝑃))
71		fveq1 6906	. . . . . . . . . . . . . 14 ⊢ (𝑤 = 𝑢 → (𝑤‘1) = (𝑢‘1))
72	69, 71	preq12d 4746	. . . . . . . . . . . . 13 ⊢ (𝑤 = 𝑢 → {(𝑤‘0), (𝑤‘1)} = {(𝑢‘0), (𝑢‘1)})
73	72	eleq1d 2824	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑢 → ({(𝑤‘0), (𝑤‘1)} ∈ 𝑋 ↔ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋))
74	68, 70, 73	3anbi123d 1435	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑢 → (((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋) ↔ ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)))
75	74	elrab 3695	. . . . . . . . . 10 ⊢ (𝑢 ∈ {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)} ↔ (𝑢 ∈ Word 𝑉 ∧ ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)))
76	75	anbi1i 624	. . . . . . . . 9 ⊢ ((𝑢 ∈ {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)} ∧ 𝑝 = (𝑢‘1)) ↔ ((𝑢 ∈ Word 𝑉 ∧ ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)) ∧ 𝑝 = (𝑢‘1)))
77	76	exbii 1845	. . . . . . . 8 ⊢ (∃𝑢(𝑢 ∈ {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)} ∧ 𝑝 = (𝑢‘1)) ↔ ∃𝑢((𝑢 ∈ Word 𝑉 ∧ ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)) ∧ 𝑝 = (𝑢‘1)))
78	67, 77	sylibr 234	. . . . . . 7 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → ∃𝑢(𝑢 ∈ {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)} ∧ 𝑝 = (𝑢‘1)))
79		df-rex 3069	. . . . . . 7 ⊢ (∃𝑢 ∈ {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)}𝑝 = (𝑢‘1) ↔ ∃𝑢(𝑢 ∈ {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)} ∧ 𝑝 = (𝑢‘1)))
80	78, 79	sylibr 234	. . . . . 6 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → ∃𝑢 ∈ {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)}𝑝 = (𝑢‘1))
81	1	rexeqi 3323	. . . . . 6 ⊢ (∃𝑢 ∈ 𝐷 𝑝 = (𝑢‘1) ↔ ∃𝑢 ∈ {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)}𝑝 = (𝑢‘1))
82	80, 81	sylibr 234	. . . . 5 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → ∃𝑢 ∈ 𝐷 𝑝 = (𝑢‘1))
83		fveq1 6906	. . . . . . . 8 ⊢ (𝑡 = 𝑢 → (𝑡‘1) = (𝑢‘1))
84		fvex 6920	. . . . . . . 8 ⊢ (𝑢‘1) ∈ V
85	83, 3, 84	fvmpt 7016	. . . . . . 7 ⊢ (𝑢 ∈ 𝐷 → (𝐹‘𝑢) = (𝑢‘1))
86	85	eqeq2d 2746	. . . . . 6 ⊢ (𝑢 ∈ 𝐷 → (𝑝 = (𝐹‘𝑢) ↔ 𝑝 = (𝑢‘1)))
87	86	rexbiia 3090	. . . . 5 ⊢ (∃𝑢 ∈ 𝐷 𝑝 = (𝐹‘𝑢) ↔ ∃𝑢 ∈ 𝐷 𝑝 = (𝑢‘1))
88	82, 87	sylibr 234	. . . 4 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → ∃𝑢 ∈ 𝐷 𝑝 = (𝐹‘𝑢))
89	8, 88	sylan2b 594	. . 3 ⊢ ((𝑃 ∈ 𝑉 ∧ 𝑝 ∈ 𝑅) → ∃𝑢 ∈ 𝐷 𝑝 = (𝐹‘𝑢))
90	89	ralrimiva 3144	. 2 ⊢ (𝑃 ∈ 𝑉 → ∀𝑝 ∈ 𝑅 ∃𝑢 ∈ 𝐷 𝑝 = (𝐹‘𝑢))
91		dffo3 7122	. 2 ⊢ (𝐹:𝐷–onto→𝑅 ↔ (𝐹:𝐷⟶𝑅 ∧ ∀𝑝 ∈ 𝑅 ∃𝑢 ∈ 𝐷 𝑝 = (𝐹‘𝑢)))
92	5, 90, 91	sylanbrc 583	1 ⊢ (𝑃 ∈ 𝑉 → 𝐹:𝐷–onto→𝑅)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 ∧ w3a 1086 = wceq 1537 ∃wex 1776 ∈ wcel 2106 ∀wral 3059 ∃wrex 3068 {crab 3433 Vcvv 3478 {cpr 4633 ⟨cop 4637 ↦ cmpt 5231 ⟶wf 6559 –onto→wfo 6561 ‘cfv 6563 0cc0 11153 1c1 11154 2c2 12319 ♯chash 14366 Word cword 14549

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1908 ax-6 1965 ax-7 2005 ax-8 2108 ax-9 2116 ax-10 2139 ax-11 2155 ax-12 2175 ax-ext 2706 ax-rep 5285 ax-sep 5302 ax-nul 5312 ax-pow 5371 ax-pr 5438 ax-un 7754 ax-cnex 11209 ax-resscn 11210 ax-1cn 11211 ax-icn 11212 ax-addcl 11213 ax-addrcl 11214 ax-mulcl 11215 ax-mulrcl 11216 ax-mulcom 11217 ax-addass 11218 ax-mulass 11219 ax-distr 11220 ax-i2m1 11221 ax-1ne0 11222 ax-1rid 11223 ax-rnegex 11224 ax-rrecex 11225 ax-cnre 11226 ax-pre-lttri 11227 ax-pre-lttrn 11228 ax-pre-ltadd 11229 ax-pre-mulgt0 11230

This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1540 df-fal 1550 df-ex 1777 df-nf 1781 df-sb 2063 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2727 df-clel 2814 df-nfc 2890 df-ne 2939 df-nel 3045 df-ral 3060 df-rex 3069 df-reu 3379 df-rab 3434 df-v 3480 df-sbc 3792 df-csb 3909 df-dif 3966 df-un 3968 df-in 3970 df-ss 3980 df-pss 3983 df-nul 4340 df-if 4532 df-pw 4607 df-sn 4632 df-pr 4634 df-op 4638 df-uni 4913 df-int 4952 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5583 df-eprel 5589 df-po 5597 df-so 5598 df-fr 5641 df-we 5643 df-xp 5695 df-rel 5696 df-cnv 5697 df-co 5698 df-dm 5699 df-rn 5700 df-res 5701 df-ima 5702 df-pred 6323 df-ord 6389 df-on 6390 df-lim 6391 df-suc 6392 df-iota 6516 df-fun 6565 df-fn 6566 df-f 6567 df-f1 6568 df-fo 6569 df-f1o 6570 df-fv 6571 df-riota 7388 df-ov 7434 df-oprab 7435 df-mpo 7436 df-om 7888 df-1st 8013 df-2nd 8014 df-frecs 8305 df-wrecs 8336 df-recs 8410 df-rdg 8449 df-1o 8505 df-oadd 8509 df-er 8744 df-en 8985 df-dom 8986 df-sdom 8987 df-fin 8988 df-dju 9939 df-card 9977 df-pnf 11295 df-mnf 11296 df-xr 11297 df-ltxr 11298 df-le 11299 df-sub 11492 df-neg 11493 df-nn 12265 df-2 12327 df-n0 12525 df-z 12612 df-uz 12877 df-fz 13545 df-fzo 13692 df-hash 14367 df-word 14550

This theorem is referenced by: wwlktovf1o 14995

W3C validator