Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > fin23lem20 | Structured version Visualization version GIF version |
Description: Lemma for fin23 9813. 𝑋 is either contained in or disjoint from all input sets. (Contributed by Stefan O'Rear, 1-Nov-2014.) |
Ref | Expression |
---|---|
fin23lem.a | ⊢ 𝑈 = seqω((𝑖 ∈ ω, 𝑢 ∈ V ↦ if(((𝑡‘𝑖) ∩ 𝑢) = ∅, 𝑢, ((𝑡‘𝑖) ∩ 𝑢))), ∪ ran 𝑡) |
Ref | Expression |
---|---|
fin23lem20 | ⊢ (𝐴 ∈ ω → (∩ ran 𝑈 ⊆ (𝑡‘𝐴) ∨ (∩ ran 𝑈 ∩ (𝑡‘𝐴)) = ∅)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | fin23lem.a | . . . . 5 ⊢ 𝑈 = seqω((𝑖 ∈ ω, 𝑢 ∈ V ↦ if(((𝑡‘𝑖) ∩ 𝑢) = ∅, 𝑢, ((𝑡‘𝑖) ∩ 𝑢))), ∪ ran 𝑡) | |
2 | 1 | fnseqom 8093 | . . . 4 ⊢ 𝑈 Fn ω |
3 | peano2 7604 | . . . 4 ⊢ (𝐴 ∈ ω → suc 𝐴 ∈ ω) | |
4 | fnfvelrn 6850 | . . . 4 ⊢ ((𝑈 Fn ω ∧ suc 𝐴 ∈ ω) → (𝑈‘suc 𝐴) ∈ ran 𝑈) | |
5 | 2, 3, 4 | sylancr 589 | . . 3 ⊢ (𝐴 ∈ ω → (𝑈‘suc 𝐴) ∈ ran 𝑈) |
6 | intss1 4893 | . . 3 ⊢ ((𝑈‘suc 𝐴) ∈ ran 𝑈 → ∩ ran 𝑈 ⊆ (𝑈‘suc 𝐴)) | |
7 | 5, 6 | syl 17 | . 2 ⊢ (𝐴 ∈ ω → ∩ ran 𝑈 ⊆ (𝑈‘suc 𝐴)) |
8 | 1 | fin23lem19 9760 | . 2 ⊢ (𝐴 ∈ ω → ((𝑈‘suc 𝐴) ⊆ (𝑡‘𝐴) ∨ ((𝑈‘suc 𝐴) ∩ (𝑡‘𝐴)) = ∅)) |
9 | sstr2 3976 | . . 3 ⊢ (∩ ran 𝑈 ⊆ (𝑈‘suc 𝐴) → ((𝑈‘suc 𝐴) ⊆ (𝑡‘𝐴) → ∩ ran 𝑈 ⊆ (𝑡‘𝐴))) | |
10 | ssdisj 4411 | . . . 4 ⊢ ((∩ ran 𝑈 ⊆ (𝑈‘suc 𝐴) ∧ ((𝑈‘suc 𝐴) ∩ (𝑡‘𝐴)) = ∅) → (∩ ran 𝑈 ∩ (𝑡‘𝐴)) = ∅) | |
11 | 10 | ex 415 | . . 3 ⊢ (∩ ran 𝑈 ⊆ (𝑈‘suc 𝐴) → (((𝑈‘suc 𝐴) ∩ (𝑡‘𝐴)) = ∅ → (∩ ran 𝑈 ∩ (𝑡‘𝐴)) = ∅)) |
12 | 9, 11 | orim12d 961 | . 2 ⊢ (∩ ran 𝑈 ⊆ (𝑈‘suc 𝐴) → (((𝑈‘suc 𝐴) ⊆ (𝑡‘𝐴) ∨ ((𝑈‘suc 𝐴) ∩ (𝑡‘𝐴)) = ∅) → (∩ ran 𝑈 ⊆ (𝑡‘𝐴) ∨ (∩ ran 𝑈 ∩ (𝑡‘𝐴)) = ∅))) |
13 | 7, 8, 12 | sylc 65 | 1 ⊢ (𝐴 ∈ ω → (∩ ran 𝑈 ⊆ (𝑡‘𝐴) ∨ (∩ ran 𝑈 ∩ (𝑡‘𝐴)) = ∅)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∨ wo 843 = wceq 1537 ∈ wcel 2114 Vcvv 3496 ∩ cin 3937 ⊆ wss 3938 ∅c0 4293 ifcif 4469 ∪ cuni 4840 ∩ cint 4878 ran crn 5558 suc csuc 6195 Fn wfn 6352 ‘cfv 6357 ∈ cmpo 7160 ωcom 7582 seqωcseqom 8085 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2795 ax-sep 5205 ax-nul 5212 ax-pow 5268 ax-pr 5332 ax-un 7463 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2802 df-cleq 2816 df-clel 2895 df-nfc 2965 df-ne 3019 df-ral 3145 df-rex 3146 df-reu 3147 df-rab 3149 df-v 3498 df-sbc 3775 df-csb 3886 df-dif 3941 df-un 3943 df-in 3945 df-ss 3954 df-pss 3956 df-nul 4294 df-if 4470 df-pw 4543 df-sn 4570 df-pr 4572 df-tp 4574 df-op 4576 df-uni 4841 df-int 4879 df-iun 4923 df-br 5069 df-opab 5131 df-mpt 5149 df-tr 5175 df-id 5462 df-eprel 5467 df-po 5476 df-so 5477 df-fr 5516 df-we 5518 df-xp 5563 df-rel 5564 df-cnv 5565 df-co 5566 df-dm 5567 df-rn 5568 df-res 5569 df-ima 5570 df-pred 6150 df-ord 6196 df-on 6197 df-lim 6198 df-suc 6199 df-iota 6316 df-fun 6359 df-fn 6360 df-f 6361 df-f1 6362 df-fo 6363 df-f1o 6364 df-fv 6365 df-ov 7161 df-oprab 7162 df-mpo 7163 df-om 7583 df-2nd 7692 df-wrecs 7949 df-recs 8010 df-rdg 8048 df-seqom 8086 |
This theorem is referenced by: fin23lem30 9766 |
Copyright terms: Public domain | W3C validator |