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

Theorem inficl 8881
Description: A set which is closed under pairwise intersection is closed under finite intersection. (Contributed by Jeff Madsen, 2-Sep-2009.) (Revised by Mario Carneiro, 24-Nov-2013.)
Assertion
Ref Expression
inficl (𝐴𝑉 → (∀𝑥𝐴𝑦𝐴 (𝑥𝑦) ∈ 𝐴 ↔ (fi‘𝐴) = 𝐴))
Distinct variable groups:   𝑥,𝑦,𝐴   𝑦,𝑉
Allowed substitution hint:   𝑉(𝑥)

Proof of Theorem inficl
Dummy variable 𝑧 is distinct from all other variables.
StepHypRef Expression
1 ssfii 8875 . . 3 (𝐴𝑉𝐴 ⊆ (fi‘𝐴))
2 eqimss2 4022 . . . . . . . 8 (𝑧 = 𝐴𝐴𝑧)
32biantrurd 535 . . . . . . 7 (𝑧 = 𝐴 → (∀𝑥𝑧𝑦𝑧 (𝑥𝑦) ∈ 𝑧 ↔ (𝐴𝑧 ∧ ∀𝑥𝑧𝑦𝑧 (𝑥𝑦) ∈ 𝑧)))
4 eleq2 2899 . . . . . . . . 9 (𝑧 = 𝐴 → ((𝑥𝑦) ∈ 𝑧 ↔ (𝑥𝑦) ∈ 𝐴))
54raleqbi1dv 3402 . . . . . . . 8 (𝑧 = 𝐴 → (∀𝑦𝑧 (𝑥𝑦) ∈ 𝑧 ↔ ∀𝑦𝐴 (𝑥𝑦) ∈ 𝐴))
65raleqbi1dv 3402 . . . . . . 7 (𝑧 = 𝐴 → (∀𝑥𝑧𝑦𝑧 (𝑥𝑦) ∈ 𝑧 ↔ ∀𝑥𝐴𝑦𝐴 (𝑥𝑦) ∈ 𝐴))
73, 6bitr3d 283 . . . . . 6 (𝑧 = 𝐴 → ((𝐴𝑧 ∧ ∀𝑥𝑧𝑦𝑧 (𝑥𝑦) ∈ 𝑧) ↔ ∀𝑥𝐴𝑦𝐴 (𝑥𝑦) ∈ 𝐴))
87elabg 3664 . . . . 5 (𝐴𝑉 → (𝐴 ∈ {𝑧 ∣ (𝐴𝑧 ∧ ∀𝑥𝑧𝑦𝑧 (𝑥𝑦) ∈ 𝑧)} ↔ ∀𝑥𝐴𝑦𝐴 (𝑥𝑦) ∈ 𝐴))
9 intss1 4882 . . . . 5 (𝐴 ∈ {𝑧 ∣ (𝐴𝑧 ∧ ∀𝑥𝑧𝑦𝑧 (𝑥𝑦) ∈ 𝑧)} → {𝑧 ∣ (𝐴𝑧 ∧ ∀𝑥𝑧𝑦𝑧 (𝑥𝑦) ∈ 𝑧)} ⊆ 𝐴)
108, 9syl6bir 256 . . . 4 (𝐴𝑉 → (∀𝑥𝐴𝑦𝐴 (𝑥𝑦) ∈ 𝐴 {𝑧 ∣ (𝐴𝑧 ∧ ∀𝑥𝑧𝑦𝑧 (𝑥𝑦) ∈ 𝑧)} ⊆ 𝐴))
11 dffi2 8879 . . . . 5 (𝐴𝑉 → (fi‘𝐴) = {𝑧 ∣ (𝐴𝑧 ∧ ∀𝑥𝑧𝑦𝑧 (𝑥𝑦) ∈ 𝑧)})
1211sseq1d 3996 . . . 4 (𝐴𝑉 → ((fi‘𝐴) ⊆ 𝐴 {𝑧 ∣ (𝐴𝑧 ∧ ∀𝑥𝑧𝑦𝑧 (𝑥𝑦) ∈ 𝑧)} ⊆ 𝐴))
1310, 12sylibrd 261 . . 3 (𝐴𝑉 → (∀𝑥𝐴𝑦𝐴 (𝑥𝑦) ∈ 𝐴 → (fi‘𝐴) ⊆ 𝐴))
14 eqss 3980 . . . 4 ((fi‘𝐴) = 𝐴 ↔ ((fi‘𝐴) ⊆ 𝐴𝐴 ⊆ (fi‘𝐴)))
1514simplbi2com 505 . . 3 (𝐴 ⊆ (fi‘𝐴) → ((fi‘𝐴) ⊆ 𝐴 → (fi‘𝐴) = 𝐴))
161, 13, 15sylsyld 61 . 2 (𝐴𝑉 → (∀𝑥𝐴𝑦𝐴 (𝑥𝑦) ∈ 𝐴 → (fi‘𝐴) = 𝐴))
17 fiin 8878 . . . 4 ((𝑥 ∈ (fi‘𝐴) ∧ 𝑦 ∈ (fi‘𝐴)) → (𝑥𝑦) ∈ (fi‘𝐴))
1817rgen2 3201 . . 3 𝑥 ∈ (fi‘𝐴)∀𝑦 ∈ (fi‘𝐴)(𝑥𝑦) ∈ (fi‘𝐴)
19 eleq2 2899 . . . . 5 ((fi‘𝐴) = 𝐴 → ((𝑥𝑦) ∈ (fi‘𝐴) ↔ (𝑥𝑦) ∈ 𝐴))
2019raleqbi1dv 3402 . . . 4 ((fi‘𝐴) = 𝐴 → (∀𝑦 ∈ (fi‘𝐴)(𝑥𝑦) ∈ (fi‘𝐴) ↔ ∀𝑦𝐴 (𝑥𝑦) ∈ 𝐴))
2120raleqbi1dv 3402 . . 3 ((fi‘𝐴) = 𝐴 → (∀𝑥 ∈ (fi‘𝐴)∀𝑦 ∈ (fi‘𝐴)(𝑥𝑦) ∈ (fi‘𝐴) ↔ ∀𝑥𝐴𝑦𝐴 (𝑥𝑦) ∈ 𝐴))
2218, 21mpbii 235 . 2 ((fi‘𝐴) = 𝐴 → ∀𝑥𝐴𝑦𝐴 (𝑥𝑦) ∈ 𝐴)
2316, 22impbid1 227 1 (𝐴𝑉 → (∀𝑥𝐴𝑦𝐴 (𝑥𝑦) ∈ 𝐴 ↔ (fi‘𝐴) = 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1531  wcel 2108  {cab 2797  wral 3136  cin 3933  wss 3934   cint 4867  cfv 6348  ficfi 8866
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1790  ax-4 1804  ax-5 1905  ax-6 1964  ax-7 2009  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2154  ax-12 2170  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 1083  df-3an 1084  df-tru 1534  df-ex 1775  df-nf 1779  df-sb 2064  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-int 4868  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-wrecs 7939  df-recs 8000  df-rdg 8038  df-1o 8094  df-oadd 8098  df-er 8281  df-en 8502  df-fin 8505  df-fi 8867
This theorem is referenced by:  fipwuni  8882  fisn  8883  fitop  21500  ordtbaslem  21788  ptbasin2  22178  filfi  22459  fmfnfmlem3  22556  ustuqtop2  22843  ldgenpisys  31418
  Copyright terms: Public domain W3C validator