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

Theorem fin23lem16 9749
 Description: Lemma for fin23 9803. 𝑈 ranges over the original set; in particular ran 𝑈 is a set, although we do not assume here that 𝑈 is. (Contributed by Stefan O'Rear, 1-Nov-2014.)
Hypothesis
Ref Expression
fin23lem.a 𝑈 = seqω((𝑖 ∈ ω, 𝑢 ∈ V ↦ if(((𝑡𝑖) ∩ 𝑢) = ∅, 𝑢, ((𝑡𝑖) ∩ 𝑢))), ran 𝑡)
Assertion
Ref Expression
fin23lem16 ran 𝑈 = ran 𝑡
Distinct variable groups:   𝑡,𝑖,𝑢   𝑈,𝑖,𝑢
Allowed substitution hint:   𝑈(𝑡)

Proof of Theorem fin23lem16
Dummy variables 𝑎 𝑏 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 unissb 4861 . . 3 ( ran 𝑈 ran 𝑡 ↔ ∀𝑎 ∈ ran 𝑈 𝑎 ran 𝑡)
2 fin23lem.a . . . . . 6 𝑈 = seqω((𝑖 ∈ ω, 𝑢 ∈ V ↦ if(((𝑡𝑖) ∩ 𝑢) = ∅, 𝑢, ((𝑡𝑖) ∩ 𝑢))), ran 𝑡)
32fnseqom 8083 . . . . 5 𝑈 Fn ω
4 fvelrnb 6719 . . . . 5 (𝑈 Fn ω → (𝑎 ∈ ran 𝑈 ↔ ∃𝑏 ∈ ω (𝑈𝑏) = 𝑎))
53, 4ax-mp 5 . . . 4 (𝑎 ∈ ran 𝑈 ↔ ∃𝑏 ∈ ω (𝑈𝑏) = 𝑎)
6 peano1 7593 . . . . . . . 8 ∅ ∈ ω
7 0ss 4348 . . . . . . . . 9 ∅ ⊆ 𝑏
82fin23lem15 9748 . . . . . . . . 9 (((𝑏 ∈ ω ∧ ∅ ∈ ω) ∧ ∅ ⊆ 𝑏) → (𝑈𝑏) ⊆ (𝑈‘∅))
97, 8mpan2 689 . . . . . . . 8 ((𝑏 ∈ ω ∧ ∅ ∈ ω) → (𝑈𝑏) ⊆ (𝑈‘∅))
106, 9mpan2 689 . . . . . . 7 (𝑏 ∈ ω → (𝑈𝑏) ⊆ (𝑈‘∅))
11 vex 3496 . . . . . . . . . 10 𝑡 ∈ V
1211rnex 7609 . . . . . . . . 9 ran 𝑡 ∈ V
1312uniex 7459 . . . . . . . 8 ran 𝑡 ∈ V
142seqom0g 8084 . . . . . . . 8 ( ran 𝑡 ∈ V → (𝑈‘∅) = ran 𝑡)
1513, 14ax-mp 5 . . . . . . 7 (𝑈‘∅) = ran 𝑡
1610, 15sseqtrdi 4015 . . . . . 6 (𝑏 ∈ ω → (𝑈𝑏) ⊆ ran 𝑡)
17 sseq1 3990 . . . . . 6 ((𝑈𝑏) = 𝑎 → ((𝑈𝑏) ⊆ ran 𝑡𝑎 ran 𝑡))
1816, 17syl5ibcom 247 . . . . 5 (𝑏 ∈ ω → ((𝑈𝑏) = 𝑎𝑎 ran 𝑡))
1918rexlimiv 3278 . . . 4 (∃𝑏 ∈ ω (𝑈𝑏) = 𝑎𝑎 ran 𝑡)
205, 19sylbi 219 . . 3 (𝑎 ∈ ran 𝑈𝑎 ran 𝑡)
211, 20mprgbir 3151 . 2 ran 𝑈 ran 𝑡
22 fnfvelrn 6841 . . . . 5 ((𝑈 Fn ω ∧ ∅ ∈ ω) → (𝑈‘∅) ∈ ran 𝑈)
233, 6, 22mp2an 690 . . . 4 (𝑈‘∅) ∈ ran 𝑈
2415, 23eqeltrri 2908 . . 3 ran 𝑡 ∈ ran 𝑈
25 elssuni 4859 . . 3 ( ran 𝑡 ∈ ran 𝑈 ran 𝑡 ran 𝑈)
2624, 25ax-mp 5 . 2 ran 𝑡 ran 𝑈
2721, 26eqssi 3981 1 ran 𝑈 = ran 𝑡
 Colors of variables: wff setvar class Syntax hints:   ↔ wb 208   ∧ wa 398   = wceq 1530   ∈ wcel 2107  ∃wrex 3137  Vcvv 3493   ∩ cin 3933   ⊆ wss 3934  ∅c0 4289  ifcif 4465  ∪ cuni 4830  ran crn 5549   Fn wfn 6343  ‘cfv 6348   ∈ cmpo 7150  ωcom 7572  seqωcseqom 8075 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2791  ax-sep 5194  ax-nul 5201  ax-pow 5257  ax-pr 5320  ax-un 7453 This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1082  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2616  df-eu 2648  df-clab 2798  df-cleq 2812  df-clel 2891  df-nfc 2961  df-ne 3015  df-ral 3141  df-rex 3142  df-reu 3143  df-rab 3145  df-v 3495  df-sbc 3771  df-csb 3882  df-dif 3937  df-un 3939  df-in 3941  df-ss 3950  df-pss 3952  df-nul 4290  df-if 4466  df-pw 4539  df-sn 4560  df-pr 4562  df-tp 4564  df-op 4566  df-uni 4831  df-iun 4912  df-br 5058  df-opab 5120  df-mpt 5138  df-tr 5164  df-id 5453  df-eprel 5458  df-po 5467  df-so 5468  df-fr 5507  df-we 5509  df-xp 5554  df-rel 5555  df-cnv 5556  df-co 5557  df-dm 5558  df-rn 5559  df-res 5560  df-ima 5561  df-pred 6141  df-ord 6187  df-on 6188  df-lim 6189  df-suc 6190  df-iota 6307  df-fun 6350  df-fn 6351  df-f 6352  df-f1 6353  df-fo 6354  df-f1o 6355  df-fv 6356  df-ov 7151  df-oprab 7152  df-mpo 7153  df-om 7573  df-2nd 7682  df-wrecs 7939  df-recs 8000  df-rdg 8038  df-seqom 8076 This theorem is referenced by:  fin23lem17  9752  fin23lem31  9757
 Copyright terms: Public domain W3C validator