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

Theorem inficl 8331
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 8325 . . 3 (𝐴𝑉𝐴 ⊆ (fi‘𝐴))
2 eqimss2 3658 . . . . . . . 8 (𝑧 = 𝐴𝐴𝑧)
32biantrurd 529 . . . . . . 7 (𝑧 = 𝐴 → (∀𝑥𝑧𝑦𝑧 (𝑥𝑦) ∈ 𝑧 ↔ (𝐴𝑧 ∧ ∀𝑥𝑧𝑦𝑧 (𝑥𝑦) ∈ 𝑧)))
4 eleq2 2690 . . . . . . . . 9 (𝑧 = 𝐴 → ((𝑥𝑦) ∈ 𝑧 ↔ (𝑥𝑦) ∈ 𝐴))
54raleqbi1dv 3146 . . . . . . . 8 (𝑧 = 𝐴 → (∀𝑦𝑧 (𝑥𝑦) ∈ 𝑧 ↔ ∀𝑦𝐴 (𝑥𝑦) ∈ 𝐴))
65raleqbi1dv 3146 . . . . . . 7 (𝑧 = 𝐴 → (∀𝑥𝑧𝑦𝑧 (𝑥𝑦) ∈ 𝑧 ↔ ∀𝑥𝐴𝑦𝐴 (𝑥𝑦) ∈ 𝐴))
73, 6bitr3d 270 . . . . . 6 (𝑧 = 𝐴 → ((𝐴𝑧 ∧ ∀𝑥𝑧𝑦𝑧 (𝑥𝑦) ∈ 𝑧) ↔ ∀𝑥𝐴𝑦𝐴 (𝑥𝑦) ∈ 𝐴))
87elabg 3351 . . . . 5 (𝐴𝑉 → (𝐴 ∈ {𝑧 ∣ (𝐴𝑧 ∧ ∀𝑥𝑧𝑦𝑧 (𝑥𝑦) ∈ 𝑧)} ↔ ∀𝑥𝐴𝑦𝐴 (𝑥𝑦) ∈ 𝐴))
9 intss1 4492 . . . . 5 (𝐴 ∈ {𝑧 ∣ (𝐴𝑧 ∧ ∀𝑥𝑧𝑦𝑧 (𝑥𝑦) ∈ 𝑧)} → {𝑧 ∣ (𝐴𝑧 ∧ ∀𝑥𝑧𝑦𝑧 (𝑥𝑦) ∈ 𝑧)} ⊆ 𝐴)
108, 9syl6bir 244 . . . 4 (𝐴𝑉 → (∀𝑥𝐴𝑦𝐴 (𝑥𝑦) ∈ 𝐴 {𝑧 ∣ (𝐴𝑧 ∧ ∀𝑥𝑧𝑦𝑧 (𝑥𝑦) ∈ 𝑧)} ⊆ 𝐴))
11 dffi2 8329 . . . . 5 (𝐴𝑉 → (fi‘𝐴) = {𝑧 ∣ (𝐴𝑧 ∧ ∀𝑥𝑧𝑦𝑧 (𝑥𝑦) ∈ 𝑧)})
1211sseq1d 3632 . . . 4 (𝐴𝑉 → ((fi‘𝐴) ⊆ 𝐴 {𝑧 ∣ (𝐴𝑧 ∧ ∀𝑥𝑧𝑦𝑧 (𝑥𝑦) ∈ 𝑧)} ⊆ 𝐴))
1310, 12sylibrd 249 . . 3 (𝐴𝑉 → (∀𝑥𝐴𝑦𝐴 (𝑥𝑦) ∈ 𝐴 → (fi‘𝐴) ⊆ 𝐴))
14 eqss 3618 . . . 4 ((fi‘𝐴) = 𝐴 ↔ ((fi‘𝐴) ⊆ 𝐴𝐴 ⊆ (fi‘𝐴)))
1514simplbi2com 657 . . 3 (𝐴 ⊆ (fi‘𝐴) → ((fi‘𝐴) ⊆ 𝐴 → (fi‘𝐴) = 𝐴))
161, 13, 15sylsyld 61 . 2 (𝐴𝑉 → (∀𝑥𝐴𝑦𝐴 (𝑥𝑦) ∈ 𝐴 → (fi‘𝐴) = 𝐴))
17 fiin 8328 . . . 4 ((𝑥 ∈ (fi‘𝐴) ∧ 𝑦 ∈ (fi‘𝐴)) → (𝑥𝑦) ∈ (fi‘𝐴))
1817rgen2a 2977 . . 3 𝑥 ∈ (fi‘𝐴)∀𝑦 ∈ (fi‘𝐴)(𝑥𝑦) ∈ (fi‘𝐴)
19 eleq2 2690 . . . . 5 ((fi‘𝐴) = 𝐴 → ((𝑥𝑦) ∈ (fi‘𝐴) ↔ (𝑥𝑦) ∈ 𝐴))
2019raleqbi1dv 3146 . . . 4 ((fi‘𝐴) = 𝐴 → (∀𝑦 ∈ (fi‘𝐴)(𝑥𝑦) ∈ (fi‘𝐴) ↔ ∀𝑦𝐴 (𝑥𝑦) ∈ 𝐴))
2120raleqbi1dv 3146 . . 3 ((fi‘𝐴) = 𝐴 → (∀𝑥 ∈ (fi‘𝐴)∀𝑦 ∈ (fi‘𝐴)(𝑥𝑦) ∈ (fi‘𝐴) ↔ ∀𝑥𝐴𝑦𝐴 (𝑥𝑦) ∈ 𝐴))
2218, 21mpbii 223 . 2 ((fi‘𝐴) = 𝐴 → ∀𝑥𝐴𝑦𝐴 (𝑥𝑦) ∈ 𝐴)
2316, 22impbid1 215 1 (𝐴𝑉 → (∀𝑥𝐴𝑦𝐴 (𝑥𝑦) ∈ 𝐴 ↔ (fi‘𝐴) = 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384   = wceq 1483  wcel 1990  {cab 2608  wral 2912  cin 3573  wss 3574   cint 4475  cfv 5888  ficfi 8316
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-oadd 7564  df-er 7742  df-en 7956  df-fin 7959  df-fi 8317
This theorem is referenced by:  fipwuni  8332  fisn  8333  fitop  20705  ordtbaslem  20992  ptbasin2  21381  filfi  21663  fmfnfmlem3  21760  ustuqtop2  22046  ldgenpisys  30229
  Copyright terms: Public domain W3C validator