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

Theorem cfiluweak 22819
 Description: A Cauchy filter base is also a Cauchy filter base on any coarser uniform structure. (Contributed by Thierry Arnoux, 24-Jan-2018.)
Assertion
Ref Expression
cfiluweak ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) → 𝐹 ∈ (CauFilu𝑈))

Proof of Theorem cfiluweak
Dummy variables 𝑢 𝑎 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 trust 22753 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋) → (𝑈t (𝐴 × 𝐴)) ∈ (UnifOn‘𝐴))
2 iscfilu 22812 . . . . . 6 ((𝑈t (𝐴 × 𝐴)) ∈ (UnifOn‘𝐴) → (𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴))) ↔ (𝐹 ∈ (fBas‘𝐴) ∧ ∀𝑢 ∈ (𝑈t (𝐴 × 𝐴))∃𝑎𝐹 (𝑎 × 𝑎) ⊆ 𝑢)))
32biimpa 477 . . . . 5 (((𝑈t (𝐴 × 𝐴)) ∈ (UnifOn‘𝐴) ∧ 𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) → (𝐹 ∈ (fBas‘𝐴) ∧ ∀𝑢 ∈ (𝑈t (𝐴 × 𝐴))∃𝑎𝐹 (𝑎 × 𝑎) ⊆ 𝑢))
41, 3stoic3 1770 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) → (𝐹 ∈ (fBas‘𝐴) ∧ ∀𝑢 ∈ (𝑈t (𝐴 × 𝐴))∃𝑎𝐹 (𝑎 × 𝑎) ⊆ 𝑢))
54simpld 495 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) → 𝐹 ∈ (fBas‘𝐴))
6 fbsspw 22356 . . . . 5 (𝐹 ∈ (fBas‘𝐴) → 𝐹 ⊆ 𝒫 𝐴)
75, 6syl 17 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) → 𝐹 ⊆ 𝒫 𝐴)
8 simp2 1131 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) → 𝐴𝑋)
9 sspwb 5338 . . . . 5 (𝐴𝑋 ↔ 𝒫 𝐴 ⊆ 𝒫 𝑋)
108, 9sylib 219 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) → 𝒫 𝐴 ⊆ 𝒫 𝑋)
117, 10sstrd 3981 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) → 𝐹 ⊆ 𝒫 𝑋)
12 simp1 1130 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) → 𝑈 ∈ (UnifOn‘𝑋))
1312elfvexd 6701 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) → 𝑋 ∈ V)
14 fbasweak 22389 . . 3 ((𝐹 ∈ (fBas‘𝐴) ∧ 𝐹 ⊆ 𝒫 𝑋𝑋 ∈ V) → 𝐹 ∈ (fBas‘𝑋))
155, 11, 13, 14syl3anc 1365 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) → 𝐹 ∈ (fBas‘𝑋))
16 sseq2 3997 . . . . . 6 (𝑢 = (𝑣 ∩ (𝐴 × 𝐴)) → ((𝑎 × 𝑎) ⊆ 𝑢 ↔ (𝑎 × 𝑎) ⊆ (𝑣 ∩ (𝐴 × 𝐴))))
1716rexbidv 3302 . . . . 5 (𝑢 = (𝑣 ∩ (𝐴 × 𝐴)) → (∃𝑎𝐹 (𝑎 × 𝑎) ⊆ 𝑢 ↔ ∃𝑎𝐹 (𝑎 × 𝑎) ⊆ (𝑣 ∩ (𝐴 × 𝐴))))
184simprd 496 . . . . . 6 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) → ∀𝑢 ∈ (𝑈t (𝐴 × 𝐴))∃𝑎𝐹 (𝑎 × 𝑎) ⊆ 𝑢)
1918adantr 481 . . . . 5 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) ∧ 𝑣𝑈) → ∀𝑢 ∈ (𝑈t (𝐴 × 𝐴))∃𝑎𝐹 (𝑎 × 𝑎) ⊆ 𝑢)
2012adantr 481 . . . . . 6 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) ∧ 𝑣𝑈) → 𝑈 ∈ (UnifOn‘𝑋))
2113adantr 481 . . . . . . . 8 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) ∧ 𝑣𝑈) → 𝑋 ∈ V)
228adantr 481 . . . . . . . 8 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) ∧ 𝑣𝑈) → 𝐴𝑋)
2321, 22ssexd 5225 . . . . . . 7 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) ∧ 𝑣𝑈) → 𝐴 ∈ V)
2423, 23xpexd 7463 . . . . . 6 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) ∧ 𝑣𝑈) → (𝐴 × 𝐴) ∈ V)
25 simpr 485 . . . . . 6 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) ∧ 𝑣𝑈) → 𝑣𝑈)
26 elrestr 16692 . . . . . 6 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐴 × 𝐴) ∈ V ∧ 𝑣𝑈) → (𝑣 ∩ (𝐴 × 𝐴)) ∈ (𝑈t (𝐴 × 𝐴)))
2720, 24, 25, 26syl3anc 1365 . . . . 5 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) ∧ 𝑣𝑈) → (𝑣 ∩ (𝐴 × 𝐴)) ∈ (𝑈t (𝐴 × 𝐴)))
2817, 19, 27rspcdva 3629 . . . 4 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) ∧ 𝑣𝑈) → ∃𝑎𝐹 (𝑎 × 𝑎) ⊆ (𝑣 ∩ (𝐴 × 𝐴)))
29 inss1 4209 . . . . . 6 (𝑣 ∩ (𝐴 × 𝐴)) ⊆ 𝑣
30 sstr 3979 . . . . . 6 (((𝑎 × 𝑎) ⊆ (𝑣 ∩ (𝐴 × 𝐴)) ∧ (𝑣 ∩ (𝐴 × 𝐴)) ⊆ 𝑣) → (𝑎 × 𝑎) ⊆ 𝑣)
3129, 30mpan2 687 . . . . 5 ((𝑎 × 𝑎) ⊆ (𝑣 ∩ (𝐴 × 𝐴)) → (𝑎 × 𝑎) ⊆ 𝑣)
3231reximi 3248 . . . 4 (∃𝑎𝐹 (𝑎 × 𝑎) ⊆ (𝑣 ∩ (𝐴 × 𝐴)) → ∃𝑎𝐹 (𝑎 × 𝑎) ⊆ 𝑣)
3328, 32syl 17 . . 3 (((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) ∧ 𝑣𝑈) → ∃𝑎𝐹 (𝑎 × 𝑎) ⊆ 𝑣)
3433ralrimiva 3187 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) → ∀𝑣𝑈𝑎𝐹 (𝑎 × 𝑎) ⊆ 𝑣)
35 iscfilu 22812 . . 3 (𝑈 ∈ (UnifOn‘𝑋) → (𝐹 ∈ (CauFilu𝑈) ↔ (𝐹 ∈ (fBas‘𝑋) ∧ ∀𝑣𝑈𝑎𝐹 (𝑎 × 𝑎) ⊆ 𝑣)))
36353ad2ant1 1127 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) → (𝐹 ∈ (CauFilu𝑈) ↔ (𝐹 ∈ (fBas‘𝑋) ∧ ∀𝑣𝑈𝑎𝐹 (𝑎 × 𝑎) ⊆ 𝑣)))
3715, 34, 36mpbir2and 709 1 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋𝐹 ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴)))) → 𝐹 ∈ (CauFilu𝑈))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396   ∧ w3a 1081   = wceq 1530   ∈ wcel 2107  ∀wral 3143  ∃wrex 3144  Vcvv 3500   ∩ cin 3939   ⊆ wss 3940  𝒫 cpw 4542   × cxp 5552  ‘cfv 6352  (class class class)co 7148   ↾t crest 16684  fBascfbas 20449  UnifOncust 22723  CauFiluccfilu 22810 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1904  ax-6 1963  ax-7 2008  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2153  ax-12 2169  ax-ext 2798  ax-rep 5187  ax-sep 5200  ax-nul 5207  ax-pow 5263  ax-pr 5326  ax-un 7451 This theorem depends on definitions:  df-bi 208  df-an 397  df-or 844  df-3an 1083  df-tru 1533  df-ex 1774  df-nf 1778  df-sb 2063  df-mo 2620  df-eu 2652  df-clab 2805  df-cleq 2819  df-clel 2898  df-nfc 2968  df-ne 3022  df-nel 3129  df-ral 3148  df-rex 3149  df-reu 3150  df-rab 3152  df-v 3502  df-sbc 3777  df-csb 3888  df-dif 3943  df-un 3945  df-in 3947  df-ss 3956  df-nul 4296  df-if 4471  df-pw 4544  df-sn 4565  df-pr 4567  df-op 4571  df-uni 4838  df-iun 4919  df-br 5064  df-opab 5126  df-mpt 5144  df-id 5459  df-xp 5560  df-rel 5561  df-cnv 5562  df-co 5563  df-dm 5564  df-rn 5565  df-res 5566  df-ima 5567  df-iota 6312  df-fun 6354  df-fn 6355  df-f 6356  df-f1 6357  df-fo 6358  df-f1o 6359  df-fv 6360  df-ov 7151  df-oprab 7152  df-mpo 7153  df-1st 7680  df-2nd 7681  df-rest 16686  df-fbas 20458  df-ust 22724  df-cfilu 22811 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator