Theorem unxpdomlem2 9228

Description: Lemma for unxpdom 9230. (Contributed by Mario Carneiro, 13-Jan-2013.)

Hypotheses

Ref	Expression
unxpdomlem1.1	⊢ 𝐹 = (𝑥 ∈ (𝑎 ∪ 𝑏) ↦ 𝐺)
unxpdomlem1.2	⊢ 𝐺 = if(𝑥 ∈ 𝑎, ⟨𝑥, if(𝑥 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑥 = 𝑡, 𝑛, 𝑚), 𝑥⟩)
unxpdomlem2.1	⊢ (𝜑 → 𝑤 ∈ (𝑎 ∪ 𝑏))
unxpdomlem2.2	⊢ (𝜑 → ¬ 𝑚 = 𝑛)
unxpdomlem2.3	⊢ (𝜑 → ¬ 𝑠 = 𝑡)

Assertion

Ref	Expression
unxpdomlem2	⊢ ((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) → ¬ (𝐹‘𝑧) = (𝐹‘𝑤))

Distinct variable groups:   𝑤,𝐹,𝑧   𝑎,𝑏,𝑚,𝑛,𝑠,𝑡,𝑤,𝑥,𝑧

Allowed substitution hints:   𝜑(𝑥, 𝑧, 𝑤, 𝑡, 𝑚, 𝑛, 𝑠, 𝑎, 𝑏)   𝐹(𝑥, 𝑡, 𝑚, 𝑛, 𝑠, 𝑎, 𝑏)   𝐺(𝑥, 𝑧, 𝑤, 𝑡, 𝑚, 𝑛, 𝑠, 𝑎, 𝑏)

Proof of Theorem unxpdomlem2

