Theorem pwfseqlem2 10672

Description: Lemma for pwfseq 10677. (Contributed by Mario Carneiro, 18-Nov-2014.) (Revised by AV, 18-Sep-2021.)

Hypotheses

Ref	Expression
pwfseqlem4.g	⊢ (𝜑 → 𝐺:𝒫 𝐴–1-1→∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛))
pwfseqlem4.x	⊢ (𝜑 → 𝑋 ⊆ 𝐴)
pwfseqlem4.h	⊢ (𝜑 → 𝐻:ω–1-1-onto→𝑋)
pwfseqlem4.ps	⊢ (𝜓 ↔ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) ∧ ω ≼ 𝑥))
pwfseqlem4.k	⊢ ((𝜑 ∧ 𝜓) → 𝐾:∪ 𝑛 ∈ ω (𝑥 ↑m 𝑛)–1-1→𝑥)
pwfseqlem4.d	⊢ 𝐷 = (𝐺‘{𝑤 ∈ 𝑥 ∣ ((◡𝐾‘𝑤) ∈ ran 𝐺 ∧ ¬ 𝑤 ∈ (◡𝐺‘(◡𝐾‘𝑤)))})
pwfseqlem4.f	⊢ 𝐹 = (𝑥 ∈ V, 𝑟 ∈ V ↦ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})))

Assertion

Ref	Expression
pwfseqlem2	⊢ ((𝑌 ∈ Fin ∧ 𝑅 ∈ 𝑉) → (𝑌𝐹𝑅) = (𝐻‘(card‘𝑌)))

Distinct variable groups:   𝑛,𝑟,𝑤,𝑥,𝑧   𝐷,𝑛,𝑧   𝑤,𝐺   𝑤,𝐾   𝐻,𝑟,𝑥,𝑧   𝜑,𝑛,𝑟,𝑥,𝑧   𝜓,𝑛,𝑧   𝐴,𝑛,𝑟,𝑥,𝑧   𝑉,𝑟,𝑥

Allowed substitution hints:   𝜑(𝑤)   𝜓(𝑥, 𝑤, 𝑟)   𝐴(𝑤)   𝐷(𝑥, 𝑤, 𝑟)   𝑅(𝑥, 𝑧, 𝑤, 𝑛, 𝑟)   𝐹(𝑥, 𝑧, 𝑤, 𝑛, 𝑟)   𝐺(𝑥, 𝑧, 𝑛, 𝑟)   𝐻(𝑤, 𝑛)   𝐾(𝑥, 𝑧, 𝑛, 𝑟)   𝑉(𝑧, 𝑤, 𝑛)   𝑋(𝑥, 𝑧, 𝑤, 𝑛, 𝑟)   𝑌(𝑥, 𝑧, 𝑤, 𝑛, 𝑟)

Proof of Theorem pwfseqlem2

