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

Theorem fiin 9441
Description: The elements of (fi‘𝐶) are closed under finite intersection. (Contributed by Mario Carneiro, 24-Nov-2013.)
Assertion
Ref Expression
fiin ((𝐴 ∈ (fi‘𝐶) ∧ 𝐵 ∈ (fi‘𝐶)) → (𝐴 ∩ 𝐵) ∈ (fi‘𝐶))

Proof of Theorem fiin
Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elfvex 6943 . . . . . 6 (𝐴 ∈ (fi‘𝐶) → 𝐶 ∈ V)
2 elfi 9432 . . . . . 6 ((𝐴 ∈ (fi‘𝐶) ∧ 𝐶 ∈ V) → (𝐴 ∈ (fi‘𝐶) ↔ ∃𝑥 ∈ (𝒫 𝐶 ∩ Fin)𝐴 = ∩ 𝑥))
31, 2mpdan 700 . . . . 5 (𝐴 ∈ (fi‘𝐶) → (𝐴 ∈ (fi‘𝐶) ↔ ∃𝑥 ∈ (𝒫 𝐶 ∩ Fin)𝐴 = ∩ 𝑥))
43ibi 270 . . . 4 (𝐴 ∈ (fi‘𝐶) → ∃𝑥 ∈ (𝒫 𝐶 ∩ Fin)𝐴 = ∩ 𝑥)
54adantr 486 . . 3 ((𝐴 ∈ (fi‘𝐶) ∧ 𝐵 ∈ (fi‘𝐶)) → ∃𝑥 ∈ (𝒫 𝐶 ∩ Fin)𝐴 = ∩ 𝑥)
6 simpr 490 . . . 4 ((𝐴 ∈ (fi‘𝐶) ∧ 𝐵 ∈ (fi‘𝐶)) → 𝐵 ∈ (fi‘𝐶))
7 elfi 9432 . . . . . 6 ((𝐵 ∈ (fi‘𝐶) ∧ 𝐶 ∈ V) → (𝐵 ∈ (fi‘𝐶) ↔ ∃𝑦 ∈ (𝒫 𝐶 ∩ Fin)𝐵 = ∩ 𝑦))
87ancoms 464 . . . . 5 ((𝐶 ∈ V ∧ 𝐵 ∈ (fi‘𝐶)) → (𝐵 ∈ (fi‘𝐶) ↔ ∃𝑦 ∈ (𝒫 𝐶 ∩ Fin)𝐵 = ∩ 𝑦))
91, 8sylan 592 . . . 4 ((𝐴 ∈ (fi‘𝐶) ∧ 𝐵 ∈ (fi‘𝐶)) → (𝐵 ∈ (fi‘𝐶) ↔ ∃𝑦 ∈ (𝒫 𝐶 ∩ Fin)𝐵 = ∩ 𝑦))
106, 9mpbid 235 . . 3 ((𝐴 ∈ (fi‘𝐶) ∧ 𝐵 ∈ (fi‘𝐶)) → ∃𝑦 ∈ (𝒫 𝐶 ∩ Fin)𝐵 = ∩ 𝑦)
11 elin 4096 . . . . . . . . 9 (𝑥 ∈ (𝒫 𝐶 ∩ Fin) ↔ (𝑥 ∈ 𝒫 𝐶 ∧ 𝑥 ∈ Fin))
12 elin 4096 . . . . . . . . 9 (𝑦 ∈ (𝒫 𝐶 ∩ Fin) ↔ (𝑦 ∈ 𝒫 𝐶 ∧ 𝑦 ∈ Fin))
13 pwuncl 7808 . . . . . . . . . . 11 ((𝑥 ∈ 𝒫 𝐶 ∧ 𝑦 ∈ 𝒫 𝐶) → (𝑥 ∪ 𝑦) ∈ 𝒫 𝐶)
14 unfi 9214 . . . . . . . . . . 11 ((𝑥 ∈ Fin ∧ 𝑦 ∈ Fin) → (𝑥 ∪ 𝑦) ∈ Fin)
1513, 14anim12i 625 . . . . . . . . . 10 (((𝑥 ∈ 𝒫 𝐶 ∧ 𝑦 ∈ 𝒫 𝐶) ∧ (𝑥 ∈ Fin ∧ 𝑦 ∈ Fin)) → ((𝑥 ∪ 𝑦) ∈ 𝒫 𝐶 ∧ (𝑥 ∪ 𝑦) ∈ Fin))
1615an4s 673 . . . . . . . . 9 (((𝑥 ∈ 𝒫 𝐶 ∧ 𝑥 ∈ Fin) ∧ (𝑦 ∈ 𝒫 𝐶 ∧ 𝑦 ∈ Fin)) → ((𝑥 ∪ 𝑦) ∈ 𝒫 𝐶 ∧ (𝑥 ∪ 𝑦) ∈ Fin))
1711, 12, 16syl2anb 610 . . . . . . . 8 ((𝑥 ∈ (𝒫 𝐶 ∩ Fin) ∧ 𝑦 ∈ (𝒫 𝐶 ∩ Fin)) → ((𝑥 ∪ 𝑦) ∈ 𝒫 𝐶 ∧ (𝑥 ∪ 𝑦) ∈ Fin))
18 elin 4096 . . . . . . . 8 ((𝑥 ∪ 𝑦) ∈ (𝒫 𝐶 ∩ Fin) ↔ ((𝑥 ∪ 𝑦) ∈ 𝒫 𝐶 ∧ (𝑥 ∪ 𝑦) ∈ Fin))
1917, 18sylibr 237 . . . . . . 7 ((𝑥 ∈ (𝒫 𝐶 ∩ Fin) ∧ 𝑦 ∈ (𝒫 𝐶 ∩ Fin)) → (𝑥 ∪ 𝑦) ∈ (𝒫 𝐶 ∩ Fin))
20 ineq12 4115 . . . . . . . 8 ((𝐴 = ∩ 𝑥 ∧ 𝐵 = ∩ 𝑦) → (𝐴 ∩ 𝐵) = (∩ 𝑥 ∩ ∩ 𝑦))
21 intun 4943 . . . . . . . 8 ∩ (𝑥 ∪ 𝑦) = (∩ 𝑥 ∩ ∩ 𝑦)
2220, 21eqtr4di 2816 . . . . . . 7 ((𝐴 = ∩ 𝑥 ∧ 𝐵 = ∩ 𝑦) → (𝐴 ∩ 𝐵) = ∩ (𝑥 ∪ 𝑦))
23 inteq 4913 . . . . . . . 8 (𝑧 = (𝑥 ∪ 𝑦) → ∩ 𝑧 = ∩ (𝑥 ∪ 𝑦))
2423rspceeqv 3602 . . . . . . 7 (((𝑥 ∪ 𝑦) ∈ (𝒫 𝐶 ∩ Fin) ∧ (𝐴 ∩ 𝐵) = ∩ (𝑥 ∪ 𝑦)) → ∃𝑧 ∈ (𝒫 𝐶 ∩ Fin)(𝐴 ∩ 𝐵) = ∩ 𝑧)
2519, 22, 24syl2an 608 . . . . . 6 (((𝑥 ∈ (𝒫 𝐶 ∩ Fin) ∧ 𝑦 ∈ (𝒫 𝐶 ∩ Fin)) ∧ (𝐴 = ∩ 𝑥 ∧ 𝐵 = ∩ 𝑦)) → ∃𝑧 ∈ (𝒫 𝐶 ∩ Fin)(𝐴 ∩ 𝐵) = ∩ 𝑧)
2625an4s 673 . . . . 5 (((𝑥 ∈ (𝒫 𝐶 ∩ Fin) ∧ 𝐴 = ∩ 𝑥) ∧ (𝑦 ∈ (𝒫 𝐶 ∩ Fin) ∧ 𝐵 = ∩ 𝑦)) → ∃𝑧 ∈ (𝒫 𝐶 ∩ Fin)(𝐴 ∩ 𝐵) = ∩ 𝑧)
2726rexlimdvaa 3168 . . . 4 ((𝑥 ∈ (𝒫 𝐶 ∩ Fin) ∧ 𝐴 = ∩ 𝑥) → (∃𝑦 ∈ (𝒫 𝐶 ∩ Fin)𝐵 = ∩ 𝑦 → ∃𝑧 ∈ (𝒫 𝐶 ∩ Fin)(𝐴 ∩ 𝐵) = ∩ 𝑧))
2827rexlimiva 3159 . . 3 (∃𝑥 ∈ (𝒫 𝐶 ∩ Fin)𝐴 = ∩ 𝑥 → (∃𝑦 ∈ (𝒫 𝐶 ∩ Fin)𝐵 = ∩ 𝑦 → ∃𝑧 ∈ (𝒫 𝐶 ∩ Fin)(𝐴 ∩ 𝐵) = ∩ 𝑧))
295, 10, 28sylc 66 . 2 ((𝐴 ∈ (fi‘𝐶) ∧ 𝐵 ∈ (fi‘𝐶)) → ∃𝑧 ∈ (𝒫 𝐶 ∩ Fin)(𝐴 ∩ 𝐵) = ∩ 𝑧)
30 inex1g 5283 . . . 4 (𝐴 ∈ (fi‘𝐶) → (𝐴 ∩ 𝐵) ∈ V)
31 elfi 9432 . . . 4 (((𝐴 ∩ 𝐵) ∈ V ∧ 𝐶 ∈ V) → ((𝐴 ∩ 𝐵) ∈ (fi‘𝐶) ↔ ∃𝑧 ∈ (𝒫 𝐶 ∩ Fin)(𝐴 ∩ 𝐵) = ∩ 𝑧))
3230, 1, 31syl2anc 596 . . 3 (𝐴 ∈ (fi‘𝐶) → ((𝐴 ∩ 𝐵) ∈ (fi‘𝐶) ↔ ∃𝑧 ∈ (𝒫 𝐶 ∩ Fin)(𝐴 ∩ 𝐵) = ∩ 𝑧))
3332adantr 486 . 2 ((𝐴 ∈ (fi‘𝐶) ∧ 𝐵 ∈ (fi‘𝐶)) → ((𝐴 ∩ 𝐵) ∈ (fi‘𝐶) ↔ ∃𝑧 ∈ (𝒫 𝐶 ∩ Fin)(𝐴 ∩ 𝐵) = ∩ 𝑧))
3429, 33mpbird 260 1 ((𝐴 ∈ (fi‘𝐶) ∧ 𝐵 ∈ (fi‘𝐶)) → (𝐴 ∩ 𝐵) ∈ (fi‘𝐶))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ∃wrex 3090  Vcvv 3454   ∩ cin 4092   ∪ cun 4152  𝒫 cpw 4560  ∩ cint 4910  ‘cfv 6558  Fincfn 9001  ficfi 9429
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 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7775
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-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-br 5107  df-opab 5171  df-mpt 5190  df-tr 5216  df-id 5550  df-eprel 5555  df-po 5563  df-so 5564  df-fr 5608  df-we 5610  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-ord 6383  df-on 6384  df-lim 6385  df-suc 6386  df-iota 6512  df-fun 6560  df-fn 6561  df-f 6562  df-f1 6563  df-fo 6564  df-f1o 6565  df-fv 6566  df-om 7902  df-en 9002  df-fin 9005  df-fi 9430
This theorem is used by:  dffi2  9442  inficl  9444  elfiun  9449  dffi3  9450  fibas  23325  ordtbas2  23539  fsubbas  24216
  Copyright terms: Public domain W3C validator