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

Theorem trcfilu 23790
Description: Condition for the trace of a Cauchy filter base to be a Cauchy filter base for the restricted uniform structure. (Contributed by Thierry Arnoux, 24-Jan-2018.)
Assertion
Ref Expression
trcfilu ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) → (𝐹t 𝐴) ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴))))

Proof of Theorem trcfilu
Dummy variables 𝑎 𝑏 𝑣 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simp1 1136 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) → 𝑈 ∈ (UnifOn‘𝑋))
2 simp2l 1199 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) → 𝐹 ∈ (CauFilu𝑈))
3 iscfilu 23784 . . . . . 6 (𝑈 ∈ (UnifOn‘𝑋) → (𝐹 ∈ (CauFilu𝑈) ↔ (𝐹 ∈ (fBas‘𝑋) ∧ ∀𝑣𝑈𝑎𝐹 (𝑎 × 𝑎) ⊆ 𝑣)))
43biimpa 477 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐹 ∈ (CauFilu𝑈)) → (𝐹 ∈ (fBas‘𝑋) ∧ ∀𝑣𝑈𝑎𝐹 (𝑎 × 𝑎) ⊆ 𝑣))
51, 2, 4syl2anc 584 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) → (𝐹 ∈ (fBas‘𝑋) ∧ ∀𝑣𝑈𝑎𝐹 (𝑎 × 𝑎) ⊆ 𝑣))
65simpld 495 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) → 𝐹 ∈ (fBas‘𝑋))
7 simp3 1138 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) → 𝐴𝑋)
8 simp2r 1200 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) → ¬ ∅ ∈ (𝐹t 𝐴))
9 trfbas2 23338 . . . 4 ((𝐹 ∈ (fBas‘𝑋) ∧ 𝐴𝑋) → ((𝐹t 𝐴) ∈ (fBas‘𝐴) ↔ ¬ ∅ ∈ (𝐹t 𝐴)))
109biimpar 478 . . 3 (((𝐹 ∈ (fBas‘𝑋) ∧ 𝐴𝑋) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) → (𝐹t 𝐴) ∈ (fBas‘𝐴))
116, 7, 8, 10syl21anc 836 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) → (𝐹t 𝐴) ∈ (fBas‘𝐴))
122ad5antr 732 . . . . . . 7 (((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) ∧ 𝑣𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) ∧ 𝑎𝐹) ∧ (𝑎 × 𝑎) ⊆ 𝑣) → 𝐹 ∈ (CauFilu𝑈))
131adantr 481 . . . . . . . . . 10 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) → 𝑈 ∈ (UnifOn‘𝑋))
1413elfvexd 6927 . . . . . . . . 9 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) → 𝑋 ∈ V)
157adantr 481 . . . . . . . . 9 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) → 𝐴𝑋)
1614, 15ssexd 5323 . . . . . . . 8 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) → 𝐴 ∈ V)
1716ad4antr 730 . . . . . . 7 (((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) ∧ 𝑣𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) ∧ 𝑎𝐹) ∧ (𝑎 × 𝑎) ⊆ 𝑣) → 𝐴 ∈ V)
18 simplr 767 . . . . . . 7 (((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) ∧ 𝑣𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) ∧ 𝑎𝐹) ∧ (𝑎 × 𝑎) ⊆ 𝑣) → 𝑎𝐹)
19 elrestr 17370 . . . . . . 7 ((𝐹 ∈ (CauFilu𝑈) ∧ 𝐴 ∈ V ∧ 𝑎𝐹) → (𝑎𝐴) ∈ (𝐹t 𝐴))
2012, 17, 18, 19syl3anc 1371 . . . . . 6 (((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) ∧ 𝑣𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) ∧ 𝑎𝐹) ∧ (𝑎 × 𝑎) ⊆ 𝑣) → (𝑎𝐴) ∈ (𝐹t 𝐴))
21 inxp 5830 . . . . . . 7 ((𝑎 × 𝑎) ∩ (𝐴 × 𝐴)) = ((𝑎𝐴) × (𝑎𝐴))
22 simpr 485 . . . . . . . . 9 (((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) ∧ 𝑣𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) ∧ 𝑎𝐹) ∧ (𝑎 × 𝑎) ⊆ 𝑣) → (𝑎 × 𝑎) ⊆ 𝑣)
2322ssrind 4234 . . . . . . . 8 (((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) ∧ 𝑣𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) ∧ 𝑎𝐹) ∧ (𝑎 × 𝑎) ⊆ 𝑣) → ((𝑎 × 𝑎) ∩ (𝐴 × 𝐴)) ⊆ (𝑣 ∩ (𝐴 × 𝐴)))
24 simpllr 774 . . . . . . . 8 (((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) ∧ 𝑣𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) ∧ 𝑎𝐹) ∧ (𝑎 × 𝑎) ⊆ 𝑣) → 𝑤 = (𝑣 ∩ (𝐴 × 𝐴)))
2523, 24sseqtrrd 4022 . . . . . . 7 (((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) ∧ 𝑣𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) ∧ 𝑎𝐹) ∧ (𝑎 × 𝑎) ⊆ 𝑣) → ((𝑎 × 𝑎) ∩ (𝐴 × 𝐴)) ⊆ 𝑤)
2621, 25eqsstrrid 4030 . . . . . 6 (((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) ∧ 𝑣𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) ∧ 𝑎𝐹) ∧ (𝑎 × 𝑎) ⊆ 𝑣) → ((𝑎𝐴) × (𝑎𝐴)) ⊆ 𝑤)
27 id 22 . . . . . . . . 9 (𝑏 = (𝑎𝐴) → 𝑏 = (𝑎𝐴))
2827sqxpeqd 5707 . . . . . . . 8 (𝑏 = (𝑎𝐴) → (𝑏 × 𝑏) = ((𝑎𝐴) × (𝑎𝐴)))
2928sseq1d 4012 . . . . . . 7 (𝑏 = (𝑎𝐴) → ((𝑏 × 𝑏) ⊆ 𝑤 ↔ ((𝑎𝐴) × (𝑎𝐴)) ⊆ 𝑤))
3029rspcev 3612 . . . . . 6 (((𝑎𝐴) ∈ (𝐹t 𝐴) ∧ ((𝑎𝐴) × (𝑎𝐴)) ⊆ 𝑤) → ∃𝑏 ∈ (𝐹t 𝐴)(𝑏 × 𝑏) ⊆ 𝑤)
3120, 26, 30syl2anc 584 . . . . 5 (((((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) ∧ 𝑣𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) ∧ 𝑎𝐹) ∧ (𝑎 × 𝑎) ⊆ 𝑣) → ∃𝑏 ∈ (𝐹t 𝐴)(𝑏 × 𝑏) ⊆ 𝑤)
325simprd 496 . . . . . . 7 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) → ∀𝑣𝑈𝑎𝐹 (𝑎 × 𝑎) ⊆ 𝑣)
3332r19.21bi 3248 . . . . . 6 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑣𝑈) → ∃𝑎𝐹 (𝑎 × 𝑎) ⊆ 𝑣)
3433ad4ant13 749 . . . . 5 (((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) ∧ 𝑣𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) → ∃𝑎𝐹 (𝑎 × 𝑎) ⊆ 𝑣)
3531, 34r19.29a 3162 . . . 4 (((((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) ∧ 𝑣𝑈) ∧ 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))) → ∃𝑏 ∈ (𝐹t 𝐴)(𝑏 × 𝑏) ⊆ 𝑤)
3616, 16xpexd 7734 . . . . 5 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) → (𝐴 × 𝐴) ∈ V)
37 simpr 485 . . . . 5 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) → 𝑤 ∈ (𝑈t (𝐴 × 𝐴)))
38 elrest 17369 . . . . . 6 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐴 × 𝐴) ∈ V) → (𝑤 ∈ (𝑈t (𝐴 × 𝐴)) ↔ ∃𝑣𝑈 𝑤 = (𝑣 ∩ (𝐴 × 𝐴))))
3938biimpa 477 . . . . 5 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐴 × 𝐴) ∈ V) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) → ∃𝑣𝑈 𝑤 = (𝑣 ∩ (𝐴 × 𝐴)))
4013, 36, 37, 39syl21anc 836 . . . 4 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) → ∃𝑣𝑈 𝑤 = (𝑣 ∩ (𝐴 × 𝐴)))
4135, 40r19.29a 3162 . . 3 (((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) ∧ 𝑤 ∈ (𝑈t (𝐴 × 𝐴))) → ∃𝑏 ∈ (𝐹t 𝐴)(𝑏 × 𝑏) ⊆ 𝑤)
4241ralrimiva 3146 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) → ∀𝑤 ∈ (𝑈t (𝐴 × 𝐴))∃𝑏 ∈ (𝐹t 𝐴)(𝑏 × 𝑏) ⊆ 𝑤)
43 trust 23725 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝐴𝑋) → (𝑈t (𝐴 × 𝐴)) ∈ (UnifOn‘𝐴))
441, 7, 43syl2anc 584 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) → (𝑈t (𝐴 × 𝐴)) ∈ (UnifOn‘𝐴))
45 iscfilu 23784 . . 3 ((𝑈t (𝐴 × 𝐴)) ∈ (UnifOn‘𝐴) → ((𝐹t 𝐴) ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴))) ↔ ((𝐹t 𝐴) ∈ (fBas‘𝐴) ∧ ∀𝑤 ∈ (𝑈t (𝐴 × 𝐴))∃𝑏 ∈ (𝐹t 𝐴)(𝑏 × 𝑏) ⊆ 𝑤)))
4644, 45syl 17 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) → ((𝐹t 𝐴) ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴))) ↔ ((𝐹t 𝐴) ∈ (fBas‘𝐴) ∧ ∀𝑤 ∈ (𝑈t (𝐴 × 𝐴))∃𝑏 ∈ (𝐹t 𝐴)(𝑏 × 𝑏) ⊆ 𝑤)))
4711, 42, 46mpbir2and 711 1 ((𝑈 ∈ (UnifOn‘𝑋) ∧ (𝐹 ∈ (CauFilu𝑈) ∧ ¬ ∅ ∈ (𝐹t 𝐴)) ∧ 𝐴𝑋) → (𝐹t 𝐴) ∈ (CauFilu‘(𝑈t (𝐴 × 𝐴))))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 396  w3a 1087   = wceq 1541  wcel 2106  wral 3061  wrex 3070  Vcvv 3474  cin 3946  wss 3947  c0 4321   × cxp 5673  cfv 6540  (class class class)co 7405  t crest 17362  fBascfbas 20924  UnifOncust 23695  CauFiluccfilu 23782
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7721
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-nel 3047  df-ral 3062  df-rex 3071  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-id 5573  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7408  df-oprab 7409  df-mpo 7410  df-1st 7971  df-2nd 7972  df-rest 17364  df-fbas 20933  df-ust 23696  df-cfilu 23783
This theorem is referenced by:  ucnextcn  23800
  Copyright terms: Public domain W3C validator