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

Theorem fin23lem21 10456
Description: Lemma for fin23 10506. 𝑋 is not empty. We only need here that 𝑡 has at least one set in its range besides ∅; the much stronger hypothesis here will serve as our induction hypothesis though. (Contributed by Stefan O'Rear, 1-Nov-2014.) (Revised by Mario Carneiro, 6-May-2015.)
Hypotheses
Ref Expression
fin23lem.a 𝑈 = seqω((𝑖 ∈ ω, 𝑢 ∈ V ↦ if(((𝑡‘𝑖) ∩ 𝑢) = ∅, 𝑢, ((𝑡‘𝑖) ∩ 𝑢))), ∪ ran 𝑡)
fin23lem17.f 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔 ↑m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎‘𝑥) → ∩ ran 𝑎 ∈ ran 𝑎)}
Assertion
Ref Expression
fin23lem21 ((∪ ran 𝑡 ∈ 𝐹 ∧ 𝑡:ω⟶1-1𝑉) → ∩ ran 𝑈 ≠ ∅)
Distinct variable groups:   𝑔,𝑖,𝑡,𝑢,𝑥,𝑎   𝐹,𝑎,𝑡   𝑉,𝑎   𝑥,𝑎   𝑈,𝑎,𝑖,𝑢   𝑔,𝑎
Allowed substitution hints:   𝑈(𝑥, 𝑡, 𝑔)   𝐹(𝑥, 𝑢, 𝑔, 𝑖)   𝑉(𝑥, 𝑢, 𝑡, 𝑔, 𝑖)

