Theorem finxpreclem3 38296

Description: Lemma for ↑↑ recursion theorems. (Contributed by ML, 20-Oct-2020.)

Hypothesis

Ref	Expression
finxpreclem3.1	⊢ 𝐹 = (𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1o ∧ 𝑥 ∈ 𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑥)⟩, ⟨𝑛, 𝑥⟩)))

Assertion

Ref	Expression
finxpreclem3	⊢ (((𝑁 ∈ ω ∧ 2o ⊆ 𝑁) ∧ 𝑋 ∈ (V × 𝑈)) → ⟨∪ 𝑁, (1st ‘𝑋)⟩ = (𝐹‘⟨𝑁, 𝑋⟩))

Distinct variable groups:   𝑛,𝑁,𝑥   𝑈,𝑛,𝑥   𝑛,𝑋,𝑥

Allowed substitution hints:   𝐹(𝑥, 𝑛)

Proof of Theorem finxpreclem3

Step	Hyp	Ref	Expression
1		finxpreclem3.1	. . . 4 ⊢ 𝐹 = (𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1o ∧ 𝑥 ∈ 𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑥)⟩, ⟨𝑛, 𝑥⟩)))
2	1	a1i 11	. . 3 ⊢ (((𝑁 ∈ ω ∧ 2o ⊆ 𝑁) ∧ 𝑋 ∈ (V × 𝑈)) → 𝐹 = (𝑛 ∈ ω, 𝑥 ∈ V ↦ if((𝑛 = 1o ∧ 𝑥 ∈ 𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑥)⟩, ⟨𝑛, 𝑥⟩))))
3		eqeq1 2765	. . . . . . 7 ⊢ (𝑛 = 𝑁 → (𝑛 = 1o ↔ 𝑁 = 1o))
4		eleq1 2849	. . . . . . 7 ⊢ (𝑥 = 𝑋 → (𝑥 ∈ 𝑈 ↔ 𝑋 ∈ 𝑈))
5	3, 4	bi2anan9 650	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → ((𝑛 = 1o ∧ 𝑥 ∈ 𝑈) ↔ (𝑁 = 1o ∧ 𝑋 ∈ 𝑈)))
6		eleq1 2849	. . . . . . . 8 ⊢ (𝑥 = 𝑋 → (𝑥 ∈ (V × 𝑈) ↔ 𝑋 ∈ (V × 𝑈)))
7	6	adantl 487	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → (𝑥 ∈ (V × 𝑈) ↔ 𝑋 ∈ (V × 𝑈)))
8		unieq 4878	. . . . . . . . 9 ⊢ (𝑛 = 𝑁 → ∪ 𝑛 = ∪ 𝑁)
9	8	adantr 486	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → ∪ 𝑛 = ∪ 𝑁)
10		fveq2 6883	. . . . . . . . 9 ⊢ (𝑥 = 𝑋 → (1st ‘𝑥) = (1st ‘𝑋))
11	10	adantl 487	. . . . . . . 8 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → (1st ‘𝑥) = (1st ‘𝑋))
12	9, 11	opeq12d 4841	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → ⟨∪ 𝑛, (1st ‘𝑥)⟩ = ⟨∪ 𝑁, (1st ‘𝑋)⟩)
13		opeq12 4835	. . . . . . 7 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → ⟨𝑛, 𝑥⟩ = ⟨𝑁, 𝑋⟩)
14	7, 12, 13	ifbieq12d 4511	. . . . . 6 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → if(𝑥 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑥)⟩, ⟨𝑛, 𝑥⟩) = if(𝑋 ∈ (V × 𝑈), ⟨∪ 𝑁, (1st ‘𝑋)⟩, ⟨𝑁, 𝑋⟩))
15	5, 14	ifbieq2d 4509	. . . . 5 ⊢ ((𝑛 = 𝑁 ∧ 𝑥 = 𝑋) → if((𝑛 = 1o ∧ 𝑥 ∈ 𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑥)⟩, ⟨𝑛, 𝑥⟩)) = if((𝑁 = 1o ∧ 𝑋 ∈ 𝑈), ∅, if(𝑋 ∈ (V × 𝑈), ⟨∪ 𝑁, (1st ‘𝑋)⟩, ⟨𝑁, 𝑋⟩)))
16		sssucid 6444	. . . . . . . . . . . . 13 ⊢ 1o ⊆ suc 1o
17		df-2o 8470	. . . . . . . . . . . . 13 ⊢ 2o = suc 1o
18	16, 17	sseqtrri 3980	. . . . . . . . . . . 12 ⊢ 1o ⊆ 2o
19		1on 8482	. . . . . . . . . . . . . 14 ⊢ 1o ∈ On
20	17, 19	sucneqoni 38269	. . . . . . . . . . . . 13 ⊢ 2o ≠ 1o
21	20	necomi 3010	. . . . . . . . . . . 12 ⊢ 1o ≠ 2o
22		df-pss 3919	. . . . . . . . . . . 12 ⊢ (1o ⊊ 2o ↔ (1o ⊆ 2o ∧ 1o ≠ 2o))
23	18, 21, 22	mpbir2an 724	. . . . . . . . . . 11 ⊢ 1o ⊊ 2o
24		ssnpss 4055	. . . . . . . . . . 11 ⊢ (2o ⊆ 1o → ¬ 1o ⊊ 2o)
25	23, 24	mt2 203	. . . . . . . . . 10 ⊢ ¬ 2o ⊆ 1o
26		sseq2 3957	. . . . . . . . . 10 ⊢ (𝑁 = 1o → (2o ⊆ 𝑁 ↔ 2o ⊆ 1o))
27	25, 26	mtbiri 330	. . . . . . . . 9 ⊢ (𝑁 = 1o → ¬ 2o ⊆ 𝑁)
28	27	con2i 140	. . . . . . . 8 ⊢ (2o ⊆ 𝑁 → ¬ 𝑁 = 1o)
29	28	intnanrd 495	. . . . . . 7 ⊢ (2o ⊆ 𝑁 → ¬ (𝑁 = 1o ∧ 𝑋 ∈ 𝑈))
30	29	iffalsed 4493	. . . . . 6 ⊢ (2o ⊆ 𝑁 → if((𝑁 = 1o ∧ 𝑋 ∈ 𝑈), ∅, if(𝑋 ∈ (V × 𝑈), ⟨∪ 𝑁, (1st ‘𝑋)⟩, ⟨𝑁, 𝑋⟩)) = if(𝑋 ∈ (V × 𝑈), ⟨∪ 𝑁, (1st ‘𝑋)⟩, ⟨𝑁, 𝑋⟩))
31		iftrue 4488	. . . . . 6 ⊢ (𝑋 ∈ (V × 𝑈) → if(𝑋 ∈ (V × 𝑈), ⟨∪ 𝑁, (1st ‘𝑋)⟩, ⟨𝑁, 𝑋⟩) = ⟨∪ 𝑁, (1st ‘𝑋)⟩)
32	30, 31	sylan9eq 2816	. . . . 5 ⊢ ((2o ⊆ 𝑁 ∧ 𝑋 ∈ (V × 𝑈)) → if((𝑁 = 1o ∧ 𝑋 ∈ 𝑈), ∅, if(𝑋 ∈ (V × 𝑈), ⟨∪ 𝑁, (1st ‘𝑋)⟩, ⟨𝑁, 𝑋⟩)) = ⟨∪ 𝑁, (1st ‘𝑋)⟩)
33	15, 32	sylan9eqr 2818	. . . 4 ⊢ (((2o ⊆ 𝑁 ∧ 𝑋 ∈ (V × 𝑈)) ∧ (𝑛 = 𝑁 ∧ 𝑥 = 𝑋)) → if((𝑛 = 1o ∧ 𝑥 ∈ 𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑥)⟩, ⟨𝑛, 𝑥⟩)) = ⟨∪ 𝑁, (1st ‘𝑋)⟩)
34	33	adantlll 731	. . 3 ⊢ ((((𝑁 ∈ ω ∧ 2o ⊆ 𝑁) ∧ 𝑋 ∈ (V × 𝑈)) ∧ (𝑛 = 𝑁 ∧ 𝑥 = 𝑋)) → if((𝑛 = 1o ∧ 𝑥 ∈ 𝑈), ∅, if(𝑥 ∈ (V × 𝑈), ⟨∪ 𝑛, (1st ‘𝑥)⟩, ⟨𝑛, 𝑥⟩)) = ⟨∪ 𝑁, (1st ‘𝑋)⟩)
35		simpll 779	. . 3 ⊢ (((𝑁 ∈ ω ∧ 2o ⊆ 𝑁) ∧ 𝑋 ∈ (V × 𝑈)) → 𝑁 ∈ ω)
36		elex 3472	. . . 4 ⊢ (𝑋 ∈ (V × 𝑈) → 𝑋 ∈ V)
37	36	adantl 487	. . 3 ⊢ (((𝑁 ∈ ω ∧ 2o ⊆ 𝑁) ∧ 𝑋 ∈ (V × 𝑈)) → 𝑋 ∈ V)
38		opex 5432	. . . 4 ⊢ ⟨∪ 𝑁, (1st ‘𝑋)⟩ ∈ V
39	38	a1i 11	. . 3 ⊢ (((𝑁 ∈ ω ∧ 2o ⊆ 𝑁) ∧ 𝑋 ∈ (V × 𝑈)) → ⟨∪ 𝑁, (1st ‘𝑋)⟩ ∈ V)
40	2, 34, 35, 37, 39	ovmpod 7570	. 2 ⊢ (((𝑁 ∈ ω ∧ 2o ⊆ 𝑁) ∧ 𝑋 ∈ (V × 𝑈)) → (𝑁𝐹𝑋) = ⟨∪ 𝑁, (1st ‘𝑋)⟩)
41		df-ov 7421	. 2 ⊢ (𝑁𝐹𝑋) = (𝐹‘⟨𝑁, 𝑋⟩)
42	40, 41	eqtr3di 2811	1 ⊢ (((𝑁 ∈ ω ∧ 2o ⊆ 𝑁) ∧ 𝑋 ∈ (V × 𝑈)) → ⟨∪ 𝑁, (1st ‘𝑋)⟩ = (𝐹‘⟨𝑁, 𝑋⟩))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145   ≠ wne 2956  Vcvv 3451   ⊆ wss 3899   ⊊ wpss 3900  ∅c0 4279  ifcif 4482  ⟨cop 4590  ∪ cuni 4867   × cxp 5649  suc csuc 6363  ‘cfv 6537  (class class class)co 7418   ∈ cmpo 7420  ωcom 7875  1^st c1st 7997  1_oc1o 8462  2_oc2o 8463

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 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7749

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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-sbc 3740  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-tr 5213  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-ord 6364  df-on 6365  df-suc 6367  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7421  df-oprab 7422  df-mpo 7423  df-1o 8469  df-2o 8470

This theorem is used by:  finxpreclem4  38297