Step	Hyp	Ref	Expression
1		unxpdomlem2.3	. . 3 ⊢ (𝜑 → ¬ 𝑠 = 𝑡)
2	1	adantr 486	. 2 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) → ¬ 𝑠 = 𝑡)
3		elun1 4128	. . . . . . . . . 10 ⊢ (𝑧 ∈ 𝑎 → 𝑧 ∈ (𝑎 ∪ 𝑏))
4	3	ad2antrl 741	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) → 𝑧 ∈ (𝑎 ∪ 𝑏))
5		unxpdomlem1.1	. . . . . . . . . 10 ⊢ 𝐹 = (𝑥 ∈ (𝑎 ∪ 𝑏) ↦ 𝐺)
6		unxpdomlem1.2	. . . . . . . . . 10 ⊢ 𝐺 = if(𝑥 ∈ 𝑎, ⟨𝑥, if(𝑥 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑥 = 𝑡, 𝑛, 𝑚), 𝑥⟩)
7	5, 6	unxpdomlem1 9227	. . . . . . . . 9 ⊢ (𝑧 ∈ (𝑎 ∪ 𝑏) → (𝐹‘𝑧) = if(𝑧 ∈ 𝑎, ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧⟩))
8	4, 7	syl 18	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) → (𝐹‘𝑧) = if(𝑧 ∈ 𝑎, ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧⟩))
9		iftrue 4488	. . . . . . . . 9 ⊢ (𝑧 ∈ 𝑎 → if(𝑧 ∈ 𝑎, ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧⟩) = ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩)
10	9	ad2antrl 741	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) → if(𝑧 ∈ 𝑎, ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑧 = 𝑡, 𝑛, 𝑚), 𝑧⟩) = ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩)
11	8, 10	eqtrd 2795	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) → (𝐹‘𝑧) = ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩)
12		unxpdomlem2.1	. . . . . . . . . 10 ⊢ (𝜑 → 𝑤 ∈ (𝑎 ∪ 𝑏))
13	12	adantr 486	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) → 𝑤 ∈ (𝑎 ∪ 𝑏))
14	5, 6	unxpdomlem1 9227	. . . . . . . . 9 ⊢ (𝑤 ∈ (𝑎 ∪ 𝑏) → (𝐹‘𝑤) = if(𝑤 ∈ 𝑎, ⟨𝑤, if(𝑤 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑤 = 𝑡, 𝑛, 𝑚), 𝑤⟩))
15	13, 14	syl 18	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) → (𝐹‘𝑤) = if(𝑤 ∈ 𝑎, ⟨𝑤, if(𝑤 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑤 = 𝑡, 𝑛, 𝑚), 𝑤⟩))
16		iffalse 4491	. . . . . . . . 9 ⊢ (¬ 𝑤 ∈ 𝑎 → if(𝑤 ∈ 𝑎, ⟨𝑤, if(𝑤 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑤 = 𝑡, 𝑛, 𝑚), 𝑤⟩) = ⟨if(𝑤 = 𝑡, 𝑛, 𝑚), 𝑤⟩)
17	16	ad2antll 742	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) → if(𝑤 ∈ 𝑎, ⟨𝑤, if(𝑤 = 𝑚, 𝑡, 𝑠)⟩, ⟨if(𝑤 = 𝑡, 𝑛, 𝑚), 𝑤⟩) = ⟨if(𝑤 = 𝑡, 𝑛, 𝑚), 𝑤⟩)
18	15, 17	eqtrd 2795	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) → (𝐹‘𝑤) = ⟨if(𝑤 = 𝑡, 𝑛, 𝑚), 𝑤⟩)
19	11, 18	eqeq12d 2776	. . . . . 6 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) → ((𝐹‘𝑧) = (𝐹‘𝑤) ↔ ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩ = ⟨if(𝑤 = 𝑡, 𝑛, 𝑚), 𝑤⟩))
20	19	biimpa 482	. . . . 5 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) ∧ (𝐹‘𝑧) = (𝐹‘𝑤)) → ⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩ = ⟨if(𝑤 = 𝑡, 𝑛, 𝑚), 𝑤⟩)
21		vex 3454	. . . . . 6 ⊢ 𝑧 ∈ V
22		vex 3454	. . . . . . 7 ⊢ 𝑡 ∈ V
23		vex 3454	. . . . . . 7 ⊢ 𝑠 ∈ V
24	22, 23	ifex 4533	. . . . . 6 ⊢ if(𝑧 = 𝑚, 𝑡, 𝑠) ∈ V
25	21, 24	opth 5452	. . . . 5 ⊢ (⟨𝑧, if(𝑧 = 𝑚, 𝑡, 𝑠)⟩ = ⟨if(𝑤 = 𝑡, 𝑛, 𝑚), 𝑤⟩ ↔ (𝑧 = if(𝑤 = 𝑡, 𝑛, 𝑚) ∧ if(𝑧 = 𝑚, 𝑡, 𝑠) = 𝑤))
26	20, 25	sylib 221	. . . 4 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) ∧ (𝐹‘𝑧) = (𝐹‘𝑤)) → (𝑧 = if(𝑤 = 𝑡, 𝑛, 𝑚) ∧ if(𝑧 = 𝑚, 𝑡, 𝑠) = 𝑤))
27	26	simprd 501	. . 3 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) ∧ (𝐹‘𝑧) = (𝐹‘𝑤)) → if(𝑧 = 𝑚, 𝑡, 𝑠) = 𝑤)
28		iftrue 4488	. . . . . . 7 ⊢ (𝑧 = 𝑚 → if(𝑧 = 𝑚, 𝑡, 𝑠) = 𝑡)
29	27	eqeq1d 2762	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) ∧ (𝐹‘𝑧) = (𝐹‘𝑤)) → (if(𝑧 = 𝑚, 𝑡, 𝑠) = 𝑡 ↔ 𝑤 = 𝑡))
30	28, 29	imbitrid 247	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) ∧ (𝐹‘𝑧) = (𝐹‘𝑤)) → (𝑧 = 𝑚 → 𝑤 = 𝑡))
31		iftrue 4488	. . . . . . 7 ⊢ (𝑤 = 𝑡 → if(𝑤 = 𝑡, 𝑛, 𝑚) = 𝑛)
32	26	simpld 500	. . . . . . . 8 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) ∧ (𝐹‘𝑧) = (𝐹‘𝑤)) → 𝑧 = if(𝑤 = 𝑡, 𝑛, 𝑚))
33	32	eqeq1d 2762	. . . . . . 7 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) ∧ (𝐹‘𝑧) = (𝐹‘𝑤)) → (𝑧 = 𝑛 ↔ if(𝑤 = 𝑡, 𝑛, 𝑚) = 𝑛))
34	31, 33	imbitrrid 249	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) ∧ (𝐹‘𝑧) = (𝐹‘𝑤)) → (𝑤 = 𝑡 → 𝑧 = 𝑛))
35	30, 34	syld 48	. . . . 5 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) ∧ (𝐹‘𝑧) = (𝐹‘𝑤)) → (𝑧 = 𝑚 → 𝑧 = 𝑛))
36		unxpdomlem2.2	. . . . . . 7 ⊢ (𝜑 → ¬ 𝑚 = 𝑛)
37	36	ad2antrr 739	. . . . . 6 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) ∧ (𝐹‘𝑧) = (𝐹‘𝑤)) → ¬ 𝑚 = 𝑛)
38		equequ1 2058	. . . . . . 7 ⊢ (𝑧 = 𝑚 → (𝑧 = 𝑛 ↔ 𝑚 = 𝑛))
39	38	notbid 321	. . . . . 6 ⊢ (𝑧 = 𝑚 → (¬ 𝑧 = 𝑛 ↔ ¬ 𝑚 = 𝑛))
40	37, 39	syl5ibrcom 250	. . . . 5 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) ∧ (𝐹‘𝑧) = (𝐹‘𝑤)) → (𝑧 = 𝑚 → ¬ 𝑧 = 𝑛))
41	35, 40	pm2.65d 199	. . . 4 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) ∧ (𝐹‘𝑧) = (𝐹‘𝑤)) → ¬ 𝑧 = 𝑚)
42	41	iffalsed 4493	. . 3 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) ∧ (𝐹‘𝑧) = (𝐹‘𝑤)) → if(𝑧 = 𝑚, 𝑡, 𝑠) = 𝑠)
43		iffalse 4491	. . . . 5 ⊢ (¬ 𝑤 = 𝑡 → if(𝑤 = 𝑡, 𝑛, 𝑚) = 𝑚)
44	32	eqeq1d 2762	. . . . 5 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) ∧ (𝐹‘𝑧) = (𝐹‘𝑤)) → (𝑧 = 𝑚 ↔ if(𝑤 = 𝑡, 𝑛, 𝑚) = 𝑚))
45	43, 44	imbitrrid 249	. . . 4 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) ∧ (𝐹‘𝑧) = (𝐹‘𝑤)) → (¬ 𝑤 = 𝑡 → 𝑧 = 𝑚))
46	41, 45	mt3d 149	. . 3 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) ∧ (𝐹‘𝑧) = (𝐹‘𝑤)) → 𝑤 = 𝑡)
47	27, 42, 46	3eqtr3d 2803	. 2 ⊢ (((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) ∧ (𝐹‘𝑧) = (𝐹‘𝑤)) → 𝑠 = 𝑡)
48	2, 47	mtand 828	1 ⊢ ((𝜑 ∧ (𝑧 ∈ 𝑎 ∧ ¬ 𝑤 ∈ 𝑎)) → ¬ (𝐹‘𝑧) = (𝐹‘𝑤))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ∪ cun 3897  ifcif 4482  ⟨cop 4590   ↦ cmpt 5186  ‘cfv 6533

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-10 2178  ax-11 2194  ax-12 2213  ax-ext 2732  ax-sep 5251  ax-pr 5398

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 2100  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  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-mpt 5187  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-iota 6489  df-fun 6535  df-fv 6541

This theorem is used by:  unxpdomlem3  9229