Theorem pwfseqlem3 10583

Description: Lemma for pwfseq 10587. Using the construction 𝐷 from pwfseqlem1 10581, 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 3434	. . . 4 ⊢ 𝑥 ∈ V
2		vex 3434	. . . 4 ⊢ 𝑟 ∈ V
3		fvex 6854	. . . . 5 ⊢ (𝐻‘(card‘𝑥)) ∈ V
4		fvex 6854	. . . . 5 ⊢ (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}) ∈ V
5	3, 4	ifex 4518	. . . 4 ⊢ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})) ∈ V
6		pwfseqlem4.f	. . . . 5 ⊢ 𝐹 = (𝑥 ∈ V, 𝑟 ∈ V ↦ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})))
7	6	ovmpt4g 7514	. . . 4 ⊢ ((𝑥 ∈ V ∧ 𝑟 ∈ V ∧ if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})) ∈ V) → (𝑥𝐹𝑟) = if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})))
8	1, 2, 5, 7	mp3an 1464	. . 3 ⊢ (𝑥𝐹𝑟) = if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}))
9		pwfseqlem4.ps	. . . . . . . 8 ⊢ (𝜓 ↔ ((𝑥 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑥 × 𝑥) ∧ 𝑟 We 𝑥) ∧ ω ≼ 𝑥))
10	9	simprbi 497	. . . . . . 7 ⊢ (𝜓 → ω ≼ 𝑥)
11	10	adantl 481	. . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → ω ≼ 𝑥)
12		domnsym 9041	. . . . . 6 ⊢ (ω ≼ 𝑥 → ¬ 𝑥 ≺ ω)
13	11, 12	syl 17	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → ¬ 𝑥 ≺ ω)
14		isfinite 9573	. . . . 5 ⊢ (𝑥 ∈ Fin ↔ 𝑥 ≺ ω)
15	13, 14	sylnibr 329	. . . 4 ⊢ ((𝜑 ∧ 𝜓) → ¬ 𝑥 ∈ Fin)
16	15	iffalsed 4478	. . 3 ⊢ ((𝜑 ∧ 𝜓) → if(𝑥 ∈ Fin, (𝐻‘(card‘𝑥)), (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})) = (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}))
17	8, 16	eqtrid 2784	. 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 10581	. . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → 𝐷 ∈ (∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ∖ ∪ 𝑛 ∈ ω (𝑥 ↑m 𝑛)))
24		eldif 3900	. . . . . 6 ⊢ (𝐷 ∈ (∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ∖ ∪ 𝑛 ∈ ω (𝑥 ↑m 𝑛)) ↔ (𝐷 ∈ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ∧ ¬ 𝐷 ∈ ∪ 𝑛 ∈ ω (𝑥 ↑m 𝑛)))
25	23, 24	sylib 218	. . . . 5 ⊢ ((𝜑 ∧ 𝜓) → (𝐷 ∈ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ∧ ¬ 𝐷 ∈ ∪ 𝑛 ∈ ω (𝑥 ↑m 𝑛)))
26	25	simpld 494	. . . 4 ⊢ ((𝜑 ∧ 𝜓) → 𝐷 ∈ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛))
27		eliun 4938	. . . 4 ⊢ (𝐷 ∈ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ↔ ∃𝑛 ∈ ω 𝐷 ∈ (𝐴 ↑m 𝑛))
28	26, 27	sylib 218	. . 3 ⊢ ((𝜑 ∧ 𝜓) → ∃𝑛 ∈ ω 𝐷 ∈ (𝐴 ↑m 𝑛))
29		elmapi 8796	. . . . . 6 ⊢ (𝐷 ∈ (𝐴 ↑m 𝑛) → 𝐷:𝑛⟶𝐴)
30	29	ad2antll 730	. . . . 5 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → 𝐷:𝑛⟶𝐴)
31		ssiun2 4991	. . . . . . . . 9 ⊢ (𝑛 ∈ ω → (𝑥 ↑m 𝑛) ⊆ ∪ 𝑛 ∈ ω (𝑥 ↑m 𝑛))
32	31	ad2antrl 729	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → (𝑥 ↑m 𝑛) ⊆ ∪ 𝑛 ∈ ω (𝑥 ↑m 𝑛))
33	25	simprd 495	. . . . . . . . 9 ⊢ ((𝜑 ∧ 𝜓) → ¬ 𝐷 ∈ ∪ 𝑛 ∈ ω (𝑥 ↑m 𝑛))
34	33	adantr 480	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → ¬ 𝐷 ∈ ∪ 𝑛 ∈ ω (𝑥 ↑m 𝑛))
35	32, 34	ssneldd 3925	. . . . . . 7 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → ¬ 𝐷 ∈ (𝑥 ↑m 𝑛))
36		vex 3434	. . . . . . . . 9 ⊢ 𝑛 ∈ V
37	1, 36	elmap 8819	. . . . . . . 8 ⊢ (𝐷 ∈ (𝑥 ↑m 𝑛) ↔ 𝐷:𝑛⟶𝑥)
38		ffn 6669	. . . . . . . . 9 ⊢ (𝐷:𝑛⟶𝐴 → 𝐷 Fn 𝑛)
39		ffnfv 7072	. . . . . . . . . 10 ⊢ (𝐷:𝑛⟶𝑥 ↔ (𝐷 Fn 𝑛 ∧ ∀𝑧 ∈ 𝑛 (𝐷‘𝑧) ∈ 𝑥))
40	39	baib 535	. . . . . . . . 9 ⊢ (𝐷 Fn 𝑛 → (𝐷:𝑛⟶𝑥 ↔ ∀𝑧 ∈ 𝑛 (𝐷‘𝑧) ∈ 𝑥))
41	30, 38, 40	3syl 18	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → (𝐷:𝑛⟶𝑥 ↔ ∀𝑧 ∈ 𝑛 (𝐷‘𝑧) ∈ 𝑥))
42	37, 41	bitrid 283	. . . . . . 7 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → (𝐷 ∈ (𝑥 ↑m 𝑛) ↔ ∀𝑧 ∈ 𝑛 (𝐷‘𝑧) ∈ 𝑥))
43	35, 42	mtbid 324	. . . . . 6 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → ¬ ∀𝑧 ∈ 𝑛 (𝐷‘𝑧) ∈ 𝑥)
44		nnon 7823	. . . . . . . . 9 ⊢ (𝑛 ∈ ω → 𝑛 ∈ On)
45	44	ad2antrl 729	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → 𝑛 ∈ On)
46		ssrab2 4021	. . . . . . . . . 10 ⊢ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ⊆ ω
47		omsson 7821	. . . . . . . . . 10 ⊢ ω ⊆ On
48	46, 47	sstri 3932	. . . . . . . . 9 ⊢ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ⊆ On
49		ordom 7827	. . . . . . . . . . . . 13 ⊢ Ord ω
50		simprl 771	. . . . . . . . . . . . 13 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → 𝑛 ∈ ω)
51		ordelss 6340	. . . . . . . . . . . . 13 ⊢ ((Ord ω ∧ 𝑛 ∈ ω) → 𝑛 ⊆ ω)
52	49, 50, 51	sylancr 588	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → 𝑛 ⊆ ω)
53		rexnal 3090	. . . . . . . . . . . . 13 ⊢ (∃𝑧 ∈ 𝑛 ¬ (𝐷‘𝑧) ∈ 𝑥 ↔ ¬ ∀𝑧 ∈ 𝑛 (𝐷‘𝑧) ∈ 𝑥)
54	43, 53	sylibr 234	. . . . . . . . . . . 12 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → ∃𝑧 ∈ 𝑛 ¬ (𝐷‘𝑧) ∈ 𝑥)
55		ssrexv 3992	. . . . . . . . . . . 12 ⊢ (𝑛 ⊆ ω → (∃𝑧 ∈ 𝑛 ¬ (𝐷‘𝑧) ∈ 𝑥 → ∃𝑧 ∈ ω ¬ (𝐷‘𝑧) ∈ 𝑥))
56	52, 54, 55	sylc 65	. . . . . . . . . . 11 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → ∃𝑧 ∈ ω ¬ (𝐷‘𝑧) ∈ 𝑥)
57		rabn0 4330	. . . . . . . . . . 11 ⊢ ({𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ≠ ∅ ↔ ∃𝑧 ∈ ω ¬ (𝐷‘𝑧) ∈ 𝑥)
58	56, 57	sylibr 234	. . . . . . . . . 10 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ≠ ∅)
59		onint 7744	. . . . . . . . . 10 ⊢ (({𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ⊆ On ∧ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ≠ ∅) → ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})
60	48, 58, 59	sylancr 588	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥})
61	48, 60	sselid 3920	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ On)
62		ontri1 6358	. . . . . . . 8 ⊢ ((𝑛 ∈ On ∧ ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ On) → (𝑛 ⊆ ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ↔ ¬ ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ 𝑛))
63	45, 61, 62	syl2anc 585	. . . . . . 7 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → (𝑛 ⊆ ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ↔ ¬ ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ 𝑛))
64		ssintrab 4914	. . . . . . . 8 ⊢ (𝑛 ⊆ ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ↔ ∀𝑧 ∈ ω (¬ (𝐷‘𝑧) ∈ 𝑥 → 𝑛 ⊆ 𝑧))
65		nnon 7823	. . . . . . . . . . . . . . . 16 ⊢ (𝑧 ∈ ω → 𝑧 ∈ On)
66		ontri1 6358	. . . . . . . . . . . . . . . 16 ⊢ ((𝑛 ∈ On ∧ 𝑧 ∈ On) → (𝑛 ⊆ 𝑧 ↔ ¬ 𝑧 ∈ 𝑛))
67	44, 65, 66	syl2an 597	. . . . . . . . . . . . . . 15 ⊢ ((𝑛 ∈ ω ∧ 𝑧 ∈ ω) → (𝑛 ⊆ 𝑧 ↔ ¬ 𝑧 ∈ 𝑛))
68	67	imbi2d 340	. . . . . . . . . . . . . 14 ⊢ ((𝑛 ∈ ω ∧ 𝑧 ∈ ω) → ((¬ (𝐷‘𝑧) ∈ 𝑥 → 𝑛 ⊆ 𝑧) ↔ (¬ (𝐷‘𝑧) ∈ 𝑥 → ¬ 𝑧 ∈ 𝑛)))
69		con34b 316	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝑛 → (𝐷‘𝑧) ∈ 𝑥) ↔ (¬ (𝐷‘𝑧) ∈ 𝑥 → ¬ 𝑧 ∈ 𝑛))
70	68, 69	bitr4di 289	. . . . . . . . . . . . 13 ⊢ ((𝑛 ∈ ω ∧ 𝑧 ∈ ω) → ((¬ (𝐷‘𝑧) ∈ 𝑥 → 𝑛 ⊆ 𝑧) ↔ (𝑧 ∈ 𝑛 → (𝐷‘𝑧) ∈ 𝑥)))
71	70	pm5.74da 804	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ω → ((𝑧 ∈ ω → (¬ (𝐷‘𝑧) ∈ 𝑥 → 𝑛 ⊆ 𝑧)) ↔ (𝑧 ∈ ω → (𝑧 ∈ 𝑛 → (𝐷‘𝑧) ∈ 𝑥))))
72		bi2.04 387	. . . . . . . . . . . 12 ⊢ ((𝑧 ∈ ω → (𝑧 ∈ 𝑛 → (𝐷‘𝑧) ∈ 𝑥)) ↔ (𝑧 ∈ 𝑛 → (𝑧 ∈ ω → (𝐷‘𝑧) ∈ 𝑥)))
73	71, 72	bitrdi 287	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ω → ((𝑧 ∈ ω → (¬ (𝐷‘𝑧) ∈ 𝑥 → 𝑛 ⊆ 𝑧)) ↔ (𝑧 ∈ 𝑛 → (𝑧 ∈ ω → (𝐷‘𝑧) ∈ 𝑥))))
74		elnn 7828	. . . . . . . . . . . . . 14 ⊢ ((𝑧 ∈ 𝑛 ∧ 𝑛 ∈ ω) → 𝑧 ∈ ω)
75		pm2.27 42	. . . . . . . . . . . . . 14 ⊢ (𝑧 ∈ ω → ((𝑧 ∈ ω → (𝐷‘𝑧) ∈ 𝑥) → (𝐷‘𝑧) ∈ 𝑥))
76	74, 75	syl 17	. . . . . . . . . . . . 13 ⊢ ((𝑧 ∈ 𝑛 ∧ 𝑛 ∈ ω) → ((𝑧 ∈ ω → (𝐷‘𝑧) ∈ 𝑥) → (𝐷‘𝑧) ∈ 𝑥))
77	76	expcom 413	. . . . . . . . . . . 12 ⊢ (𝑛 ∈ ω → (𝑧 ∈ 𝑛 → ((𝑧 ∈ ω → (𝐷‘𝑧) ∈ 𝑥) → (𝐷‘𝑧) ∈ 𝑥)))
78	77	a2d 29	. . . . . . . . . . 11 ⊢ (𝑛 ∈ ω → ((𝑧 ∈ 𝑛 → (𝑧 ∈ ω → (𝐷‘𝑧) ∈ 𝑥)) → (𝑧 ∈ 𝑛 → (𝐷‘𝑧) ∈ 𝑥)))
79	73, 78	sylbid 240	. . . . . . . . . 10 ⊢ (𝑛 ∈ ω → ((𝑧 ∈ ω → (¬ (𝐷‘𝑧) ∈ 𝑥 → 𝑛 ⊆ 𝑧)) → (𝑧 ∈ 𝑛 → (𝐷‘𝑧) ∈ 𝑥)))
80	79	ad2antrl 729	. . . . . . . . 9 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → ((𝑧 ∈ ω → (¬ (𝐷‘𝑧) ∈ 𝑥 → 𝑛 ⊆ 𝑧)) → (𝑧 ∈ 𝑛 → (𝐷‘𝑧) ∈ 𝑥)))
81	80	ralimdv2 3147	. . . . . . . 8 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → (∀𝑧 ∈ ω (¬ (𝐷‘𝑧) ∈ 𝑥 → 𝑛 ⊆ 𝑧) → ∀𝑧 ∈ 𝑛 (𝐷‘𝑧) ∈ 𝑥))
82	64, 81	biimtrid 242	. . . . . . 7 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → (𝑛 ⊆ ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} → ∀𝑧 ∈ 𝑛 (𝐷‘𝑧) ∈ 𝑥))
83	63, 82	sylbird 260	. . . . . 6 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → (¬ ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ 𝑛 → ∀𝑧 ∈ 𝑛 (𝐷‘𝑧) ∈ 𝑥))
84	43, 83	mt3d 148	. . . . 5 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ 𝑛)
85	30, 84	ffvelcdmd 7038	. . . 4 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}) ∈ 𝐴)
86		fveq2 6841	. . . . . . . . 9 ⊢ (𝑦 = ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} → (𝐷‘𝑦) = (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}))
87	86	eleq1d 2822	. . . . . . . 8 ⊢ (𝑦 = ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} → ((𝐷‘𝑦) ∈ 𝑥 ↔ (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}) ∈ 𝑥))
88	87	notbid 318	. . . . . . 7 ⊢ (𝑦 = ∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} → (¬ (𝐷‘𝑦) ∈ 𝑥 ↔ ¬ (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}) ∈ 𝑥))
89		fveq2 6841	. . . . . . . . . 10 ⊢ (𝑧 = 𝑦 → (𝐷‘𝑧) = (𝐷‘𝑦))
90	89	eleq1d 2822	. . . . . . . . 9 ⊢ (𝑧 = 𝑦 → ((𝐷‘𝑧) ∈ 𝑥 ↔ (𝐷‘𝑦) ∈ 𝑥))
91	90	notbid 318	. . . . . . . 8 ⊢ (𝑧 = 𝑦 → (¬ (𝐷‘𝑧) ∈ 𝑥 ↔ ¬ (𝐷‘𝑦) ∈ 𝑥))
92	91	cbvrabv 3400	. . . . . . 7 ⊢ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} = {𝑦 ∈ ω ∣ ¬ (𝐷‘𝑦) ∈ 𝑥}
93	88, 92	elrab2 3638	. . . . . 6 ⊢ (∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ↔ (∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ ω ∧ ¬ (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}) ∈ 𝑥))
94	93	simprbi 497	. . . . 5 ⊢ (∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} ∈ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥} → ¬ (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}) ∈ 𝑥)
95	60, 94	syl 17	. . . 4 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → ¬ (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}) ∈ 𝑥)
96	85, 95	eldifd 3901	. . 3 ⊢ (((𝜑 ∧ 𝜓) ∧ (𝑛 ∈ ω ∧ 𝐷 ∈ (𝐴 ↑m 𝑛))) → (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}) ∈ (𝐴 ∖ 𝑥))
97	28, 96	rexlimddv 3145	. 2 ⊢ ((𝜑 ∧ 𝜓) → (𝐷‘∩ {𝑧 ∈ ω ∣ ¬ (𝐷‘𝑧) ∈ 𝑥}) ∈ (𝐴 ∖ 𝑥))
98	17, 97	eqeltrd 2837	1 ⊢ ((𝜑 ∧ 𝜓) → (𝑥𝐹𝑟) ∈ (𝐴 ∖ 𝑥))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ≠ wne 2933  ∀wral 3052  ∃wrex 3062  {crab 3390  Vcvv 3430   ∖ cdif 3887   ⊆ wss 3890  ∅c0 4274  ifcif 4467  𝒫 cpw 4542  ∩ cint 4890  ∪ ciun 4934   class class class wbr 5086   We wwe 5583   × cxp 5629  ^◡ccnv 5630  ran crn 5632  Ord word 6323  Oncon0 6324   Fn wfn 6494  ⟶wf 6495  –1-1→wf1 6496  –1-1-onto→wf1o 6498  ‘cfv 6499  (class class class)co 7367   ∈ cmpo 7369  ωcom 7817   ↑_m cmap 8773   ≼ cdom 8891   ≺ csdm 8892  Fincfn 8893  cardccrd 9859

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-sep 5232  ax-nul 5242  ax-pow 5308  ax-pr 5376  ax-un 7689  ax-inf2 9562

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6266  df-ord 6327  df-on 6328  df-lim 6329  df-suc 6330  df-iota 6455  df-fun 6501  df-fn 6502  df-f 6503  df-f1 6504  df-fo 6505  df-f1o 6506  df-fv 6507  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-1st 7942  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-1o 8405  df-er 8643  df-map 8775  df-en 8894  df-dom 8895  df-sdom 8896  df-fin 8897

This theorem is referenced by:  pwfseqlem4a  10584  pwfseqlem4  10585