ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  fipwssg Unicode version

Theorem fipwssg 7038
Description: If a set is a family of subsets of some base set, then so is its finite intersection. (Contributed by Stefan O'Rear, 2-Aug-2015.)
Assertion
Ref Expression
fipwssg  |-  ( ( A  e.  V  /\  A  C_  ~P X )  ->  ( fi `  A )  C_  ~P X )

Proof of Theorem fipwssg
StepHypRef Expression
1 fiuni 7037 . . . 4  |-  ( A  e.  V  ->  U. A  =  U. ( fi `  A ) )
21sseq1d 3208 . . 3  |-  ( A  e.  V  ->  ( U. A  C_  X  <->  U. ( fi `  A )  C_  X ) )
3 sspwuni 3997 . . 3  |-  ( A 
C_  ~P X  <->  U. A  C_  X )
4 sspwuni 3997 . . 3  |-  ( ( fi `  A ) 
C_  ~P X  <->  U. ( fi `  A )  C_  X )
52, 3, 43bitr4g 223 . 2  |-  ( A  e.  V  ->  ( A  C_  ~P X  <->  ( fi `  A )  C_  ~P X ) )
65biimpa 296 1  |-  ( ( A  e.  V  /\  A  C_  ~P X )  ->  ( fi `  A )  C_  ~P X )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    e. wcel 2164    C_ wss 3153   ~Pcpw 3601   U.cuni 3835   ` cfv 5254   ficfi 7027
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-sep 4147  ax-nul 4155  ax-pow 4203  ax-pr 4238  ax-un 4464  ax-iinf 4620
This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-v 2762  df-sbc 2986  df-csb 3081  df-dif 3155  df-un 3157  df-in 3159  df-ss 3166  df-nul 3447  df-pw 3603  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-int 3871  df-br 4030  df-opab 4091  df-mpt 4092  df-id 4324  df-suc 4402  df-iom 4623  df-xp 4665  df-rel 4666  df-cnv 4667  df-co 4668  df-dm 4669  df-rn 4670  df-res 4671  df-ima 4672  df-iota 5215  df-fun 5256  df-fn 5257  df-f 5258  df-f1 5259  df-fo 5260  df-f1o 5261  df-fv 5262  df-1o 6469  df-er 6587  df-en 6795  df-fin 6797  df-fi 7028
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator