MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  pwfseq Structured version   Visualization version   GIF version

Theorem pwfseq 9486
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 (ω ≼ 𝐴 → ¬ 𝒫 𝐴 𝑛 ∈ ω (𝐴𝑚 𝑛))
Distinct variable group:   𝐴,𝑛

Proof of Theorem pwfseq
Dummy variables 𝑓 𝑏 𝑔 𝑘 𝑚 𝑝 𝑟 𝑠 𝑡 𝑢 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 reldom 7961 . . 3 Rel ≼
21brrelex2i 5159 . 2 (ω ≼ 𝐴𝐴 ∈ V)
3 domeng 7969 . . 3 (𝐴 ∈ V → (ω ≼ 𝐴 ↔ ∃𝑡(ω ≈ 𝑡𝑡𝐴)))
4 bren 7964 . . . . . 6 (ω ≈ 𝑡 ↔ ∃ :ω–1-1-onto𝑡)
5 harcl 8466 . . . . . . . . . 10 (har‘𝒫 𝐴) ∈ On
6 infxpenc2 8845 . . . . . . . . . 10 ((har‘𝒫 𝐴) ∈ On → ∃𝑚𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚𝑏):(𝑏 × 𝑏)–1-1-onto𝑏))
75, 6ax-mp 5 . . . . . . . . 9 𝑚𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚𝑏):(𝑏 × 𝑏)–1-1-onto𝑏)
8 simpr 477 . . . . . . . . . . . . . . . 16 ((((:ω–1-1-onto𝑡𝑡𝐴) ∧ ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚𝑏):(𝑏 × 𝑏)–1-1-onto𝑏)) ∧ 𝑔:𝒫 𝐴1-1 𝑛 ∈ ω (𝐴𝑚 𝑛)) → 𝑔:𝒫 𝐴1-1 𝑛 ∈ ω (𝐴𝑚 𝑛))
9 oveq2 6658 . . . . . . . . . . . . . . . . . 18 (𝑛 = 𝑘 → (𝐴𝑚 𝑛) = (𝐴𝑚 𝑘))
109cbviunv 4559 . . . . . . . . . . . . . . . . 17 𝑛 ∈ ω (𝐴𝑚 𝑛) = 𝑘 ∈ ω (𝐴𝑚 𝑘)
11 f1eq3 6098 . . . . . . . . . . . . . . . . 17 ( 𝑛 ∈ ω (𝐴𝑚 𝑛) = 𝑘 ∈ ω (𝐴𝑚 𝑘) → (𝑔:𝒫 𝐴1-1 𝑛 ∈ ω (𝐴𝑚 𝑛) ↔ 𝑔:𝒫 𝐴1-1 𝑘 ∈ ω (𝐴𝑚 𝑘)))
1210, 11ax-mp 5 . . . . . . . . . . . . . . . 16 (𝑔:𝒫 𝐴1-1 𝑛 ∈ ω (𝐴𝑚 𝑛) ↔ 𝑔:𝒫 𝐴1-1 𝑘 ∈ ω (𝐴𝑚 𝑘))
138, 12sylib 208 . . . . . . . . . . . . . . 15 ((((:ω–1-1-onto𝑡𝑡𝐴) ∧ ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚𝑏):(𝑏 × 𝑏)–1-1-onto𝑏)) ∧ 𝑔:𝒫 𝐴1-1 𝑛 ∈ ω (𝐴𝑚 𝑛)) → 𝑔:𝒫 𝐴1-1 𝑘 ∈ ω (𝐴𝑚 𝑘))
14 simpllr 799 . . . . . . . . . . . . . . 15 ((((:ω–1-1-onto𝑡𝑡𝐴) ∧ ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚𝑏):(𝑏 × 𝑏)–1-1-onto𝑏)) ∧ 𝑔:𝒫 𝐴1-1 𝑛 ∈ ω (𝐴𝑚 𝑛)) → 𝑡𝐴)
15 simplll 798 . . . . . . . . . . . . . . 15 ((((:ω–1-1-onto𝑡𝑡𝐴) ∧ ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚𝑏):(𝑏 × 𝑏)–1-1-onto𝑏)) ∧ 𝑔:𝒫 𝐴1-1 𝑛 ∈ ω (𝐴𝑚 𝑛)) → :ω–1-1-onto𝑡)
16 biid 251 . . . . . . . . . . . . . . 15 (((𝑢𝐴𝑟 ⊆ (𝑢 × 𝑢) ∧ 𝑟 We 𝑢) ∧ ω ≼ 𝑢) ↔ ((𝑢𝐴𝑟 ⊆ (𝑢 × 𝑢) ∧ 𝑟 We 𝑢) ∧ ω ≼ 𝑢))
17 simplr 792 . . . . . . . . . . . . . . . 16 ((((:ω–1-1-onto𝑡𝑡𝐴) ∧ ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚𝑏):(𝑏 × 𝑏)–1-1-onto𝑏)) ∧ 𝑔:𝒫 𝐴1-1 𝑛 ∈ ω (𝐴𝑚 𝑛)) → ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚𝑏):(𝑏 × 𝑏)–1-1-onto𝑏))
18 sseq2 3627 . . . . . . . . . . . . . . . . . 18 (𝑏 = 𝑤 → (ω ⊆ 𝑏 ↔ ω ⊆ 𝑤))
19 fveq2 6191 . . . . . . . . . . . . . . . . . . . 20 (𝑏 = 𝑤 → (𝑚𝑏) = (𝑚𝑤))
20 f1oeq1 6127 . . . . . . . . . . . . . . . . . . . 20 ((𝑚𝑏) = (𝑚𝑤) → ((𝑚𝑏):(𝑏 × 𝑏)–1-1-onto𝑏 ↔ (𝑚𝑤):(𝑏 × 𝑏)–1-1-onto𝑏))
2119, 20syl 17 . . . . . . . . . . . . . . . . . . 19 (𝑏 = 𝑤 → ((𝑚𝑏):(𝑏 × 𝑏)–1-1-onto𝑏 ↔ (𝑚𝑤):(𝑏 × 𝑏)–1-1-onto𝑏))
22 xpeq12 5134 . . . . . . . . . . . . . . . . . . . . 21 ((𝑏 = 𝑤𝑏 = 𝑤) → (𝑏 × 𝑏) = (𝑤 × 𝑤))
2322anidms 677 . . . . . . . . . . . . . . . . . . . 20 (𝑏 = 𝑤 → (𝑏 × 𝑏) = (𝑤 × 𝑤))
24 f1oeq2 6128 . . . . . . . . . . . . . . . . . . . 20 ((𝑏 × 𝑏) = (𝑤 × 𝑤) → ((𝑚𝑤):(𝑏 × 𝑏)–1-1-onto𝑏 ↔ (𝑚𝑤):(𝑤 × 𝑤)–1-1-onto𝑏))
2523, 24syl 17 . . . . . . . . . . . . . . . . . . 19 (𝑏 = 𝑤 → ((𝑚𝑤):(𝑏 × 𝑏)–1-1-onto𝑏 ↔ (𝑚𝑤):(𝑤 × 𝑤)–1-1-onto𝑏))
26 f1oeq3 6129 . . . . . . . . . . . . . . . . . . 19 (𝑏 = 𝑤 → ((𝑚𝑤):(𝑤 × 𝑤)–1-1-onto𝑏 ↔ (𝑚𝑤):(𝑤 × 𝑤)–1-1-onto𝑤))
2721, 25, 263bitrd 294 . . . . . . . . . . . . . . . . . 18 (𝑏 = 𝑤 → ((𝑚𝑏):(𝑏 × 𝑏)–1-1-onto𝑏 ↔ (𝑚𝑤):(𝑤 × 𝑤)–1-1-onto𝑤))
2818, 27imbi12d 334 . . . . . . . . . . . . . . . . 17 (𝑏 = 𝑤 → ((ω ⊆ 𝑏 → (𝑚𝑏):(𝑏 × 𝑏)–1-1-onto𝑏) ↔ (ω ⊆ 𝑤 → (𝑚𝑤):(𝑤 × 𝑤)–1-1-onto𝑤)))
2928cbvralv 3171 . . . . . . . . . . . . . . . 16 (∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚𝑏):(𝑏 × 𝑏)–1-1-onto𝑏) ↔ ∀𝑤 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑤 → (𝑚𝑤):(𝑤 × 𝑤)–1-1-onto𝑤))
3017, 29sylib 208 . . . . . . . . . . . . . . 15 ((((:ω–1-1-onto𝑡𝑡𝐴) ∧ ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚𝑏):(𝑏 × 𝑏)–1-1-onto𝑏)) ∧ 𝑔:𝒫 𝐴1-1 𝑛 ∈ ω (𝐴𝑚 𝑛)) → ∀𝑤 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑤 → (𝑚𝑤):(𝑤 × 𝑤)–1-1-onto𝑤))
31 eqid 2622 . . . . . . . . . . . . . . 15 OrdIso(𝑟, 𝑢) = OrdIso(𝑟, 𝑢)
32 eqid 2622 . . . . . . . . . . . . . . 15 (𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩) = (𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩)
33 eqid 2622 . . . . . . . . . . . . . . 15 ((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ (𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩)) = ((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ (𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩))
34 eqid 2622 . . . . . . . . . . . . . . 15 seq𝜔((𝑝 ∈ V, 𝑓 ∈ V ↦ (𝑥 ∈ (𝑢𝑚 suc 𝑝) ↦ ((𝑓‘(𝑥𝑝))((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ (𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩))(𝑥𝑝)))), {⟨∅, (OrdIso(𝑟, 𝑢)‘∅)⟩}) = seq𝜔((𝑝 ∈ V, 𝑓 ∈ V ↦ (𝑥 ∈ (𝑢𝑚 suc 𝑝) ↦ ((𝑓‘(𝑥𝑝))((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ (𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩))(𝑥𝑝)))), {⟨∅, (OrdIso(𝑟, 𝑢)‘∅)⟩})
35 oveq2 6658 . . . . . . . . . . . . . . . . 17 (𝑛 = 𝑘 → (𝑢𝑚 𝑛) = (𝑢𝑚 𝑘))
3635cbviunv 4559 . . . . . . . . . . . . . . . 16 𝑛 ∈ ω (𝑢𝑚 𝑛) = 𝑘 ∈ ω (𝑢𝑚 𝑘)
37 mpteq1 4737 . . . . . . . . . . . . . . . 16 ( 𝑛 ∈ ω (𝑢𝑚 𝑛) = 𝑘 ∈ ω (𝑢𝑚 𝑘) → (𝑦 𝑛 ∈ ω (𝑢𝑚 𝑛) ↦ ⟨dom 𝑦, ((seq𝜔((𝑝 ∈ V, 𝑓 ∈ V ↦ (𝑥 ∈ (𝑢𝑚 suc 𝑝) ↦ ((𝑓‘(𝑥𝑝))((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ (𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩))(𝑥𝑝)))), {⟨∅, (OrdIso(𝑟, 𝑢)‘∅)⟩})‘dom 𝑦)‘𝑦)⟩) = (𝑦 𝑘 ∈ ω (𝑢𝑚 𝑘) ↦ ⟨dom 𝑦, ((seq𝜔((𝑝 ∈ V, 𝑓 ∈ V ↦ (𝑥 ∈ (𝑢𝑚 suc 𝑝) ↦ ((𝑓‘(𝑥𝑝))((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ (𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩))(𝑥𝑝)))), {⟨∅, (OrdIso(𝑟, 𝑢)‘∅)⟩})‘dom 𝑦)‘𝑦)⟩))
3836, 37ax-mp 5 . . . . . . . . . . . . . . 15 (𝑦 𝑛 ∈ ω (𝑢𝑚 𝑛) ↦ ⟨dom 𝑦, ((seq𝜔((𝑝 ∈ V, 𝑓 ∈ V ↦ (𝑥 ∈ (𝑢𝑚 suc 𝑝) ↦ ((𝑓‘(𝑥𝑝))((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ (𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩))(𝑥𝑝)))), {⟨∅, (OrdIso(𝑟, 𝑢)‘∅)⟩})‘dom 𝑦)‘𝑦)⟩) = (𝑦 𝑘 ∈ ω (𝑢𝑚 𝑘) ↦ ⟨dom 𝑦, ((seq𝜔((𝑝 ∈ V, 𝑓 ∈ V ↦ (𝑥 ∈ (𝑢𝑚 suc 𝑝) ↦ ((𝑓‘(𝑥𝑝))((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ (𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩))(𝑥𝑝)))), {⟨∅, (OrdIso(𝑟, 𝑢)‘∅)⟩})‘dom 𝑦)‘𝑦)⟩)
39 eqid 2622 . . . . . . . . . . . . . . 15 (𝑥 ∈ ω, 𝑦𝑢 ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑥), 𝑦⟩) = (𝑥 ∈ ω, 𝑦𝑢 ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑥), 𝑦⟩)
40 eqid 2622 . . . . . . . . . . . . . . 15 ((((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ (𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩)) ∘ (𝑥 ∈ ω, 𝑦𝑢 ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑥), 𝑦⟩)) ∘ (𝑦 𝑛 ∈ ω (𝑢𝑚 𝑛) ↦ ⟨dom 𝑦, ((seq𝜔((𝑝 ∈ V, 𝑓 ∈ V ↦ (𝑥 ∈ (𝑢𝑚 suc 𝑝) ↦ ((𝑓‘(𝑥𝑝))((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ (𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩))(𝑥𝑝)))), {⟨∅, (OrdIso(𝑟, 𝑢)‘∅)⟩})‘dom 𝑦)‘𝑦)⟩)) = ((((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ (𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩)) ∘ (𝑥 ∈ ω, 𝑦𝑢 ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑥), 𝑦⟩)) ∘ (𝑦 𝑛 ∈ ω (𝑢𝑚 𝑛) ↦ ⟨dom 𝑦, ((seq𝜔((𝑝 ∈ V, 𝑓 ∈ V ↦ (𝑥 ∈ (𝑢𝑚 suc 𝑝) ↦ ((𝑓‘(𝑥𝑝))((OrdIso(𝑟, 𝑢) ∘ (𝑚‘dom OrdIso(𝑟, 𝑢))) ∘ (𝑠 ∈ dom OrdIso(𝑟, 𝑢), 𝑧 ∈ dom OrdIso(𝑟, 𝑢) ↦ ⟨(OrdIso(𝑟, 𝑢)‘𝑠), (OrdIso(𝑟, 𝑢)‘𝑧)⟩))(𝑥𝑝)))), {⟨∅, (OrdIso(𝑟, 𝑢)‘∅)⟩})‘dom 𝑦)‘𝑦)⟩))
4113, 14, 15, 16, 30, 31, 32, 33, 34, 38, 39, 40pwfseqlem5 9485 . . . . . . . . . . . . . 14 ¬ (((:ω–1-1-onto𝑡𝑡𝐴) ∧ ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚𝑏):(𝑏 × 𝑏)–1-1-onto𝑏)) ∧ 𝑔:𝒫 𝐴1-1 𝑛 ∈ ω (𝐴𝑚 𝑛))
4241imnani 439 . . . . . . . . . . . . 13 (((:ω–1-1-onto𝑡𝑡𝐴) ∧ ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚𝑏):(𝑏 × 𝑏)–1-1-onto𝑏)) → ¬ 𝑔:𝒫 𝐴1-1 𝑛 ∈ ω (𝐴𝑚 𝑛))
4342nexdv 1864 . . . . . . . . . . . 12 (((:ω–1-1-onto𝑡𝑡𝐴) ∧ ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚𝑏):(𝑏 × 𝑏)–1-1-onto𝑏)) → ¬ ∃𝑔 𝑔:𝒫 𝐴1-1 𝑛 ∈ ω (𝐴𝑚 𝑛))
44 brdomi 7966 . . . . . . . . . . . 12 (𝒫 𝐴 𝑛 ∈ ω (𝐴𝑚 𝑛) → ∃𝑔 𝑔:𝒫 𝐴1-1 𝑛 ∈ ω (𝐴𝑚 𝑛))
4543, 44nsyl 135 . . . . . . . . . . 11 (((:ω–1-1-onto𝑡𝑡𝐴) ∧ ∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚𝑏):(𝑏 × 𝑏)–1-1-onto𝑏)) → ¬ 𝒫 𝐴 𝑛 ∈ ω (𝐴𝑚 𝑛))
4645ex 450 . . . . . . . . . 10 ((:ω–1-1-onto𝑡𝑡𝐴) → (∀𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚𝑏):(𝑏 × 𝑏)–1-1-onto𝑏) → ¬ 𝒫 𝐴 𝑛 ∈ ω (𝐴𝑚 𝑛)))
4746exlimdv 1861 . . . . . . . . 9 ((:ω–1-1-onto𝑡𝑡𝐴) → (∃𝑚𝑏 ∈ (har‘𝒫 𝐴)(ω ⊆ 𝑏 → (𝑚𝑏):(𝑏 × 𝑏)–1-1-onto𝑏) → ¬ 𝒫 𝐴 𝑛 ∈ ω (𝐴𝑚 𝑛)))
487, 47mpi 20 . . . . . . . 8 ((:ω–1-1-onto𝑡𝑡𝐴) → ¬ 𝒫 𝐴 𝑛 ∈ ω (𝐴𝑚 𝑛))
4948ex 450 . . . . . . 7 (:ω–1-1-onto𝑡 → (𝑡𝐴 → ¬ 𝒫 𝐴 𝑛 ∈ ω (𝐴𝑚 𝑛)))
5049exlimiv 1858 . . . . . 6 (∃ :ω–1-1-onto𝑡 → (𝑡𝐴 → ¬ 𝒫 𝐴 𝑛 ∈ ω (𝐴𝑚 𝑛)))
514, 50sylbi 207 . . . . 5 (ω ≈ 𝑡 → (𝑡𝐴 → ¬ 𝒫 𝐴 𝑛 ∈ ω (𝐴𝑚 𝑛)))
5251imp 445 . . . 4 ((ω ≈ 𝑡𝑡𝐴) → ¬ 𝒫 𝐴 𝑛 ∈ ω (𝐴𝑚 𝑛))
5352exlimiv 1858 . . 3 (∃𝑡(ω ≈ 𝑡𝑡𝐴) → ¬ 𝒫 𝐴 𝑛 ∈ ω (𝐴𝑚 𝑛))
543, 53syl6bi 243 . 2 (𝐴 ∈ V → (ω ≼ 𝐴 → ¬ 𝒫 𝐴 𝑛 ∈ ω (𝐴𝑚 𝑛)))
552, 54mpcom 38 1 (ω ≼ 𝐴 → ¬ 𝒫 𝐴 𝑛 ∈ ω (𝐴𝑚 𝑛))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  wa 384  w3a 1037   = wceq 1483  wex 1704  wcel 1990  wral 2912  Vcvv 3200  wss 3574  c0 3915  𝒫 cpw 4158  {csn 4177  cop 4183   ciun 4520   class class class wbr 4653  cmpt 4729   We wwe 5072   × cxp 5112  ccnv 5113  dom cdm 5114  cres 5116  ccom 5118  Oncon0 5723  suc csuc 5725  1-1wf1 5885  1-1-ontowf1o 5887  cfv 5888  (class class class)co 6650  cmpt2 6652  ωcom 7065  seq𝜔cseqom 7542  𝑚 cmap 7857  cen 7952  cdom 7953  OrdIsocoi 8414  harchar 8461
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949  ax-inf2 8538
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-fal 1489  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-se 5074  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-isom 5897  df-riota 6611  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-1st 7168  df-2nd 7169  df-supp 7296  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-seqom 7543  df-1o 7560  df-2o 7561  df-oadd 7564  df-omul 7565  df-oexp 7566  df-er 7742  df-map 7859  df-en 7956  df-dom 7957  df-sdom 7958  df-fin 7959  df-fsupp 8276  df-oi 8415  df-har 8463  df-cnf 8559  df-card 8765
This theorem is referenced by:  pwxpndom2  9487
  Copyright terms: Public domain W3C validator