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

Theorem ustssel 21761
Description: A uniform structure is upward closed. Condition FI of [BourbakiTop1] p. I.36. (Contributed by Thierry Arnoux, 19-Nov-2017.) (Proof shortened by AV, 17-Sep-2021.)
Assertion
Ref Expression
ustssel ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → (𝑉𝑊𝑊𝑈))

Proof of Theorem ustssel
Dummy variables 𝑣 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simp1 1053 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → 𝑈 ∈ (UnifOn‘𝑋))
21elfvexd 6117 . . . . . 6 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → 𝑋 ∈ V)
3 isust 21759 . . . . . 6 (𝑋 ∈ V → (𝑈 ∈ (UnifOn‘𝑋) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))))
42, 3syl 17 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → (𝑈 ∈ (UnifOn‘𝑋) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))))
51, 4mpbid 220 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣))))
65simp3d 1067 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))
7 simp1 1053 . . . 4 ((∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)) → ∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈))
87ralimi 2935 . . 3 (∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)) → ∀𝑣𝑈𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈))
96, 8syl 17 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → ∀𝑣𝑈𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈))
10 simp2 1054 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → 𝑉𝑈)
11 xpexg 6835 . . . . 5 ((𝑋 ∈ V ∧ 𝑋 ∈ V) → (𝑋 × 𝑋) ∈ V)
122, 2, 11syl2anc 690 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → (𝑋 × 𝑋) ∈ V)
13 simp3 1055 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → 𝑊 ⊆ (𝑋 × 𝑋))
1412, 13sselpwd 4729 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → 𝑊 ∈ 𝒫 (𝑋 × 𝑋))
15 sseq1 3588 . . . . 5 (𝑣 = 𝑉 → (𝑣𝑤𝑉𝑤))
1615imbi1d 329 . . . 4 (𝑣 = 𝑉 → ((𝑣𝑤𝑤𝑈) ↔ (𝑉𝑤𝑤𝑈)))
17 sseq2 3589 . . . . 5 (𝑤 = 𝑊 → (𝑉𝑤𝑉𝑊))
18 eleq1 2675 . . . . 5 (𝑤 = 𝑊 → (𝑤𝑈𝑊𝑈))
1917, 18imbi12d 332 . . . 4 (𝑤 = 𝑊 → ((𝑉𝑤𝑤𝑈) ↔ (𝑉𝑊𝑊𝑈)))
2016, 19rspc2v 3292 . . 3 ((𝑉𝑈𝑊 ∈ 𝒫 (𝑋 × 𝑋)) → (∀𝑣𝑈𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) → (𝑉𝑊𝑊𝑈)))
2110, 14, 20syl2anc 690 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → (∀𝑣𝑈𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) → (𝑉𝑊𝑊𝑈)))
229, 21mpd 15 1 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → (𝑉𝑊𝑊𝑈))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 194  w3a 1030   = wceq 1474  wcel 1976  wral 2895  wrex 2896  Vcvv 3172  cin 3538  wss 3539  𝒫 cpw 4107   I cid 4938   × cxp 5026  ccnv 5027  cres 5030  ccom 5032  cfv 5790  UnifOncust 21755
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1712  ax-4 1727  ax-5 1826  ax-6 1874  ax-7 1921  ax-8 1978  ax-9 1985  ax-10 2005  ax-11 2020  ax-12 2032  ax-13 2232  ax-ext 2589  ax-sep 4703  ax-nul 4712  ax-pow 4764  ax-pr 4828  ax-un 6824
This theorem depends on definitions:  df-bi 195  df-or 383  df-an 384  df-3an 1032  df-tru 1477  df-ex 1695  df-nf 1700  df-sb 1867  df-eu 2461  df-mo 2462  df-clab 2596  df-cleq 2602  df-clel 2605  df-nfc 2739  df-ne 2781  df-ral 2900  df-rex 2901  df-rab 2904  df-v 3174  df-sbc 3402  df-csb 3499  df-dif 3542  df-un 3544  df-in 3546  df-ss 3553  df-nul 3874  df-if 4036  df-pw 4109  df-sn 4125  df-pr 4127  df-op 4131  df-uni 4367  df-br 4578  df-opab 4638  df-mpt 4639  df-id 4943  df-xp 5034  df-rel 5035  df-cnv 5036  df-co 5037  df-dm 5038  df-res 5040  df-iota 5754  df-fun 5792  df-fv 5798  df-ust 21756
This theorem is referenced by:  trust  21785  ustuqtop1  21797  ucnprima  21838
  Copyright terms: Public domain W3C validator