Theorem pwfseqlem2 10083

Description: Lemma for pwfseq 10088. (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 7165	. . 3 ⊢ (𝑎 = 𝑌 → (𝑎𝐹𝑠) = (𝑌𝐹𝑠))
2		2fveq3 6677	. . 3 ⊢ (𝑎 = 𝑌 → (𝐻‘(card‘𝑎)) = (𝐻‘(card‘𝑌)))
3	1, 2	eqeq12d 2839	. 2 ⊢ (𝑎 = 𝑌 → ((𝑎𝐹𝑠) = (𝐻‘(card‘𝑎)) ↔ (𝑌𝐹𝑠) = (𝐻‘(card‘𝑌))))
4		oveq2 7166	. . 3 ⊢ (𝑠 = 𝑅 → (𝑌𝐹𝑠) = (𝑌𝐹𝑅))
5	4	eqeq1d 2825	. 2 ⊢ (𝑠 = 𝑅 → ((𝑌𝐹𝑠) = (𝐻‘(card‘𝑌)) ↔ (𝑌𝐹𝑅) = (𝐻‘(card‘𝑌))))
6		nfcv 2979	. . 3 ⊢ Ⅎ𝑥𝑎
7		nfcv 2979	. . 3 ⊢ Ⅎ𝑟𝑎
8		nfcv 2979	. . 3 ⊢ Ⅎ𝑟𝑠
9		pwfseqlem4.f	. . . . . 6 ⊢ 𝐹 = (𝑥 ∈ V, 𝑟 ∈ V ↦ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})))
10		nfmpo1 7236	. . . . . 6 ⊢ Ⅎ𝑥(𝑥 ∈ V, 𝑟 ∈ V ↦ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})))
11	9, 10	nfcxfr 2977	. . . . 5 ⊢ Ⅎ𝑥𝐹
12		nfcv 2979	. . . . 5 ⊢ Ⅎ𝑥𝑟
13	6, 11, 12	nfov 7188	. . . 4 ⊢ Ⅎ𝑥(𝑎𝐹𝑟)
14	13	nfeq1 2995	. . 3 ⊢ Ⅎ𝑥(𝑎𝐹𝑟) = (𝐻‘(card‘𝑎))
15		nfmpo2 7237	. . . . . 6 ⊢ Ⅎ𝑟(𝑥 ∈ V, 𝑟 ∈ V ↦ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})))
16	9, 15	nfcxfr 2977	. . . . 5 ⊢ Ⅎ𝑟𝐹
17	7, 16, 8	nfov 7188	. . . 4 ⊢ Ⅎ𝑟(𝑎𝐹𝑠)
18	17	nfeq1 2995	. . 3 ⊢ Ⅎ𝑟(𝑎𝐹𝑠) = (𝐻‘(card‘𝑎))
19		oveq1 7165	. . . 4 ⊢ (𝑥 = 𝑎 → (𝑥𝐹𝑟) = (𝑎𝐹𝑟))
20		2fveq3 6677	. . . 4 ⊢ (𝑥 = 𝑎 → (𝐻‘(card‘𝑥)) = (𝐻‘(card‘𝑎)))
21	19, 20	eqeq12d 2839	. . 3 ⊢ (𝑥 = 𝑎 → ((𝑥𝐹𝑟) = (𝐻‘(card‘𝑥)) ↔ (𝑎𝐹𝑟) = (𝐻‘(card‘𝑎))))
22		oveq2 7166	. . . 4 ⊢ (𝑟 = 𝑠 → (𝑎𝐹𝑟) = (𝑎𝐹𝑠))
23	22	eqeq1d 2825	. . 3 ⊢ (𝑟 = 𝑠 → ((𝑎𝐹𝑟) = (𝐻‘(card‘𝑎)) ↔ (𝑎𝐹𝑠) = (𝐻‘(card‘𝑎))))
24		vex 3499	. . . . . 6 ⊢ 𝑥 ∈ V
25		vex 3499	. . . . . 6 ⊢ 𝑟 ∈ V
26		fvex 6685	. . . . . . 7 ⊢ (𝐻‘(card‘𝑥)) ∈ V
27		fvex 6685	. . . . . . 7 ⊢ (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}) ∈ V
28	26, 27	ifex 4517	. . . . . 6 ⊢ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})) ∈ V
29	9	ovmpt4g 7299	. . . . . 6 ⊢ ((𝑥 ∈ V ∧ 𝑟 ∈ V ∧ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})) ∈ V) → (𝑥𝐹𝑟) = if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})))
30	24, 25, 28, 29	mp3an 1457	. . . . 5 ⊢ (𝑥𝐹𝑟) = if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}))
31		iftrue 4475	. . . . 5 ⊢ (𝑥 ∈ Fin → if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})) = (𝐻‘(card‘𝑥)))
32	30, 31	syl5eq 2870	. . . 4 ⊢ (𝑥 ∈ Fin → (𝑥𝐹𝑟) = (𝐻‘(card‘𝑥)))
33	32	adantr 483	. . 3 ⊢ ((𝑥 ∈ Fin ∧ 𝑟 ∈ 𝑉) → (𝑥𝐹𝑟) = (𝐻‘(card‘𝑥)))
34	6, 7, 8, 14, 18, 21, 23, 33	vtocl2gaf 3578	. 2 ⊢ ((𝑎 ∈ Fin ∧ 𝑠 ∈ 𝑉) → (𝑎𝐹𝑠) = (𝐻‘(card‘𝑎)))
35	3, 5, 34	vtocl2ga 3577	1 ⊢ ((𝑌 ∈ Fin ∧ 𝑅 ∈ 𝑉) → (𝑌𝐹𝑅) = (𝐻‘(card‘𝑌)))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   ∧ w3a 1083   = wceq 1537   ∈ wcel 2114  {crab 3144  Vcvv 3496   ⊆ wss 3938  ifcif 4469  𝒫 cpw 4541  ∩ cint 4878  ∪ ciun 4921   class class class wbr 5068   We wwe 5515   × cxp 5555  ^◡ccnv 5556  ran crn 5558  –1-1→wf1 6354  –1-1-onto→wf1o 6356  ‘cfv 6357  (class class class)co 7158   ∈ cmpo 7160  ωcom 7582   ↑_m cmap 8408   ≼ cdom 8509  Fincfn 8511  cardccrd 9366

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pr 5332

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-sbc 3775  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-br 5069  df-opab 5131  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-iota 6316  df-fun 6359  df-fv 6365  df-ov 7161  df-oprab 7162  df-mpo 7163

This theorem is referenced by:  pwfseqlem4a  10085  pwfseqlem4  10086