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

Theorem fin23lem20 10287
Description: Lemma for fin23 10339. 𝑋 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 8419 . . . 4 𝑈 Fn ω
3 peano2 7864 . . . 4 (𝐴 ∈ ω → suc 𝐴 ∈ ω)
4 fnfvelrn 7055 . . . 4 ((𝑈 Fn ω ∧ suc 𝐴 ∈ ω) → (𝑈‘suc 𝐴) ∈ ran 𝑈)
52, 3, 4sylancr 596 . . 3 (𝐴 ∈ ω → (𝑈‘suc 𝐴) ∈ ran 𝑈)
6 intss1 4918 . . 3 ((𝑈‘suc 𝐴) ∈ ran 𝑈 ran 𝑈 ⊆ (𝑈‘suc 𝐴))
75, 6syl 17 . 2 (𝐴 ∈ ω → ran 𝑈 ⊆ (𝑈‘suc 𝐴))
81fin23lem19 10286 . 2 (𝐴 ∈ ω → ((𝑈‘suc 𝐴) ⊆ (𝑡𝐴) ∨ ((𝑈‘suc 𝐴) ∩ (𝑡𝐴)) = ∅))
9 sstr2 3941 . . 3 ( ran 𝑈 ⊆ (𝑈‘suc 𝐴) → ((𝑈‘suc 𝐴) ⊆ (𝑡𝐴) → ran 𝑈 ⊆ (𝑡𝐴)))
10 ssdisj 4411 . . . 4 (( ran 𝑈 ⊆ (𝑈‘suc 𝐴) ∧ ((𝑈‘suc 𝐴) ∩ (𝑡𝐴)) = ∅) → ( ran 𝑈 ∩ (𝑡𝐴)) = ∅)
1110ex 416 . . 3 ( ran 𝑈 ⊆ (𝑈‘suc 𝐴) → (((𝑈‘suc 𝐴) ∩ (𝑡𝐴)) = ∅ → ( ran 𝑈 ∩ (𝑡𝐴)) = ∅))
129, 11orim12d 977 . 2 ( ran 𝑈 ⊆ (𝑈‘suc 𝐴) → (((𝑈‘suc 𝐴) ⊆ (𝑡𝐴) ∨ ((𝑈‘suc 𝐴) ∩ (𝑡𝐴)) = ∅) → ( ran 𝑈 ⊆ (𝑡𝐴) ∨ ( ran 𝑈 ∩ (𝑡𝐴)) = ∅)))
137, 8, 12sylc 65 1 (𝐴 ∈ ω → ( ran 𝑈 ⊆ (𝑡𝐴) ∨ ( ran 𝑈 ∩ (𝑡𝐴)) = ∅))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wo 858   = wceq 1559  wcel 2141  Vcvv 3453  cin 3901  wss 3902  c0 4283  ifcif 4477   cuni 4862   cint 4902  ran crn 5644  suc csuc 6342   Fn wfn 6510  cfv 6515  cmpo 7392  ωcom 7840  seqωcseqom 8411
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-10 2174  ax-11 2190  ax-12 2211  ax-ext 2733  ax-sep 5243  ax-nul 5253  ax-pr 5387  ax-un 7712
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1098  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-nf 1803  df-sb 2090  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3076  df-rex 3086  df-reu 3367  df-rab 3414  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4580  df-pr 4582  df-op 4586  df-uni 4863  df-int 4903  df-iun 4948  df-br 5098  df-opab 5160  df-mpt 5179  df-tr 5205  df-id 5538  df-eprel 5543  df-po 5551  df-so 5552  df-fr 5596  df-we 5598  df-xp 5649  df-rel 5650  df-cnv 5651  df-co 5652  df-dm 5653  df-rn 5654  df-res 5655  df-ima 5656  df-pred 6282  df-ord 6343  df-on 6344  df-lim 6345  df-suc 6346  df-iota 6471  df-fun 6517  df-fn 6518  df-f 6519  df-f1 6520  df-fo 6521  df-f1o 6522  df-fv 6523  df-ov 7393  df-oprab 7394  df-mpo 7395  df-om 7841  df-2nd 7965  df-frecs 8255  df-wrecs 8286  df-recs 8335  df-rdg 8374  df-seqom 8412
This theorem is referenced by:  fin23lem30  10292
  Copyright terms: Public domain W3C validator