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

Theorem finsschain 9329
Description: A finite subset of the union of a superset chain is a subset of some element of the chain. A useful preliminary result for alexsub 24272 and others. (Contributed by Jeff Hankins, 25-Jan-2010.) (Proof shortened by Mario Carneiro, 11-Feb-2015.) (Revised by Mario Carneiro, 18-May-2015.)
Assertion
Ref Expression
finsschain (((𝐴 ≠ ∅ ∧ [] Or 𝐴) ∧ (𝐵 ∈ Fin ∧ 𝐵 𝐴)) → ∃𝑧𝐴 𝐵𝑧)
Distinct variable groups:   𝑧,𝐴   𝑧,𝐵

Proof of Theorem finsschain
Dummy variables 𝑎 𝑏 𝑐 𝑢 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 sseq1 3959 . . . . . 6 (𝑎 = ∅ → (𝑎 𝐴 ↔ ∅ ⊆ 𝐴))
2 sseq1 3959 . . . . . . 7 (𝑎 = ∅ → (𝑎𝑧 ↔ ∅ ⊆ 𝑧))
32rexbidv 3188 . . . . . 6 (𝑎 = ∅ → (∃𝑧𝐴 𝑎𝑧 ↔ ∃𝑧𝐴 ∅ ⊆ 𝑧))
41, 3imbi12d 347 . . . . 5 (𝑎 = ∅ → ((𝑎 𝐴 → ∃𝑧𝐴 𝑎𝑧) ↔ (∅ ⊆ 𝐴 → ∃𝑧𝐴 ∅ ⊆ 𝑧)))
54imbi2d 343 . . . 4 (𝑎 = ∅ → (((𝐴 ≠ ∅ ∧ [] Or 𝐴) → (𝑎 𝐴 → ∃𝑧𝐴 𝑎𝑧)) ↔ ((𝐴 ≠ ∅ ∧ [] Or 𝐴) → (∅ ⊆ 𝐴 → ∃𝑧𝐴 ∅ ⊆ 𝑧))))
6 sseq1 3959 . . . . . 6 (𝑎 = 𝑏 → (𝑎 𝐴𝑏 𝐴))
7 sseq1 3959 . . . . . . 7 (𝑎 = 𝑏 → (𝑎𝑧𝑏𝑧))
87rexbidv 3188 . . . . . 6 (𝑎 = 𝑏 → (∃𝑧𝐴 𝑎𝑧 ↔ ∃𝑧𝐴 𝑏𝑧))
96, 8imbi12d 347 . . . . 5 (𝑎 = 𝑏 → ((𝑎 𝐴 → ∃𝑧𝐴 𝑎𝑧) ↔ (𝑏 𝐴 → ∃𝑧𝐴 𝑏𝑧)))
109imbi2d 343 . . . 4 (𝑎 = 𝑏 → (((𝐴 ≠ ∅ ∧ [] Or 𝐴) → (𝑎 𝐴 → ∃𝑧𝐴 𝑎𝑧)) ↔ ((𝐴 ≠ ∅ ∧ [] Or 𝐴) → (𝑏 𝐴 → ∃𝑧𝐴 𝑏𝑧))))
11 sseq1 3959 . . . . . 6 (𝑎 = (𝑏 ∪ {𝑐}) → (𝑎 𝐴 ↔ (𝑏 ∪ {𝑐}) ⊆ 𝐴))
12 sseq1 3959 . . . . . . 7 (𝑎 = (𝑏 ∪ {𝑐}) → (𝑎𝑧 ↔ (𝑏 ∪ {𝑐}) ⊆ 𝑧))
1312rexbidv 3188 . . . . . 6 (𝑎 = (𝑏 ∪ {𝑐}) → (∃𝑧𝐴 𝑎𝑧 ↔ ∃𝑧𝐴 (𝑏 ∪ {𝑐}) ⊆ 𝑧))
1411, 13imbi12d 347 . . . . 5 (𝑎 = (𝑏 ∪ {𝑐}) → ((𝑎 𝐴 → ∃𝑧𝐴 𝑎𝑧) ↔ ((𝑏 ∪ {𝑐}) ⊆ 𝐴 → ∃𝑧𝐴 (𝑏 ∪ {𝑐}) ⊆ 𝑧)))
1514imbi2d 343 . . . 4 (𝑎 = (𝑏 ∪ {𝑐}) → (((𝐴 ≠ ∅ ∧ [] Or 𝐴) → (𝑎 𝐴 → ∃𝑧𝐴 𝑎𝑧)) ↔ ((𝐴 ≠ ∅ ∧ [] Or 𝐴) → ((𝑏 ∪ {𝑐}) ⊆ 𝐴 → ∃𝑧𝐴 (𝑏 ∪ {𝑐}) ⊆ 𝑧))))
16 sseq1 3959 . . . . . 6 (𝑎 = 𝐵 → (𝑎 𝐴𝐵 𝐴))
17 sseq1 3959 . . . . . . 7 (𝑎 = 𝐵 → (𝑎𝑧𝐵𝑧))
1817rexbidv 3188 . . . . . 6 (𝑎 = 𝐵 → (∃𝑧𝐴 𝑎𝑧 ↔ ∃𝑧𝐴 𝐵𝑧))
1916, 18imbi12d 347 . . . . 5 (𝑎 = 𝐵 → ((𝑎 𝐴 → ∃𝑧𝐴 𝑎𝑧) ↔ (𝐵 𝐴 → ∃𝑧𝐴 𝐵𝑧)))
2019imbi2d 343 . . . 4 (𝑎 = 𝐵 → (((𝐴 ≠ ∅ ∧ [] Or 𝐴) → (𝑎 𝐴 → ∃𝑧𝐴 𝑎𝑧)) ↔ ((𝐴 ≠ ∅ ∧ [] Or 𝐴) → (𝐵 𝐴 → ∃𝑧𝐴 𝐵𝑧))))
21 0ss 4353 . . . . . . . 8 ∅ ⊆ 𝑧
2221rgenw 3082 . . . . . . 7 𝑧𝐴 ∅ ⊆ 𝑧
23 r19.2z 4458 . . . . . . 7 ((𝐴 ≠ ∅ ∧ ∀𝑧𝐴 ∅ ⊆ 𝑧) → ∃𝑧𝐴 ∅ ⊆ 𝑧)
2422, 23mpan2 704 . . . . . 6 (𝐴 ≠ ∅ → ∃𝑧𝐴 ∅ ⊆ 𝑧)
2524adantr 486 . . . . 5 ((𝐴 ≠ ∅ ∧ [] Or 𝐴) → ∃𝑧𝐴 ∅ ⊆ 𝑧)
2625a1d 26 . . . 4 ((𝐴 ≠ ∅ ∧ [] Or 𝐴) → (∅ ⊆ 𝐴 → ∃𝑧𝐴 ∅ ⊆ 𝑧))
27 id 23 . . . . . . . . 9 ((𝑏 ∪ {𝑐}) ⊆ 𝐴 → (𝑏 ∪ {𝑐}) ⊆ 𝐴)
2827unssad 4142 . . . . . . . 8 ((𝑏 ∪ {𝑐}) ⊆ 𝐴𝑏 𝐴)
2928imim1i 64 . . . . . . 7 ((𝑏 𝐴 → ∃𝑧𝐴 𝑏𝑧) → ((𝑏 ∪ {𝑐}) ⊆ 𝐴 → ∃𝑧𝐴 𝑏𝑧))
30 sseq2 3960 . . . . . . . . . . 11 (𝑧 = 𝑤 → (𝑏𝑧𝑏𝑤))
3130cbvrexvw 3243 . . . . . . . . . 10 (∃𝑧𝐴 𝑏𝑧 ↔ ∃𝑤𝐴 𝑏𝑤)
32 simpr 490 . . . . . . . . . . . . . 14 (((𝐴 ≠ ∅ ∧ [] Or 𝐴) ∧ (𝑏 ∪ {𝑐}) ⊆ 𝐴) → (𝑏 ∪ {𝑐}) ⊆ 𝐴)
3332unssbd 4143 . . . . . . . . . . . . 13 (((𝐴 ≠ ∅ ∧ [] Or 𝐴) ∧ (𝑏 ∪ {𝑐}) ⊆ 𝐴) → {𝑐} ⊆ 𝐴)
34 vex 3457 . . . . . . . . . . . . . 14 𝑐 ∈ V
3534snss 4748 . . . . . . . . . . . . 13 (𝑐 𝐴 ↔ {𝑐} ⊆ 𝐴)
3633, 35sylibr 237 . . . . . . . . . . . 12 (((𝐴 ≠ ∅ ∧ [] Or 𝐴) ∧ (𝑏 ∪ {𝑐}) ⊆ 𝐴) → 𝑐 𝐴)
37 eluni2 4874 . . . . . . . . . . . 12 (𝑐 𝐴 ↔ ∃𝑢𝐴 𝑐𝑢)
3836, 37sylib 221 . . . . . . . . . . 11 (((𝐴 ≠ ∅ ∧ [] Or 𝐴) ∧ (𝑏 ∪ {𝑐}) ⊆ 𝐴) → ∃𝑢𝐴 𝑐𝑢)
39 reeanv 3236 . . . . . . . . . . . 12 (∃𝑢𝐴𝑤𝐴 (𝑐𝑢𝑏𝑤) ↔ (∃𝑢𝐴 𝑐𝑢 ∧ ∃𝑤𝐴 𝑏𝑤))
40 simpllr 788 . . . . . . . . . . . . . . . 16 ((((𝐴 ≠ ∅ ∧ [] Or 𝐴) ∧ (𝑏 ∪ {𝑐}) ⊆ 𝐴) ∧ ((𝑢𝐴𝑤𝐴) ∧ (𝑐𝑢𝑏𝑤))) → [] Or 𝐴)
41 simprlr 792 . . . . . . . . . . . . . . . 16 ((((𝐴 ≠ ∅ ∧ [] Or 𝐴) ∧ (𝑏 ∪ {𝑐}) ⊆ 𝐴) ∧ ((𝑢𝐴𝑤𝐴) ∧ (𝑐𝑢𝑏𝑤))) → 𝑤𝐴)
42 simprll 791 . . . . . . . . . . . . . . . 16 ((((𝐴 ≠ ∅ ∧ [] Or 𝐴) ∧ (𝑏 ∪ {𝑐}) ⊆ 𝐴) ∧ ((𝑢𝐴𝑤𝐴) ∧ (𝑐𝑢𝑏𝑤))) → 𝑢𝐴)
43 sorpssun 7734 . . . . . . . . . . . . . . . 16 (( [] Or 𝐴 ∧ (𝑤𝐴𝑢𝐴)) → (𝑤𝑢) ∈ 𝐴)
4440, 41, 42, 43syl12anc 850 . . . . . . . . . . . . . . 15 ((((𝐴 ≠ ∅ ∧ [] Or 𝐴) ∧ (𝑏 ∪ {𝑐}) ⊆ 𝐴) ∧ ((𝑢𝐴𝑤𝐴) ∧ (𝑐𝑢𝑏𝑤))) → (𝑤𝑢) ∈ 𝐴)
45 simprrr 794 . . . . . . . . . . . . . . . 16 ((((𝐴 ≠ ∅ ∧ [] Or 𝐴) ∧ (𝑏 ∪ {𝑐}) ⊆ 𝐴) ∧ ((𝑢𝐴𝑤𝐴) ∧ (𝑐𝑢𝑏𝑤))) → 𝑏𝑤)
46 simprrl 793 . . . . . . . . . . . . . . . . 17 ((((𝐴 ≠ ∅ ∧ [] Or 𝐴) ∧ (𝑏 ∪ {𝑐}) ⊆ 𝐴) ∧ ((𝑢𝐴𝑤𝐴) ∧ (𝑐𝑢𝑏𝑤))) → 𝑐𝑢)
4746snssd 4750 . . . . . . . . . . . . . . . 16 ((((𝐴 ≠ ∅ ∧ [] Or 𝐴) ∧ (𝑏 ∪ {𝑐}) ⊆ 𝐴) ∧ ((𝑢𝐴𝑤𝐴) ∧ (𝑐𝑢𝑏𝑤))) → {𝑐} ⊆ 𝑢)
48 unss12 4137 . . . . . . . . . . . . . . . 16 ((𝑏𝑤 ∧ {𝑐} ⊆ 𝑢) → (𝑏 ∪ {𝑐}) ⊆ (𝑤𝑢))
4945, 47, 48syl2anc 596 . . . . . . . . . . . . . . 15 ((((𝐴 ≠ ∅ ∧ [] Or 𝐴) ∧ (𝑏 ∪ {𝑐}) ⊆ 𝐴) ∧ ((𝑢𝐴𝑤𝐴) ∧ (𝑐𝑢𝑏𝑤))) → (𝑏 ∪ {𝑐}) ⊆ (𝑤𝑢))
50 sseq2 3960 . . . . . . . . . . . . . . . 16 (𝑧 = (𝑤𝑢) → ((𝑏 ∪ {𝑐}) ⊆ 𝑧 ↔ (𝑏 ∪ {𝑐}) ⊆ (𝑤𝑢)))
5150rspcev 3579 . . . . . . . . . . . . . . 15 (((𝑤𝑢) ∈ 𝐴 ∧ (𝑏 ∪ {𝑐}) ⊆ (𝑤𝑢)) → ∃𝑧𝐴 (𝑏 ∪ {𝑐}) ⊆ 𝑧)
5244, 49, 51syl2anc 596 . . . . . . . . . . . . . 14 ((((𝐴 ≠ ∅ ∧ [] Or 𝐴) ∧ (𝑏 ∪ {𝑐}) ⊆ 𝐴) ∧ ((𝑢𝐴𝑤𝐴) ∧ (𝑐𝑢𝑏𝑤))) → ∃𝑧𝐴 (𝑏 ∪ {𝑐}) ⊆ 𝑧)
5352expr 462 . . . . . . . . . . . . 13 ((((𝐴 ≠ ∅ ∧ [] Or 𝐴) ∧ (𝑏 ∪ {𝑐}) ⊆ 𝐴) ∧ (𝑢𝐴𝑤𝐴)) → ((𝑐𝑢𝑏𝑤) → ∃𝑧𝐴 (𝑏 ∪ {𝑐}) ⊆ 𝑧))
5453rexlimdvva 3221 . . . . . . . . . . . 12 (((𝐴 ≠ ∅ ∧ [] Or 𝐴) ∧ (𝑏 ∪ {𝑐}) ⊆ 𝐴) → (∃𝑢𝐴𝑤𝐴 (𝑐𝑢𝑏𝑤) → ∃𝑧𝐴 (𝑏 ∪ {𝑐}) ⊆ 𝑧))
5539, 54biimtrrid 246 . . . . . . . . . . 11 (((𝐴 ≠ ∅ ∧ [] Or 𝐴) ∧ (𝑏 ∪ {𝑐}) ⊆ 𝐴) → ((∃𝑢𝐴 𝑐𝑢 ∧ ∃𝑤𝐴 𝑏𝑤) → ∃𝑧𝐴 (𝑏 ∪ {𝑐}) ⊆ 𝑧))
5638, 55mpand 708 . . . . . . . . . 10 (((𝐴 ≠ ∅ ∧ [] Or 𝐴) ∧ (𝑏 ∪ {𝑐}) ⊆ 𝐴) → (∃𝑤𝐴 𝑏𝑤 → ∃𝑧𝐴 (𝑏 ∪ {𝑐}) ⊆ 𝑧))
5731, 56biimtrid 245 . . . . . . . . 9 (((𝐴 ≠ ∅ ∧ [] Or 𝐴) ∧ (𝑏 ∪ {𝑐}) ⊆ 𝐴) → (∃𝑧𝐴 𝑏𝑧 → ∃𝑧𝐴 (𝑏 ∪ {𝑐}) ⊆ 𝑧))
5857ex 418 . . . . . . . 8 ((𝐴 ≠ ∅ ∧ [] Or 𝐴) → ((𝑏 ∪ {𝑐}) ⊆ 𝐴 → (∃𝑧𝐴 𝑏𝑧 → ∃𝑧𝐴 (𝑏 ∪ {𝑐}) ⊆ 𝑧)))
5958a2d 30 . . . . . . 7 ((𝐴 ≠ ∅ ∧ [] Or 𝐴) → (((𝑏 ∪ {𝑐}) ⊆ 𝐴 → ∃𝑧𝐴 𝑏𝑧) → ((𝑏 ∪ {𝑐}) ⊆ 𝐴 → ∃𝑧𝐴 (𝑏 ∪ {𝑐}) ⊆ 𝑧)))
6029, 59syl5 35 . . . . . 6 ((𝐴 ≠ ∅ ∧ [] Or 𝐴) → ((𝑏 𝐴 → ∃𝑧𝐴 𝑏𝑧) → ((𝑏 ∪ {𝑐}) ⊆ 𝐴 → ∃𝑧𝐴 (𝑏 ∪ {𝑐}) ⊆ 𝑧)))
6160a2i 15 . . . . 5 (((𝐴 ≠ ∅ ∧ [] Or 𝐴) → (𝑏 𝐴 → ∃𝑧𝐴 𝑏𝑧)) → ((𝐴 ≠ ∅ ∧ [] Or 𝐴) → ((𝑏 ∪ {𝑐}) ⊆ 𝐴 → ∃𝑧𝐴 (𝑏 ∪ {𝑐}) ⊆ 𝑧)))
6261a1i 11 . . . 4 (𝑏 ∈ Fin → (((𝐴 ≠ ∅ ∧ [] Or 𝐴) → (𝑏 𝐴 → ∃𝑧𝐴 𝑏𝑧)) → ((𝐴 ≠ ∅ ∧ [] Or 𝐴) → ((𝑏 ∪ {𝑐}) ⊆ 𝐴 → ∃𝑧𝐴 (𝑏 ∪ {𝑐}) ⊆ 𝑧))))
635, 10, 15, 20, 26, 62findcard2 9162 . . 3 (𝐵 ∈ Fin → ((𝐴 ≠ ∅ ∧ [] Or 𝐴) → (𝐵 𝐴 → ∃𝑧𝐴 𝐵𝑧)))
6463com12 33 . 2 ((𝐴 ≠ ∅ ∧ [] Or 𝐴) → (𝐵 ∈ Fin → (𝐵 𝐴 → ∃𝑧𝐴 𝐵𝑧)))
6564imp32 424 1 (((𝐴 ≠ ∅ ∧ [] Or 𝐴) ∧ (𝐵 ∈ Fin ∧ 𝐵 𝐴)) → ∃𝑧𝐴 𝐵𝑧)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2145  wne 2957  wral 3078  wrex 3088  cun 3900  wss 3902  c0 4282  {csn 4587   cuni 4870   Or wor 5566   [] crpss 7726  Fincfn 8955
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pr 5402  ax-un 7739
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 2100  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-br 5108  df-opab 5172  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-rpss 7727  df-om 7866  df-en 8956  df-fin 8959
This theorem is used by:  alexsubALTlem2  24275
  Copyright terms: Public domain W3C validator