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 15154

Description: Lemma 3 for wrd2f1tovbij 15156. (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 15152	. . 3 ⊢ 𝐹:𝐷⟶𝑅
5	4	a1i 11	. 2 ⊢ (𝑃 ∈ 𝑉 → 𝐹:𝐷⟶𝑅)
6		preq2 4697	. . . . . 6 ⊢ (𝑛 = 𝑝 → {𝑃, 𝑛} = {𝑃, 𝑝})
7	6	eleq1d 2849	. . . . 5 ⊢ (𝑛 = 𝑝 → ({𝑃, 𝑛} ∈ 𝑋 ↔ {𝑃, 𝑝} ∈ 𝑋))
8	7, 2	elrab2 3652	. . . 4 ⊢ (𝑝 ∈ 𝑅 ↔ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))
9		simpl 488	. . . . . . . . . . 11 ⊢ ((𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋) → 𝑝 ∈ 𝑉)
10	9	anim2i 629	. . . . . . . . . 10 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → (𝑃 ∈ 𝑉 ∧ 𝑝 ∈ 𝑉))
11		eqidd 2764	. . . . . . . . . 10 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → {⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = {⟨0, 𝑃⟩, ⟨1, 𝑝⟩})
12		wrdlen2i 15136	. . . . . . . . . 10 ⊢ ((𝑃 ∈ 𝑉 ∧ 𝑝 ∈ 𝑉) → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = {⟨0, 𝑃⟩, ⟨1, 𝑝⟩} → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝))))
13	10, 11, 12	sylc 66	. . . . . . . . 9 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)))
14		prex 5403	. . . . . . . . . . 11 ⊢ {⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ V
15	14	a1i 11	. . . . . . . . . 10 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → {⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ V)
16		eleq1 2852	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ↔ 𝑢 ∈ Word 𝑉))
17	16	biimpd 232	. . . . . . . . . . . . . . . . . . 19 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 → 𝑢 ∈ Word 𝑉))
18	17	adantr 486	. . . . . . . . . . . . . . . . . 18 ⊢ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 → 𝑢 ∈ Word 𝑉))
19	18	com12 33	. . . . . . . . . . . . . . . . 17 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → 𝑢 ∈ Word 𝑉))
20	19	adantr 486	. . . . . . . . . . . . . . . 16 ⊢ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → 𝑢 ∈ Word 𝑉))
21	20	adantr 486	. . . . . . . . . . . . . . 15 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → 𝑢 ∈ Word 𝑉))
22	21	impcom 413	. . . . . . . . . . . . . 14 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝))) → 𝑢 ∈ Word 𝑉)
23		fveqeq2 6925	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ((♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2 ↔ (♯‘𝑢) = 2))
24	23	biimpd 232	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ((♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2 → (♯‘𝑢) = 2))
25	24	adantr 486	. . . . . . . . . . . . . . . . . . 19 ⊢ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → ((♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2 → (♯‘𝑢) = 2))
26	25	com12 33	. . . . . . . . . . . . . . . . . 18 ⊢ ((♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2 → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → (♯‘𝑢) = 2))
27	26	adantl 487	. . . . . . . . . . . . . . . . 17 ⊢ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → (♯‘𝑢) = 2))
28	27	adantr 486	. . . . . . . . . . . . . . . 16 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → (♯‘𝑢) = 2))
29	28	impcom 413	. . . . . . . . . . . . . . 15 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝))) → (♯‘𝑢) = 2)
30		fveq1 6915	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = (𝑢‘0))
31	30	eqeq1d 2765	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ↔ (𝑢‘0) = 𝑃))
32	31	biimpd 232	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 → (𝑢‘0) = 𝑃))
33	32	adantr 486	. . . . . . . . . . . . . . . . . . 19 ⊢ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 → (𝑢‘0) = 𝑃))
34	33	com12 33	. . . . . . . . . . . . . . . . . 18 ⊢ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → (𝑢‘0) = 𝑃))
35	34	adantr 486	. . . . . . . . . . . . . . . . 17 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝) → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → (𝑢‘0) = 𝑃))
36	35	adantl 487	. . . . . . . . . . . . . . . 16 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → (𝑢‘0) = 𝑃))
37	36	impcom 413	. . . . . . . . . . . . . . 15 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝))) → (𝑢‘0) = 𝑃)
38		fveq1 6915	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = (𝑢‘1))
39	38	eqeq1d 2765	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝 ↔ (𝑢‘1) = 𝑝))
40	31, 39	anbi12d 644	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝) ↔ ((𝑢‘0) = 𝑃 ∧ (𝑢‘1) = 𝑝)))
41		preq12 4698	. . . . . . . . . . . . . . . . . . . . . . . . 25 ⊢ (((𝑢‘0) = 𝑃 ∧ (𝑢‘1) = 𝑝) → {(𝑢‘0), (𝑢‘1)} = {𝑃, 𝑝})
42	41	eqcomd 2769	. . . . . . . . . . . . . . . . . . . . . . . 24 ⊢ (((𝑢‘0) = 𝑃 ∧ (𝑢‘1) = 𝑝) → {𝑃, 𝑝} = {(𝑢‘0), (𝑢‘1)})
43	42	eleq1d 2849	. . . . . . . . . . . . . . . . . . . . . . 23 ⊢ (((𝑢‘0) = 𝑃 ∧ (𝑢‘1) = 𝑝) → ({𝑃, 𝑝} ∈ 𝑋 ↔ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋))
44	43	biimpd 232	. . . . . . . . . . . . . . . . . . . . . 22 ⊢ (((𝑢‘0) = 𝑃 ∧ (𝑢‘1) = 𝑝) → ({𝑃, 𝑝} ∈ 𝑋 → {(𝑢‘0), (𝑢‘1)} ∈ 𝑋))
45	40, 44	biimtrdi 256	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝) → ({𝑃, 𝑝} ∈ 𝑋 → {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)))
46	45	com12 33	. . . . . . . . . . . . . . . . . . . 20 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝) → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ({𝑃, 𝑝} ∈ 𝑋 → {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)))
47	46	adantl 487	. . . . . . . . . . . . . . . . . . 19 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ({𝑃, 𝑝} ∈ 𝑋 → {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)))
48	47	com13 89	. . . . . . . . . . . . . . . . . 18 ⊢ ({𝑃, 𝑝} ∈ 𝑋 → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)))
49	48	ad2antll 742	. . . . . . . . . . . . . . . . 17 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)))
50	49	impcom 413	. . . . . . . . . . . . . . . 16 ⊢ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → {(𝑢‘0), (𝑢‘1)} ∈ 𝑋))
51	50	imp 412	. . . . . . . . . . . . . . 15 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝))) → {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)
52	29, 37, 51	3jca 1146	. . . . . . . . . . . . . 14 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝))) → ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋))
53		eqcom 2770	. . . . . . . . . . . . . . . . . . . 20 ⊢ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝 ↔ 𝑝 = ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1))
54	38	eqeq2d 2774	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → (𝑝 = ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) ↔ 𝑝 = (𝑢‘1)))
55	54	biimpd 232	. . . . . . . . . . . . . . . . . . . 20 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → (𝑝 = ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) → 𝑝 = (𝑢‘1)))
56	53, 55	biimtrid 245	. . . . . . . . . . . . . . . . . . 19 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝 → 𝑝 = (𝑢‘1)))
57	56	com12 33	. . . . . . . . . . . . . . . . . 18 ⊢ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝 → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → 𝑝 = (𝑢‘1)))
58	57	ad2antll 742	. . . . . . . . . . . . . . . . 17 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → 𝑝 = (𝑢‘1)))
59	58	com12 33	. . . . . . . . . . . . . . . 16 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → 𝑝 = (𝑢‘1)))
60	59	adantr 486	. . . . . . . . . . . . . . 15 ⊢ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → 𝑝 = (𝑢‘1)))
61	60	imp 412	. . . . . . . . . . . . . 14 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝))) → 𝑝 = (𝑢‘1))
62	22, 52, 61	jca31 524	. . . . . . . . . . . . 13 ⊢ ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 ∧ (𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋))) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝))) → ((𝑢 ∈ Word 𝑉 ∧ ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)) ∧ 𝑝 = (𝑢‘1)))
63	62	exp31 425	. . . . . . . . . . . 12 ⊢ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} = 𝑢 → ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → ((𝑢 ∈ Word 𝑉 ∧ ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)) ∧ 𝑝 = (𝑢‘1)))))
64	63	eqcoms 2771	. . . . . . . . . . 11 ⊢ (𝑢 = {⟨0, 𝑃⟩, ⟨1, 𝑝⟩} → ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → ((𝑢 ∈ Word 𝑉 ∧ ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)) ∧ 𝑝 = (𝑢‘1)))))
65	64	impcom 413	. . . . . . . . . 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 3553	. . . . . . . . 9 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → ((({⟨0, 𝑃⟩, ⟨1, 𝑝⟩} ∈ Word 𝑉 ∧ (♯‘{⟨0, 𝑃⟩, ⟨1, 𝑝⟩}) = 2) ∧ (({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘0) = 𝑃 ∧ ({⟨0, 𝑃⟩, ⟨1, 𝑝⟩}‘1) = 𝑝)) → ∃𝑢((𝑢 ∈ Word 𝑉 ∧ ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)) ∧ 𝑝 = (𝑢‘1))))
67	13, 66	mpd 16	. . . . . . . 8 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → ∃𝑢((𝑢 ∈ Word 𝑉 ∧ ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)) ∧ 𝑝 = (𝑢‘1)))
68		fveqeq2 6925	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑢 → ((♯‘𝑤) = 2 ↔ (♯‘𝑢) = 2))
69		fveq1 6915	. . . . . . . . . . . . 13 ⊢ (𝑤 = 𝑢 → (𝑤‘0) = (𝑢‘0))
70	69	eqeq1d 2765	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑢 → ((𝑤‘0) = 𝑃 ↔ (𝑢‘0) = 𝑃))
71		fveq1 6915	. . . . . . . . . . . . . 14 ⊢ (𝑤 = 𝑢 → (𝑤‘1) = (𝑢‘1))
72	69, 71	preq12d 4704	. . . . . . . . . . . . 13 ⊢ (𝑤 = 𝑢 → {(𝑤‘0), (𝑤‘1)} = {(𝑢‘0), (𝑢‘1)})
73	72	eleq1d 2849	. . . . . . . . . . . 12 ⊢ (𝑤 = 𝑢 → ({(𝑤‘0), (𝑤‘1)} ∈ 𝑋 ↔ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋))
74	68, 70, 73	3anbi123d 1465	. . . . . . . . . . 11 ⊢ (𝑤 = 𝑢 → (((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋) ↔ ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)))
75	74	elrab 3648	. . . . . . . . . 10 ⊢ (𝑢 ∈ {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)} ↔ (𝑢 ∈ Word 𝑉 ∧ ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)))
76	75	anbi1i 636	. . . . . . . . 9 ⊢ ((𝑢 ∈ {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)} ∧ 𝑝 = (𝑢‘1)) ↔ ((𝑢 ∈ Word 𝑉 ∧ ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)) ∧ 𝑝 = (𝑢‘1)))
77	76	exbii 1881	. . . . . . . 8 ⊢ (∃𝑢(𝑢 ∈ {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)} ∧ 𝑝 = (𝑢‘1)) ↔ ∃𝑢((𝑢 ∈ Word 𝑉 ∧ ((♯‘𝑢) = 2 ∧ (𝑢‘0) = 𝑃 ∧ {(𝑢‘0), (𝑢‘1)} ∈ 𝑋)) ∧ 𝑝 = (𝑢‘1)))
78	67, 77	sylibr 237	. . . . . . 7 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → ∃𝑢(𝑢 ∈ {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)} ∧ 𝑝 = (𝑢‘1)))
79		df-rex 3091	. . . . . . 7 ⊢ (∃𝑢 ∈ {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)}𝑝 = (𝑢‘1) ↔ ∃𝑢(𝑢 ∈ {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)} ∧ 𝑝 = (𝑢‘1)))
80	78, 79	sylibr 237	. . . . . 6 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → ∃𝑢 ∈ {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)}𝑝 = (𝑢‘1))
81	1	rexeqi 3322	. . . . . 6 ⊢ (∃𝑢 ∈ 𝐷 𝑝 = (𝑢‘1) ↔ ∃𝑢 ∈ {𝑤 ∈ Word 𝑉 ∣ ((♯‘𝑤) = 2 ∧ (𝑤‘0) = 𝑃 ∧ {(𝑤‘0), (𝑤‘1)} ∈ 𝑋)}𝑝 = (𝑢‘1))
82	80, 81	sylibr 237	. . . . 5 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → ∃𝑢 ∈ 𝐷 𝑝 = (𝑢‘1))
83		fveq1 6915	. . . . . . . 8 ⊢ (𝑡 = 𝑢 → (𝑡‘1) = (𝑢‘1))
84		fvex 6929	. . . . . . . 8 ⊢ (𝑢‘1) ∈ V
85	83, 3, 84	fvmpt 7024	. . . . . . 7 ⊢ (𝑢 ∈ 𝐷 → (𝐹‘𝑢) = (𝑢‘1))
86	85	eqeq2d 2774	. . . . . 6 ⊢ (𝑢 ∈ 𝐷 → (𝑝 = (𝐹‘𝑢) ↔ 𝑝 = (𝑢‘1)))
87	86	rexbiia 3111	. . . . 5 ⊢ (∃𝑢 ∈ 𝐷 𝑝 = (𝐹‘𝑢) ↔ ∃𝑢 ∈ 𝐷 𝑝 = (𝑢‘1))
88	82, 87	sylibr 237	. . . 4 ⊢ ((𝑃 ∈ 𝑉 ∧ (𝑝 ∈ 𝑉 ∧ {𝑃, 𝑝} ∈ 𝑋)) → ∃𝑢 ∈ 𝐷 𝑝 = (𝐹‘𝑢))
89	8, 88	sylan2b 606	. . 3 ⊢ ((𝑃 ∈ 𝑉 ∧ 𝑝 ∈ 𝑅) → ∃𝑢 ∈ 𝐷 𝑝 = (𝐹‘𝑢))
90	89	ralrimiva 3158	. 2 ⊢ (𝑃 ∈ 𝑉 → ∀𝑝 ∈ 𝑅 ∃𝑢 ∈ 𝐷 𝑝 = (𝐹‘𝑢))
91		dffo3 7134	. 2 ⊢ (𝐹:𝐷⟶onto𝑅 ↔ (𝐹:𝐷⟶𝑅 ∧ ∀𝑝 ∈ 𝑅 ∃𝑢 ∈ 𝐷 𝑝 = (𝐹‘𝑢)))
92	5, 90, 91	sylanbrc 595	1 ⊢ (𝑃 ∈ 𝑉 → 𝐹:𝐷⟶onto𝑅)

Colors of variables: wff setvar class

This proof depends on syntax axioms: → wi 4 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∃wex 1812 ∈ wcel 2147 ∀wral 3080 ∃wrex 3090 {crab 3416 Vcvv 3454 {cpr 4590 ⟨cop 4840 ↦ cmpt 5192 ⟶wf 6562 ⟶ontowfo 6564 ‘cfv 6566 0cc0 11239 1c1 11240 2c2 12437 ♯chash 14515 Word cword 14699

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-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316

This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 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-nel 3066 df-ral 3081 df-rex 3091 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 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 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-oadd 8518 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-dju 10019 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-n0 12647 df-z 12734 df-uz 13006 df-fz 13680 df-fzo 13829 df-hash 14516 df-word 14700

This theorem is used by: wwlktovf1o 15155

W3C validator