Theorem pwfseqlem3 10746

Description: Lemma for pwfseq 10750. Using the construction 𝐷 from pwfseqlem1 10744, produce a function 𝐹 that maps any well-ordered infinite set to an element outside the set. (Contributed by Mario Carneiro, 31-May-2015.)

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
pwfseqlem3	⊢ ((𝜑 ∧ 𝜓) → (𝑥𝐹𝑟) ∈ (𝐴 ∖ 𝑥))

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

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

Proof of Theorem pwfseqlem3

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		vex 3454	. . . 4 ⊢ 𝑥 ∈ V
2		vex 3454	. . . 4 ⊢ 𝑟 ∈ V
3		fvex 6898	. . . . 5 ⊢ (𝐻‘(card‘𝑥)) ∈ V
4		fvex 6898	. . . . 5 ⊢ (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}) ∈ V
5	3, 4	ifex 4532	. . . 4 ⊢ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})) ∈ V
6		pwfseqlem4.f	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ V, 𝑟 ∈ V ↦ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})))
7	6	ovmpt4g 7567	. . . 4 ⊢ ((𝑥 ∈ V ∧ 𝑟 ∈ V ∧ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})) ∈ V) → (𝑥𝐹𝑟) = if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})))
8	1, 2, 5, 7	mp3an 1490	. . 3 ⊢ (𝑥𝐹𝑟) = if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}))
9		pwfseqlem4.ps	. . . . . . . 8 ⊢ (𝜓 ↔ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) ∧ ω ≼ 𝑥))
10	9	simprbi 503	. . . . . . 7 ⊢ (𝜓 → ω ≼ 𝑥)
11	10	adantl 487	. . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → ω ≼ 𝑥)
12		domnsym 9123	. . . . . 6 ⊢ (ω ≼ 𝑥 → ¬ 𝑥 ≺ ω)
13	11, 12	syl 18	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → ¬ 𝑥 ≺ ω)
14		isfinite 9654	. . . . 5 ⊢ (𝑥 ∈ Fin ↔ 𝑥 ≺ ω)
15	13, 14	sylnibr 332	. . . 4 ⊢ ((𝜑 ∧ 𝜓) → ¬ 𝑥 ∈ Fin)
16	15	iffalsed 4492	. . 3 ⊢ ((𝜑 ∧ 𝜓) → if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})) = (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}))
17	8, 16	eqtrid 2807	. 2 ⊢ ((𝜑 ∧ 𝜓) → (𝑥𝐹𝑟) = (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}))
18		pwfseqlem4.g	. . . . . . 7 ⊢ (𝜑 → 𝐺:𝒫 𝐴–1-1→∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛))
19		pwfseqlem4.x	. . . . . . 7 ⊢ (𝜑 → 𝑋 ⊆ 𝐴)
20		pwfseqlem4.h	. . . . . . 7 ⊢ (𝜑 → 𝐻:ω–1-1-onto→𝑋)
21		pwfseqlem4.k	. . . . . . 7 ⊢ ((𝜑 ∧ 𝜓) → 𝐾:∪ 𝑛 ∈ ω (𝑥 ↑m 𝑛)–1-1→𝑥)
22		pwfseqlem4.d	. . . . . . 7 ⊢ 𝐷 = (𝐺‘{𝑤 ∈ 𝑥 ∣ ((◡𝐾‘𝑤) ∈ ran 𝐺 ∧ ¬ 𝑤 ∈ (◡𝐺‘(◡𝐾‘𝑤)))})
23	18, 19, 20, 9, 21, 22	pwfseqlem1 10744	. . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → 𝐷 ∈ (∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ∖ ∪ 𝑛 ∈ ω (𝑥 ↑m 𝑛)))
24		eldif 4049	. . . . . 6 ⊢ (𝐷 ∈ (∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ∖ ∪ 𝑛 ∈ ω (𝑥 ↑m 𝑛)) ↔ (𝐷 ∈ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ∧ ¬ 𝐷 ∈ ∪ 𝑛 ∈ ω (𝑥 ↑m 𝑛)))
25	23, 24	sylib 221	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → (𝐷 ∈ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ∧ ¬ 𝐷 ∈ ∪ 𝑛 ∈ ω (𝑥 ↑m 𝑛)))
26	25	simpld 500	. . . 4 ⊢ ((𝜑 ∧ 𝜓) → 𝐷 ∈ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛))
27		eliun 4954	. . . 4 ⊢ (𝐷 ∈ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ↔ ∃𝑛 ∈ ω 𝐷 ∈ (𝐴 ↑m 𝑛))
28	26, 27	sylib 221	. . 3 ⊢ ((𝜑 ∧ 𝜓) → ∃𝑛 ∈ ω 𝐷 ∈ (𝐴 ↑m 𝑛))
29		elmapi 8870	. . . . . 6 ⊢ (𝐷 ∈ (𝐴 ↑m 𝑛) → 𝐷:𝑛⟶𝐴)
30	29	ad2antll 742	. . . . 5 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → 𝐷:𝑛⟶𝐴)
31		ssiun2 5005	. . . . . . . . 9 ⊢ (𝑛 ∈ ω → (𝑥 ↑m 𝑛) ⊆ ∪ 𝑛 ∈ ω (𝑥 ↑m 𝑛))
32	31	ad2antrl 741	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → (𝑥 ↑m 𝑛) ⊆ ∪ 𝑛 ∈ ω (𝑥 ↑m 𝑛))
33	25	simprd 501	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝜓) → ¬ 𝐷 ∈ ∪ 𝑛 ∈ ω (𝑥 ↑m 𝑛))
34	33	adantr 486	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → ¬ 𝐷 ∈ ∪ 𝑛 ∈ ω (𝑥 ↑m 𝑛))
35	32, 34	ssneldd 3911	. . . . . . 7 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → ¬ 𝐷 ∈ (𝑥 ↑m 𝑛))
36		vex 3454	. . . . . . . . 9 ⊢ 𝑛 ∈ V
37	1, 36	elmap 8900	. . . . . . . 8 ⊢ (𝐷 ∈ (𝑥 ↑m 𝑛) ↔ 𝐷:𝑛⟶𝑥)
38		ffn 6709	. . . . . . . . 9 ⊢ (𝐷:𝑛⟶𝐴 → 𝐷 Fn 𝑛)
39		ffnfv 7119	. . . . . . . . . 10 ⊢ (𝐷:𝑛⟶𝑥 ↔ (𝐷 Fn 𝑛 ∧ ∀𝑧 ∈ 𝑛 (𝐷‘𝑧) ∈ 𝑥))
40	39	baib 545	. . . . . . . . 9 ⊢ (𝐷 Fn 𝑛 → (𝐷:𝑛⟶𝑥 ↔ ∀𝑧 ∈ 𝑛 (𝐷‘𝑧) ∈ 𝑥))
41	30, 38, 40	3syl 19	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → (𝐷:𝑛⟶𝑥 ↔ ∀𝑧 ∈ 𝑛 (𝐷‘𝑧) ∈ 𝑥))
42	37, 41	bitrid 286	. . . . . . 7 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → (𝐷 ∈ (𝑥 ↑m 𝑛) ↔ ∀𝑧 ∈ 𝑛 (𝐷‘𝑧) ∈ 𝑥))
43	35, 42	mtbid 327	. . . . . 6 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → ¬ ∀𝑧 ∈ 𝑛 (𝐷‘𝑧) ∈ 𝑥)
44		nnon 7883	. . . . . . . . 9 ⊢ (𝑛 ∈ ω → 𝑛 ∈ On)
45	44	ad2antrl 741	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → 𝑛 ∈ On)
46		ssrab2 4005	. . . . . . . . . 10 ⊢ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ⊆ ω
47		omsson 7881	. . . . . . . . . 10 ⊢ ω ⊆ On
48	46, 47	sstri 3917	. . . . . . . . 9 ⊢ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ⊆ On
49		ordom 7887	. . . . . . . . . . . . 13 ⊢ Ord ω
50		simprl 783	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → 𝑛 ∈ ω)
51		ordelss 6378	. . . . . . . . . . . . 13 ⊢ ((Ord ω ∧ 𝑛 ∈ ω) → 𝑛 ⊆ ω)
52	49, 50, 51	sylancr 599	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → 𝑛 ⊆ ω)
53		rexnal 3114	. . . . . . . . . . . . 13 ⊢ (∃𝑧 ∈ 𝑛 ¬ (𝐷‘𝑧) ∈ 𝑥 ↔ ¬ ∀𝑧 ∈ 𝑛 (𝐷‘𝑧) ∈ 𝑥)
54	43, 53	sylibr 237	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → ∃𝑧 ∈ 𝑛 ¬ (𝐷‘𝑧) ∈ 𝑥)
55		ssrexv 3978	. . . . . . . . . . . 12 ⊢ (𝑛 ⊆ ω → (∃𝑧 ∈ 𝑛 ¬ (𝐷‘𝑧) ∈ 𝑥 → ∃𝑧 ∈ ω ¬ (𝐷‘𝑧) ∈ 𝑥))
56	52, 54, 55	sylc 66	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → ∃𝑧 ∈ ω ¬ (𝐷‘𝑧) ∈ 𝑥)
57		rabn0 4338	. . . . . . . . . . 11 ⊢ ({𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ≠ ∅ ↔ ∃𝑧 ∈ ω ¬ (𝐷‘𝑧) ∈ 𝑥)
58	56, 57	sylibr 237	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ≠ ∅)
59		onint 7804	. . . . . . . . . 10 ⊢ (({𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ⊆ On ∧ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ≠ ∅) → ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})
60	48, 58, 59	sylancr 599	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})
61	48, 60	sselid 3906	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ On)
62		ontri1 6397	. . . . . . . 8 ⊢ ((𝑛 ∈ On ∧ ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ On) → (𝑛 ⊆ ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ↔ ¬ ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ 𝑛))
63	45, 61, 62	syl2anc 596	. . . . . . 7 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → (𝑛 ⊆ ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ↔ ¬ ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ 𝑛))
64		ssintrab 4930	. . . . . . . 8 ⊢ (𝑛 ⊆ ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ↔ ∀𝑧 ∈ ω (¬ (𝐷‘𝑧) ∈ 𝑥 → 𝑛 ⊆ 𝑧))
65		nnon 7883	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 ∈ ω → 𝑧 ∈ On)
66		ontri1 6397	. . . . . . . . . . . . . . . 16 ⊢ ((𝑛 ∈ On ∧ 𝑧 ∈ On) → (𝑛 ⊆ 𝑧 ↔ ¬ 𝑧 ∈ 𝑛))
67	44, 65, 66	syl2an 608	. . . . . . . . . . . . . . 15 ⊢ ((𝑛 ∈ ω ∧ 𝑧 ∈ ω) → (𝑛 ⊆ 𝑧 ↔ ¬ 𝑧 ∈ 𝑛))
68	67	imbi2d 343	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ ω ∧ 𝑧 ∈ ω) → ((¬ (𝐷‘𝑧) ∈ 𝑥 → 𝑛 ⊆ 𝑧) ↔ (¬ (𝐷‘𝑧) ∈ 𝑥 → ¬ 𝑧 ∈ 𝑛)))
69		con34b 319	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝑛 → (𝐷‘𝑧) ∈ 𝑥) ↔ (¬ (𝐷‘𝑧) ∈ 𝑥 → ¬ 𝑧 ∈ 𝑛))
70	68, 69	bitr4di 292	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ω ∧ 𝑧 ∈ ω) → ((¬ (𝐷‘𝑧) ∈ 𝑥 → 𝑛 ⊆ 𝑧) ↔ (𝑧 ∈ 𝑛 → (𝐷‘𝑧) ∈ 𝑥)))
71	70	pm5.74da 816	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ω → ((𝑧 ∈ ω → (¬ (𝐷‘𝑧) ∈ 𝑥 → 𝑛 ⊆ 𝑧)) ↔ (𝑧 ∈ ω → (𝑧 ∈ 𝑛 → (𝐷‘𝑧) ∈ 𝑥))))
72		bi2.04 392	. . . . . . . . . . . 12 ⊢ ((𝑧 ∈ ω → (𝑧 ∈ 𝑛 → (𝐷‘𝑧) ∈ 𝑥)) ↔ (𝑧 ∈ 𝑛 → (𝑧 ∈ ω → (𝐷‘𝑧) ∈ 𝑥)))
73	71, 72	bitrdi 290	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ω → ((𝑧 ∈ ω → (¬ (𝐷‘𝑧) ∈ 𝑥 → 𝑛 ⊆ 𝑧)) ↔ (𝑧 ∈ 𝑛 → (𝑧 ∈ ω → (𝐷‘𝑧) ∈ 𝑥))))
74		elnn 7888	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝑛 ∧ 𝑛 ∈ ω) → 𝑧 ∈ ω)
75		pm2.27 43	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ ω → ((𝑧 ∈ ω → (𝐷‘𝑧) ∈ 𝑥) → (𝐷‘𝑧) ∈ 𝑥))
76	74, 75	syl 18	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ 𝑛 ∧ 𝑛 ∈ ω) → ((𝑧 ∈ ω → (𝐷‘𝑧) ∈ 𝑥) → (𝐷‘𝑧) ∈ 𝑥))
77	76	expcom 419	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ω → (𝑧 ∈ 𝑛 → ((𝑧 ∈ ω → (𝐷‘𝑧) ∈ 𝑥) → (𝐷‘𝑧) ∈ 𝑥)))
78	77	a2d 30	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ω → ((𝑧 ∈ 𝑛 → (𝑧 ∈ ω → (𝐷‘𝑧) ∈ 𝑥)) → (𝑧 ∈ 𝑛 → (𝐷‘𝑧) ∈ 𝑥)))
79	73, 78	sylbid 243	. . . . . . . . . 10 ⊢ (𝑛 ∈ ω → ((𝑧 ∈ ω → (¬ (𝐷‘𝑧) ∈ 𝑥 → 𝑛 ⊆ 𝑧)) → (𝑧 ∈ 𝑛 → (𝐷‘𝑧) ∈ 𝑥)))
80	79	ad2antrl 741	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → ((𝑧 ∈ ω → (¬ (𝐷‘𝑧) ∈ 𝑥 → 𝑛 ⊆ 𝑧)) → (𝑧 ∈ 𝑛 → (𝐷‘𝑧) ∈ 𝑥)))
81	80	ralimdv2 3171	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → (∀𝑧 ∈ ω (¬ (𝐷‘𝑧) ∈ 𝑥 → 𝑛 ⊆ 𝑧) → ∀𝑧 ∈ 𝑛 (𝐷‘𝑧) ∈ 𝑥))
82	64, 81	biimtrid 245	. . . . . . 7 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → (𝑛 ⊆ ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} → ∀𝑧 ∈ 𝑛 (𝐷‘𝑧) ∈ 𝑥))
83	63, 82	sylbird 263	. . . . . 6 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → (¬ ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ 𝑛 → ∀𝑧 ∈ 𝑛 (𝐷‘𝑧) ∈ 𝑥))
84	43, 83	mt3d 149	. . . . 5 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ 𝑛)
85	30, 84	ffvelcdmd 7085	. . . 4 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}) ∈ 𝐴)
86		fveq2 6885	. . . . . . . . 9 ⊢ (𝑦 = ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} → (𝐷‘𝑦) = (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}))
87	86	eleq1d 2845	. . . . . . . 8 ⊢ (𝑦 = ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} → ((𝐷‘𝑦) ∈ 𝑥 ↔ (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}) ∈ 𝑥))
88	87	notbid 321	. . . . . . 7 ⊢ (𝑦 = ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} → (¬ (𝐷‘𝑦) ∈ 𝑥 ↔ ¬ (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}) ∈ 𝑥))
89		fveq2 6885	. . . . . . . . . 10 ⊢ (𝑧 = 𝑦 → (𝐷‘𝑧) = (𝐷‘𝑦))
90	89	eleq1d 2845	. . . . . . . . 9 ⊢ (𝑧 = 𝑦 → ((𝐷‘𝑧) ∈ 𝑥 ↔ (𝐷‘𝑦) ∈ 𝑥))
91	90	notbid 321	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → (¬ (𝐷‘𝑧) ∈ 𝑥 ↔ ¬ (𝐷‘𝑦) ∈ 𝑥))
92	91	cbvrabv 3422	. . . . . . 7 ⊢ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} = {𝑦 ∈ ω ∣ ¬ (𝐷‘𝑦) ∈ 𝑥}
93	88, 92	elrab2 3648	. . . . . 6 ⊢ (∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ↔ (∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ ω ∧ ¬ (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}) ∈ 𝑥))
94	93	simprbi 503	. . . . 5 ⊢ (∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} → ¬ (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}) ∈ 𝑥)
95	60, 94	syl 18	. . . 4 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → ¬ (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}) ∈ 𝑥)
96	85, 95	eldifd 4050	. . 3 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}) ∈ (𝐴 ∖ 𝑥))
97	28, 96	rexlimddv 3169	. 2 ⊢ ((𝜑 ∧ 𝜓) → (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}) ∈ (𝐴 ∖ 𝑥))
98	17, 97	eqeltrd 2860	1 ⊢ ((𝜑 ∧ 𝜓) → (𝑥𝐹𝑟) ∈ (𝐴 ∖ 𝑥))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∀wral 3076  ∃wrex 3086  {crab 3412  Vcvv 3450   ⊆ wss 3895   ∖ cdif 4045  ∅c0 4278  ifcif 4481  𝒫 cpw 4556  ∩ cint 4906  ∪ ciun 4950   class class class wbr 5102   We wwe 5602   × cxp 5648  ^◡ccnv 5649  ran crn 5651  Ord word 6361  Oncon0 6362   Fn wfn 6533  ⟶wf 6534  –1-1→wf1 6535  –1-1-onto→wf1o 6537  ‘cfv 6538  (class class class)co 7420   ∈ cmpo 7422  ωcom 7877   ↑_m cmap 8848   ≼ cdom 8972   ≺ csdm 8973  Fincfn 8974  cardccrd 10017

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7751  ax-inf2 9643

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-pss 4014  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4584  df-pr 4586  df-op 4590  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5545  df-eprel 5550  df-po 5558  df-so 5559  df-fr 5603  df-we 5605  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-pred 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8300  df-wrecs 8331  df-recs 8380  df-rdg 8419  df-1o 8477  df-er 8718  df-map 8850  df-en 8975  df-dom 8976  df-sdom 8977  df-fin 8978

This theorem is used by:  pwfseqlem4a  10747  pwfseqlem4  10748