Proof of Theorem fin23lem21
StepHypRef Expression
1 fin23lem.a . . 3 𝑈 = seqω((𝑖 ∈ ω, 𝑢 ∈ V ↦ if(((𝑡‘𝑖) ∩ 𝑢) = ∅, 𝑢, ((𝑡‘𝑖) ∩ 𝑢))), ∪ ran 𝑡)
2 fin23lem17.f . . 3 𝐹 = {𝑔 ∣ ∀𝑎 ∈ (𝒫 𝑔 ↑m ω)(∀𝑥 ∈ ω (𝑎‘suc 𝑥) ⊆ (𝑎‘𝑥) → ∩ ran 𝑎 ∈ ran 𝑎)}
31, 2fin23lem17 10455 . 2 ((∪ ran 𝑡 ∈ 𝐹 ∧ 𝑡:ω⟶1-1𝑉) → ∩ ran 𝑈 ∈ ran 𝑈)
41fnseqom 8503 . . . . 5 𝑈 Fn ω
5 fvelrnb 6976 . . . . 5 (𝑈 Fn ω → (∩ ran 𝑈 ∈ ran 𝑈 ↔ ∃𝑎 ∈ ω (𝑈‘𝑎) = ∩ ran 𝑈))
64, 5ax-mp 5 . . . 4 (∩ ran 𝑈 ∈ ran 𝑈 ↔ ∃𝑎 ∈ ω (𝑈‘𝑎) = ∩ ran 𝑈)
7 id 23 . . . . . . 7 (𝑎 ∈ ω → 𝑎 ∈ ω)
8 vex 3458 . . . . . . . . . 10 𝑡 ∈ V
9 f1f1orn 6866 . . . . . . . . . 10 (𝑡:ω⟶1-1𝑉 → 𝑡:ω⟶1-1ontoran 𝑡)
10 f1oen3g 9031 . . . . . . . . . 10 ((𝑡 ∈ V ∧ 𝑡:ω⟶1-1ontoran 𝑡) → ω ≈ ran 𝑡)
118, 9, 10sylancr 599 . . . . . . . . 9 (𝑡:ω⟶1-1𝑉 → ω ≈ ran 𝑡)
12 ominf 9293 . . . . . . . . 9 ¬ ω ∈ Fin
13 ssdif0 4317 . . . . . . . . . . 11 (ran 𝑡 ⊆ {∅} ↔ (ran 𝑡 ∖ {∅}) = ∅)
14 snfi 9109 . . . . . . . . . . . . 13 {∅} ∈ Fin
15 ssfi 9226 . . . . . . . . . . . . 13 (({∅} ∈ Fin ∧ ran 𝑡 ⊆ {∅}) → ran 𝑡 ∈ Fin)
1614, 15mpan 703 . . . . . . . . . . . 12 (ran 𝑡 ⊆ {∅} → ran 𝑡 ∈ Fin)
17 enfi 9240 . . . . . . . . . . . 12 (ω ≈ ran 𝑡 → (ω ∈ Fin ↔ ran 𝑡 ∈ Fin))
1816, 17imbitrrid 249 . . . . . . . . . . 11 (ω ≈ ran 𝑡 → (ran 𝑡 ⊆ {∅} → ω ∈ Fin))
1913, 18biimtrrid 246 . . . . . . . . . 10 (ω ≈ ran 𝑡 → ((ran 𝑡 ∖ {∅}) = ∅ → ω ∈ Fin))
2019necon3bd 2973 . . . . . . . . 9 (ω ≈ ran 𝑡 → (¬ ω ∈ Fin → (ran 𝑡 ∖ {∅}) ≠ ∅))
2111, 12, 20mpisyl 22 . . . . . . . 8 (𝑡:ω⟶1-1𝑉 → (ran 𝑡 ∖ {∅}) ≠ ∅)
22 n0 4303 . . . . . . . . 9 ((ran 𝑡 ∖ {∅}) ≠ ∅ ↔ ∃𝑎 𝑎 ∈ (ran 𝑡 ∖ {∅}))
23 eldifsn 4750 . . . . . . . . . . 11 (𝑎 ∈ (ran 𝑡 ∖ {∅}) ↔ (𝑎 ∈ ran 𝑡 ∧ 𝑎 ≠ ∅))
24 elssuni 4904 . . . . . . . . . . . 12 (𝑎 ∈ ran 𝑡 → 𝑎 ⊆ ∪ ran 𝑡)
25 ssn0 4358 . . . . . . . . . . . 12 ((𝑎 ⊆ ∪ ran 𝑡 ∧ 𝑎 ≠ ∅) → ∪ ran 𝑡 ≠ ∅)
2624, 25sylan 592 . . . . . . . . . . 11 ((𝑎 ∈ ran 𝑡 ∧ 𝑎 ≠ ∅) → ∪ ran 𝑡 ≠ ∅)
2723, 26sylbi 220 . . . . . . . . . 10 (𝑎 ∈ (ran 𝑡 ∖ {∅}) → ∪ ran 𝑡 ≠ ∅)
2827exlimiv 1965 . . . . . . . . 9 (∃𝑎 𝑎 ∈ (ran 𝑡 ∖ {∅}) → ∪ ran 𝑡 ≠ ∅)
2922, 28sylbi 220 . . . . . . . 8 ((ran 𝑡 ∖ {∅}) ≠ ∅ → ∪ ran 𝑡 ≠ ∅)
3021, 29syl 18 . . . . . . 7 (𝑡:ω⟶1-1𝑉 → ∪ ran 𝑡 ≠ ∅)
311fin23lem14 10450 . . . . . . 7 ((𝑎 ∈ ω ∧ ∪ ran 𝑡 ≠ ∅) → (𝑈‘𝑎) ≠ ∅)
327, 30, 31syl2anr 609 . . . . . 6 ((𝑡:ω⟶1-1𝑉 ∧ 𝑎 ∈ ω) → (𝑈‘𝑎) ≠ ∅)
33 neeq1 3021 . . . . . 6 ((𝑈‘𝑎) = ∩ ran 𝑈 → ((𝑈‘𝑎) ≠ ∅ ↔ ∩ ran 𝑈 ≠ ∅))
3432, 33syl5ibcom 248 . . . . 5 ((𝑡:ω⟶1-1𝑉 ∧ 𝑎 ∈ ω) → ((𝑈‘𝑎) = ∩ ran 𝑈 → ∩ ran 𝑈 ≠ ∅))
3534rexlimdva 3167 . . . 4 (𝑡:ω⟶1-1𝑉 → (∃𝑎 ∈ ω (𝑈‘𝑎) = ∩ ran 𝑈 → ∩ ran 𝑈 ≠ ∅))
366, 35biimtrid 245 . . 3 (𝑡:ω⟶1-1𝑉 → (∩ ran 𝑈 ∈ ran 𝑈 → ∩ ran 𝑈 ≠ ∅))
3736adantl 487 . 2 ((∪ ran 𝑡 ∈ 𝐹 ∧ 𝑡:ω⟶1-1𝑉) → (∩ ran 𝑈 ∈ ran 𝑈 → ∩ ran 𝑈 ≠ ∅))
383, 37mpd 16 1 ((∪ ran 𝑡 ∈ 𝐹 ∧ 𝑡:ω⟶1-1𝑉) → ∩ ran 𝑈 ≠ ∅)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147  {cab 2741   ≠ wne 2959  ∀wral 3080  ∃wrex 3090  Vcvv 3454   ⊆ wss 3900   ∖ cdif 4048   ∩ cin 4092  ∅c0 4281  ifcif 4485  𝒫 cpw 4560  {csn 4588  ∪ cuni 4872  ∩ cint 4912   class class class wbr 5108  ran crn 5659  suc csuc 6390   Fn wfn 6561  ⟶1-1wf1 6563  ⟶1-1ontowf1o 6565  ‘cfv 6566  (class class class)co 7451   ∈ cmpo 7453  ωcom 7911  seqωcseqom 8495   ↑m cmap 8885   ≈ cen 9008  Fincfn 9011
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-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
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-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-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-seqom 8496  df-1o 8514  df-map 8887  df-en 9012  df-dom 9013  df-sdom 9014  df-fin 9015
This theorem is used by:  fin23lem31  10460
  Copyright terms: Public domain W3C validator