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

Theorem fin23lem20 10445
Description: Lemma for fin23 10497. 𝑋 is either contained in or disjoint from all input sets. (Contributed by Stefan O'Rear, 1-Nov-2014.)
Hypothesis
Ref Expression
fin23lem.a 𝑈 = seqω((𝑖 ∈ ω, 𝑢 ∈ V ↦ if(((𝑡‘𝑖) ∩ 𝑢) = ∅, 𝑢, ((𝑡‘𝑖) ∩ 𝑢))), ∪ ran 𝑡)
Assertion
Ref Expression
fin23lem20 (𝐴 ∈ ω → (∩ ran 𝑈 ⊆ (𝑡‘𝐴) ∨ (∩ ran 𝑈 ∩ (𝑡‘𝐴)) = ∅))
Distinct variable groups:   𝑡,𝑖,𝑢   𝐴,𝑖,𝑢   𝑈,𝑖,𝑢
Allowed substitution hints:   𝐴(𝑡)   𝑈(𝑡)

Proof of Theorem fin23lem20
StepHypRef Expression
1 fin23lem.a . . . . 5 𝑈 = seqω((𝑖 ∈ ω, 𝑢 ∈ V ↦ if(((𝑡‘𝑖) ∩ 𝑢) = ∅, 𝑢, ((𝑡‘𝑖) ∩ 𝑢))), ∪ ran 𝑡)
21fnseqom 8496 . . . 4 𝑈 Fn ω
3 peano2 7928 . . . 4 (𝐴 ∈ ω → suc 𝐴 ∈ ω)
4 fnfvelrn 7107 . . . 4 ((𝑈 Fn ω ∧ suc 𝐴 ∈ ω) → (𝑈‘suc 𝐴) ∈ ran 𝑈)
52, 3, 4sylancr 599 . . 3 (𝐴 ∈ ω → (𝑈‘suc 𝐴) ∈ ran 𝑈)
6 intss1 4926 . . 3 ((𝑈‘suc 𝐴) ∈ ran 𝑈 → ∩ ran 𝑈 ⊆ (𝑈‘suc 𝐴))
75, 6syl 18 . 2 (𝐴 ∈ ω → ∩ ran 𝑈 ⊆ (𝑈‘suc 𝐴))
81fin23lem19 10444 . 2 (𝐴 ∈ ω → ((𝑈‘suc 𝐴) ⊆ (𝑡‘𝐴) ∨ ((𝑈‘suc 𝐴) ∩ (𝑡‘𝐴)) = ∅))
9 sstr2 3920 . . 3 (∩ ran 𝑈 ⊆ (𝑈‘suc 𝐴) → ((𝑈‘suc 𝐴) ⊆ (𝑡‘𝐴) → ∩ ran 𝑈 ⊆ (𝑡‘𝐴)))
10 ssdisj 4416 . . . 4 ((∩ ran 𝑈 ⊆ (𝑈‘suc 𝐴) ∧ ((𝑈‘suc 𝐴) ∩ (𝑡‘𝐴)) = ∅) → (∩ ran 𝑈 ∩ (𝑡‘𝐴)) = ∅)
1110ex 418 . . 3 (∩ ran 𝑈 ⊆ (𝑈‘suc 𝐴) → (((𝑈‘suc 𝐴) ∩ (𝑡‘𝐴)) = ∅ → (∩ ran 𝑈 ∩ (𝑡‘𝐴)) = ∅))
129, 11orim12d 979 . 2 (∩ ran 𝑈 ⊆ (𝑈‘suc 𝐴) → (((𝑈‘suc 𝐴) ⊆ (𝑡‘𝐴) ∨ ((𝑈‘suc 𝐴) ∩ (𝑡‘𝐴)) = ∅) → (∩ ran 𝑈 ⊆ (𝑡‘𝐴) ∨ (∩ ran 𝑈 ∩ (𝑡‘𝐴)) = ∅)))
137, 8, 12sylc 66 1 (𝐴 ∈ ω → (∩ ran 𝑈 ⊆ (𝑡‘𝐴) ∨ (∩ ran 𝑈 ∩ (𝑡‘𝐴)) = ∅))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∨ wo 861   = wceq 1570   ∈ wcel 2147  Vcvv 3454   ⊆ wss 3900   ∩ cin 4092  ∅c0 4281  ifcif 4485  ∪ cuni 4870  ∩ cint 4910  ran crn 5657  suc csuc 6385   Fn wfn 6556  ‘cfv 6561   ∈ cmpo 7448  ωcom 7904  seqωcseqom 8488
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 5253  ax-nul 5264  ax-pr 5396  ax-un 7778
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 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-pred 6325  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-om 7905  df-2nd 8029  df-frecs 8330  df-wrecs 8361  df-recs 8410  df-rdg 8449  df-seqom 8489
This theorem is used by:  fin23lem30  10450
  Copyright terms: Public domain W3C validator