Theorem pwfseq 10776

Description: The powerset of a Dedekind-infinite set does not inject into the set of finite sequences. The proof is due to Halbeisen and Shelah. Proposition 1.7 of [KanamoriPincus] p. 418. (Contributed by Mario Carneiro, 31-May-2015.)

Assertion

Ref	Expression
pwfseq	⊢ (ω ≼ 𝐴 → ¬ 𝒫 𝐴 ≼ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛))

Distinct variable group:   𝐴,𝑛

Proof of Theorem pwfseq

Dummy variables 𝑓 𝑏 𝑔 ℎ 𝑘 𝑚 𝑝 𝑟 𝑠 𝑡 𝑢 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		reldom 9007	. . 3 ⊢ Rel ≼
2	1	brrelex2i 5712	. 2 ⊢ (ω ≼ 𝐴 → 𝐴 ∈ V)
3		domeng 9017	. . 3 ⊢ (𝐴 ∈ V → (ω ≼ 𝐴 ↔ ∃𝑡(ω ≈ 𝑡 ∧ 𝑡 ⊆ 𝐴)))
4		bren 9011	. . . . . 6 ⊢ (ω ≈ 𝑡 ↔ ∃ℎ ℎ:ω⟶1-1onto𝑡)
5		harcl 9580	. . . . . . . . . 10 ⊢ (har‘𝒫 𝐴) ∈ On
6		infxpenc2 10128	. . . . . . . . . 10 ⊢ ((har‘𝒫 𝐴) ∈ On → ∃𝑚∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚‘𝑏):(𝑏 × 𝑏)⟶1-1onto𝑏))
7	5, 6	ax-mp 5	. . . . . . . . 9 ⊢ ∃𝑚∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚‘𝑏):(𝑏 × 𝑏)⟶1-1onto𝑏)
8		oveq2 7451	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑛 = 𝑘 → (𝐴 ↑m 𝑛) = (𝐴 ↑m 𝑘))
9	8	cbviunv 5000	. . . . . . . . . . . . . . . . 17 ⊢ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) = ∪ 𝑘 ∈ ω (𝐴 ↑m 𝑘)
10		f1eq3 6797	. . . . . . . . . . . . . . . . 17 ⊢ (∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) = ∪ 𝑘 ∈ ω (𝐴 ↑m 𝑘) → (𝑔:𝒫 𝐴⟶1-1∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ↔ 𝑔:𝒫 𝐴⟶1-1∪ 𝑘 ∈ ω (𝐴 ↑m 𝑘)))
11	9, 10	ax-mp 5	. . . . . . . . . . . . . . . 16 ⊢ (𝑔:𝒫 𝐴⟶1-1∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) ↔ 𝑔:𝒫 𝐴⟶1-1∪ 𝑘 ∈ ω (𝐴 ↑m 𝑘))
12	11	bilani 510	. . . . . . . . . . . . . . 15 ⊢ ((((ℎ:ω⟶1-1onto𝑡 ∧ 𝑡 ⊆ 𝐴) ∧ ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚‘𝑏):(𝑏 × 𝑏)⟶1-1onto𝑏)) ∧ 𝑔:𝒫 𝐴⟶1-1∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛)) → 𝑔:𝒫 𝐴⟶1-1∪ 𝑘 ∈ ω (𝐴 ↑m 𝑘))
13		simpllr 788	. . . . . . . . . . . . . . 15 ⊢ ((((ℎ:ω⟶1-1onto𝑡 ∧ 𝑡 ⊆ 𝐴) ∧ ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚‘𝑏):(𝑏 × 𝑏)⟶1-1onto𝑏)) ∧ 𝑔:𝒫 𝐴⟶1-1∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛)) → 𝑡 ⊆ 𝐴)
14		simplll 787	. . . . . . . . . . . . . . 15 ⊢ ((((ℎ:ω⟶1-1onto𝑡 ∧ 𝑡 ⊆ 𝐴) ∧ ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚‘𝑏):(𝑏 × 𝑏)⟶1-1onto𝑏)) ∧ 𝑔:𝒫 𝐴⟶1-1∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛)) → ℎ:ω⟶1-1onto𝑡)
15		biid 264	. . . . . . . . . . . . . . 15 ⊢ (((𝑢 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑢 × 𝑢) ∧ 𝑟 We 𝑢) ∧ ω ≼ 𝑢) ↔ ((𝑢 ⊆ 𝐴 ∧ 𝑟 ⊆ (𝑢 × 𝑢) ∧ 𝑟 We 𝑢) ∧ ω ≼ 𝑢))
16		simplr 781	. . . . . . . . . . . . . . . 16 ⊢ ((((ℎ:ω⟶1-1onto𝑡 ∧ 𝑡 ⊆ 𝐴) ∧ ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚‘𝑏):(𝑏 × 𝑏)⟶1-1onto𝑏)) ∧ 𝑔:𝒫 𝐴⟶1-1∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛)) → ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚‘𝑏):(𝑏 × 𝑏)⟶1-1onto𝑏))
17		sseq2 3939	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 = 𝑤 → (ω ⊆ 𝑏 ↔ ω ⊆ 𝑤))
18		fveq2 6908	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑏 = 𝑤 → (𝑚‘𝑏) = (𝑚‘𝑤))
19	18	f1oeq1d 6841	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑏 = 𝑤 → ((𝑚‘𝑏):(𝑏 × 𝑏)⟶1-1onto𝑏 ↔ (𝑚‘𝑤):(𝑏 × 𝑏)⟶1-1onto𝑏))
20		xpeq12 5680	. . . . . . . . . . . . . . . . . . . . 21 ⊢ ((𝑏 = 𝑤 ∧ 𝑏 = 𝑤) → (𝑏 × 𝑏) = (𝑤 × 𝑤))
21	20	anidms 577	. . . . . . . . . . . . . . . . . . . 20 ⊢ (𝑏 = 𝑤 → (𝑏 × 𝑏) = (𝑤 × 𝑤))
22	21	f1oeq2d 6842	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑏 = 𝑤 → ((𝑚‘𝑤):(𝑏 × 𝑏)⟶1-1onto𝑏 ↔ (𝑚‘𝑤):(𝑤 × 𝑤)⟶1-1onto𝑏))
23		f1oeq3 6836	. . . . . . . . . . . . . . . . . . 19 ⊢ (𝑏 = 𝑤 → ((𝑚‘𝑤):(𝑤 × 𝑤)⟶1-1onto𝑏 ↔ (𝑚‘𝑤):(𝑤 × 𝑤)⟶1-1onto𝑤))
24	19, 22, 23	3bitrd 308	. . . . . . . . . . . . . . . . . 18 ⊢ (𝑏 = 𝑤 → ((𝑚‘𝑏):(𝑏 × 𝑏)⟶1-1onto𝑏 ↔ (𝑚‘𝑤):(𝑤 × 𝑤)⟶1-1onto𝑤))
25	17, 24	imbi12d 347	. . . . . . . . . . . . . . . . 17 ⊢ (𝑏 = 𝑤 → ((ω ⊆ 𝑏 → (𝑚‘𝑏):(𝑏 × 𝑏)⟶1-1onto𝑏) ↔ (ω ⊆ 𝑤 → (𝑚‘𝑤):(𝑤 × 𝑤)⟶1-1onto𝑤)))
26	25	cbvralvw 3244	. . . . . . . . . . . . . . . 16 ⊢ (∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚‘𝑏):(𝑏 × 𝑏)⟶1-1onto𝑏) ↔ ∀𝑤 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑤 → (𝑚‘𝑤):(𝑤 × 𝑤)⟶1-1onto𝑤))
27	16, 26	sylib 221	. . . . . . . . . . . . . . 15 ⊢ ((((ℎ:ω⟶1-1onto𝑡 ∧ 𝑡 ⊆ 𝐴) ∧ ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚‘𝑏):(𝑏 × 𝑏)⟶1-1onto𝑏)) ∧ 𝑔:𝒫 𝐴⟶1-1∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛)) → ∀𝑤 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑤 → (𝑚‘𝑤):(𝑤 × 𝑤)⟶1-1onto𝑤))
28		eqid 2763	. . . . . . . . . . . . . . 15 ⊢ OrdIso(𝑟, 𝑢) = OrdIso(𝑟, 𝑢)
29		eqid 2763	. . . . . . . . . . . . . . 15 ⊢ (𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩) = (𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩)
30		eqid 2763	. . . . . . . . . . . . . . 15 ⊢ ((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ ◡(𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩)) = ((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ ◡(𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩))
31		eqid 2763	. . . . . . . . . . . . . . 15 ⊢ seqω((𝑝 ∈ V, 𝑓 ∈ V ↦ (𝑥 ∈ (𝑢 ↑m suc 𝑝) ↦ ((𝑓‘(𝑥 ↾ 𝑝))((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ ◡(𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩))(𝑥‘𝑝)))), {⟨∅, (OrdIso(𝑟, 𝑢)‘∅)⟩}) = seqω((𝑝 ∈ V, 𝑓 ∈ V ↦ (𝑥 ∈ (𝑢 ↑m suc 𝑝) ↦ ((𝑓‘(𝑥 ↾ 𝑝))((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ ◡(𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩))(𝑥‘𝑝)))), {⟨∅, (OrdIso(𝑟, 𝑢)‘∅)⟩})
32		oveq2 7451	. . . . . . . . . . . . . . . . 17 ⊢ (𝑛 = 𝑘 → (𝑢 ↑m 𝑛) = (𝑢 ↑m 𝑘))
33	32	cbviunv 5000	. . . . . . . . . . . . . . . 16 ⊢ ∪ 𝑛 ∈ ω (𝑢 ↑m 𝑛) = ∪ 𝑘 ∈ ω (𝑢 ↑m 𝑘)
34	33	mpteq1i 5199	. . . . . . . . . . . . . . 15 ⊢ (𝑦 ∈ ∪ 𝑛 ∈ ω (𝑢 ↑m 𝑛) ↦ ⟨dom 𝑦, ((seqω((𝑝 ∈ V, 𝑓 ∈ V ↦ (𝑥 ∈ (𝑢 ↑m suc 𝑝) ↦ ((𝑓‘(𝑥 ↾ 𝑝))((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ ◡(𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩))(𝑥‘𝑝)))), {⟨∅, (OrdIso(𝑟, 𝑢)‘∅)⟩})‘dom 𝑦)‘𝑦)⟩) = (𝑦 ∈ ∪ 𝑘 ∈ ω (𝑢 ↑m 𝑘) ↦ ⟨dom 𝑦, ((seqω((𝑝 ∈ V, 𝑓 ∈ V ↦ (𝑥 ∈ (𝑢 ↑m suc 𝑝) ↦ ((𝑓‘(𝑥 ↾ 𝑝))((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ ◡(𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩))(𝑥‘𝑝)))), {⟨∅, (OrdIso(𝑟, 𝑢)‘∅)⟩})‘dom 𝑦)‘𝑦)⟩)
35		eqid 2763	. . . . . . . . . . . . . . 15 ⊢ (𝑥 ∈ ω, 𝑦 ∈ 𝑢 ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑥), 𝑦⟩) = (𝑥 ∈ ω, 𝑦 ∈ 𝑢 ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑥), 𝑦⟩)
36		eqid 2763	. . . . . . . . . . . . . . 15 ⊢ ((((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ ◡(𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩)) ∘ (𝑥 ∈ ω, 𝑦 ∈ 𝑢 ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑥), 𝑦⟩)) ∘ (𝑦 ∈ ∪ 𝑛 ∈ ω (𝑢 ↑m 𝑛) ↦ ⟨dom 𝑦, ((seqω((𝑝 ∈ V, 𝑓 ∈ V ↦ (𝑥 ∈ (𝑢 ↑m suc 𝑝) ↦ ((𝑓‘(𝑥 ↾ 𝑝))((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ ◡(𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩))(𝑥‘𝑝)))), {⟨∅, (OrdIso(𝑟, 𝑢)‘∅)⟩})‘dom 𝑦)‘𝑦)⟩)) = ((((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ ◡(𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩)) ∘ (𝑥 ∈ ω, 𝑦 ∈ 𝑢 ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑥), 𝑦⟩)) ∘ (𝑦 ∈ ∪ 𝑛 ∈ ω (𝑢 ↑m 𝑛) ↦ ⟨dom 𝑦, ((seqω((𝑝 ∈ V, 𝑓 ∈ V ↦ (𝑥 ∈ (𝑢 ↑m suc 𝑝) ↦ ((𝑓‘(𝑥 ↾ 𝑝))((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ ◡(𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩))(𝑥‘𝑝)))), {⟨∅, (OrdIso(𝑟, 𝑢)‘∅)⟩})‘dom 𝑦)‘𝑦)⟩))
37	12, 13, 14, 15, 27, 28, 29, 30, 31, 34, 35, 36	pwfseqlem5 10775	. . . . . . . . . . . . . 14 ⊢ ¬ (((ℎ:ω⟶1-1onto𝑡 ∧ 𝑡 ⊆ 𝐴) ∧ ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚‘𝑏):(𝑏 × 𝑏)⟶1-1onto𝑏)) ∧ 𝑔:𝒫 𝐴⟶1-1∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛))
38	37	imnani 406	. . . . . . . . . . . . 13 ⊢ (((ℎ:ω⟶1-1onto𝑡 ∧ 𝑡 ⊆ 𝐴) ∧ ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚‘𝑏):(𝑏 × 𝑏)⟶1-1onto𝑏)) → ¬ 𝑔:𝒫 𝐴⟶1-1∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛))
39	38	nexdv 1971	. . . . . . . . . . . 12 ⊢ (((ℎ:ω⟶1-1onto𝑡 ∧ 𝑡 ⊆ 𝐴) ∧ ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚‘𝑏):(𝑏 × 𝑏)⟶1-1onto𝑏)) → ¬ ∃𝑔 𝑔:𝒫 𝐴⟶1-1∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛))
40		brdomi 9014	. . . . . . . . . . . 12 ⊢ (𝒫 𝐴 ≼ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛) → ∃𝑔 𝑔:𝒫 𝐴⟶1-1∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛))
41	39, 40	nsyl 141	. . . . . . . . . . 11 ⊢ (((ℎ:ω⟶1-1onto𝑡 ∧ 𝑡 ⊆ 𝐴) ∧ ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚‘𝑏):(𝑏 × 𝑏)⟶1-1onto𝑏)) → ¬ 𝒫 𝐴 ≼ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛))
42	41	ex 418	. . . . . . . . . 10 ⊢ ((ℎ:ω⟶1-1onto𝑡 ∧ 𝑡 ⊆ 𝐴) → (∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚‘𝑏):(𝑏 × 𝑏)⟶1-1onto𝑏) → ¬ 𝒫 𝐴 ≼ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛)))
43	42	exlimdv 1968	. . . . . . . . 9 ⊢ ((ℎ:ω⟶1-1onto𝑡 ∧ 𝑡 ⊆ 𝐴) → (∃𝑚∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚‘𝑏):(𝑏 × 𝑏)⟶1-1onto𝑏) → ¬ 𝒫 𝐴 ≼ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛)))
44	7, 43	mpi 21	. . . . . . . 8 ⊢ ((ℎ:ω⟶1-1onto𝑡 ∧ 𝑡 ⊆ 𝐴) → ¬ 𝒫 𝐴 ≼ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛))
45	44	ex 418	. . . . . . 7 ⊢ (ℎ:ω⟶1-1onto𝑡 → (𝑡 ⊆ 𝐴 → ¬ 𝒫 𝐴 ≼ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛)))
46	45	exlimiv 1965	. . . . . 6 ⊢ (∃ℎ ℎ:ω⟶1-1onto𝑡 → (𝑡 ⊆ 𝐴 → ¬ 𝒫 𝐴 ≼ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛)))
47	4, 46	sylbi 220	. . . . 5 ⊢ (ω ≈ 𝑡 → (𝑡 ⊆ 𝐴 → ¬ 𝒫 𝐴 ≼ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛)))
48	47	imp 412	. . . 4 ⊢ ((ω ≈ 𝑡 ∧ 𝑡 ⊆ 𝐴) → ¬ 𝒫 𝐴 ≼ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛))
49	48	exlimiv 1965	. . 3 ⊢ (∃𝑡(ω ≈ 𝑡 ∧ 𝑡 ⊆ 𝐴) → ¬ 𝒫 𝐴 ≼ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛))
50	3, 49	biimtrdi 256	. 2 ⊢ (𝐴 ∈ V → (ω ≼ 𝐴 → ¬ 𝒫 𝐴 ≼ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛)))
51	2, 50	mpcom 39	1 ⊢ (ω ≼ 𝐴 → ¬ 𝒫 𝐴 ≼ ∪ 𝑛 ∈ ω (𝐴 ↑m 𝑛))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570  ∃wex 1812   ∈ wcel 2147  ∀wral 3080  Vcvv 3454   ⊆ wss 3900  ∅c0 4281  𝒫 cpw 4560  {csn 4588  ⟨cop 4838  ∪ ciun 4954   class class class wbr 5106   ↦ cmpt 5189   We wwe 5607   × cxp 5653  ^◡ccnv 5654  dom cdm 5655   ↾ cres 5657   ∘ ccom 5659  Oncon0 6380  suc csuc 6382  ⟶1-1wf1 6555  ⟶1-1ontowf1o 6557  ‘cfv 6558  (class class class)co 7443   ∈ cmpo 7445  ωcom 7901  seq_ωcseqom 8485   ↑_m cmap 8875   ≈ cen 8998   ≼ cdom 8999  OrdIsocoi 9530  harchar 9577

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775  ax-inf2 9669

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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-tp 4593  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-se 5609  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-pred 6322  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-isom 6567  df-riota 7400  df-ov 7446  df-oprab 7447  df-mpo 7448  df-om 7902  df-1st 8025  df-2nd 8026  df-supp 8205  df-frecs 8327  df-wrecs 8358  df-recs 8407  df-rdg 8446  df-seqom 8486  df-1o 8504  df-2o 8505  df-oadd 8508  df-omul 8509  df-oexp 8510  df-er 8745  df-map 8877  df-en 9002  df-dom 9003  df-sdom 9004  df-fin 9005  df-fsupp 9382  df-oi 9531  df-har 9578  df-cnf 9690  df-card 10047

This theorem is used by:  pwxpndom2  10777