Dummy variables 𝑎 𝑠 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		oveq1 7424	. . 3 ⊢ (𝑎 = 𝑌 → (𝑎𝐹𝑠) = (𝑌𝐹𝑠))
2		2fveq3 6887	. . 3 ⊢ (𝑎 = 𝑌 → (𝐻‘(card‘𝑎)) = (𝐻‘(card‘𝑌)))
3	1, 2	eqeq12d 2778	. 2 ⊢ (𝑎 = 𝑌 → ((𝑎𝐹𝑠) = (𝐻‘(card‘𝑎)) ↔ (𝑌𝐹𝑠) = (𝐻‘(card‘𝑌))))
4		oveq2 7425	. . 3 ⊢ (𝑠 = 𝑅 → (𝑌𝐹𝑠) = (𝑌𝐹𝑅))
5	4	eqeq1d 2764	. 2 ⊢ (𝑠 = 𝑅 → ((𝑌𝐹𝑠) = (𝐻‘(card‘𝑌)) ↔ (𝑌𝐹𝑅) = (𝐻‘(card‘𝑌))))
6		nfcv 2924	. . 3 ⊢ Ⅎ𝑥𝑎
7		nfcv 2924	. . 3 ⊢ Ⅎ𝑟𝑎
8		nfcv 2924	. . 3 ⊢ Ⅎ𝑟𝑠
9		pwfseqlem4.f	. . . . . 6 ⊢ 𝐹 = (𝑥 ∈ V, 𝑟 ∈ V ↦ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})))
10		nfmpo1 7497	. . . . . 6 ⊢ Ⅎ𝑥(𝑥 ∈ V, 𝑟 ∈ V ↦ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})))
11	9, 10	nfcxfr 2922	. . . . 5 ⊢ Ⅎ𝑥𝐹
12		nfcv 2924	. . . . 5 ⊢ Ⅎ𝑥𝑟
13	6, 11, 12	nfov 7447	. . . 4 ⊢ Ⅎ𝑥(𝑎𝐹𝑟)
14	13	nfeq1 2939	. . 3 ⊢ Ⅎ𝑥(𝑎𝐹𝑟) = (𝐻‘(card‘𝑎))
15		nfmpo2 7498	. . . . . 6 ⊢ Ⅎ𝑟(𝑥 ∈ V, 𝑟 ∈ V ↦ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})))
16	9, 15	nfcxfr 2922	. . . . 5 ⊢ Ⅎ𝑟𝐹
17	7, 16, 8	nfov 7447	. . . 4 ⊢ Ⅎ𝑟(𝑎𝐹𝑠)
18	17	nfeq1 2939	. . 3 ⊢ Ⅎ𝑟(𝑎𝐹𝑠) = (𝐻‘(card‘𝑎))
19		oveq1 7424	. . . 4 ⊢ (𝑥 = 𝑎 → (𝑥𝐹𝑟) = (𝑎𝐹𝑟))
20		2fveq3 6887	. . . 4 ⊢ (𝑥 = 𝑎 → (𝐻‘(card‘𝑥)) = (𝐻‘(card‘𝑎)))
21	19, 20	eqeq12d 2778	. . 3 ⊢ (𝑥 = 𝑎 → ((𝑥𝐹𝑟) = (𝐻‘(card‘𝑥)) ↔ (𝑎𝐹𝑟) = (𝐻‘(card‘𝑎))))
22		oveq2 7425	. . . 4 ⊢ (𝑟 = 𝑠 → (𝑎𝐹𝑟) = (𝑎𝐹𝑠))
23	22	eqeq1d 2764	. . 3 ⊢ (𝑟 = 𝑠 → ((𝑎𝐹𝑟) = (𝐻‘(card‘𝑎)) ↔ (𝑎𝐹𝑠) = (𝐻‘(card‘𝑎))))
24		vex 3457	. . . . . 6 ⊢ 𝑥 ∈ V
25		vex 3457	. . . . . 6 ⊢ 𝑟 ∈ V
26		fvex 6895	. . . . . . 7 ⊢ (𝐻‘(card‘𝑥)) ∈ V
27		fvex 6895	. . . . . . 7 ⊢ (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}) ∈ V
28	26, 27	ifex 4536	. . . . . 6 ⊢ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})) ∈ V
29	9	ovmpt4g 7564	. . . . . 6 ⊢ ((𝑥 ∈ V ∧ 𝑟 ∈ V ∧ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})) ∈ V) → (𝑥𝐹𝑟) = if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})))
30	24, 25, 28, 29	mp3an 1490	. . . . 5 ⊢ (𝑥𝐹𝑟) = if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}))
31		iftrue 4491	. . . . 5 ⊢ (𝑥 ∈ Fin → if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})) = (𝐻‘(card‘𝑥)))
32	30, 31	eqtrid 2809	. . . 4 ⊢ (𝑥 ∈ Fin → (𝑥𝐹𝑟) = (𝐻‘(card‘𝑥)))
33	32	adantr 486	. . 3 ⊢ ((𝑥 ∈ Fin ∧ 𝑟 ∈ 𝑉) → (𝑥𝐹𝑟) = (𝐻‘(card‘𝑥)))
34	6, 7, 8, 14, 18, 21, 23, 33	vtocl2gaf 3541	. 2 ⊢ ((𝑎 ∈ Fin ∧ 𝑠 ∈ 𝑉) → (𝑎𝐹𝑠) = (𝐻‘(card‘𝑎)))
35	3, 5, 34	vtocl2ga 3540	1 ⊢ ((𝑌 ∈ Fin ∧ 𝑅 ∈ 𝑉) → (𝑌𝐹𝑅) = (𝐻‘(card‘𝑌)))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  {crab 3414  Vcvv 3453   ⊆ wss 3902  ifcif 4485  𝒫 cpw 4560  ∩ cint 4910  ∪ ciun 4954   class class class wbr 5107   We wwe 5611   × cxp 5657  ^◡ccnv 5658  ran crn 5660  –1-1→wf1 6534  –1-1-onto→wf1o 6536  ‘cfv 6537  (class class class)co 7417   ∈ cmpo 7419  ωcom 7866   ↑_m cmap 8830   ≼ cdom 8954  Fincfn 8956  cardccrd 9944

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 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-iota 6493  df-fun 6539  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422

This theorem is used by:  pwfseqlem4a  10674  pwfseqlem4  10675