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

Theorem ustssel 22815
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 1133 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → 𝑈 ∈ (UnifOn‘𝑋))
21elfvexd 6683 . . . . . 6 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → 𝑋 ∈ V)
3 isust 22813 . . . . . 6 (𝑋 ∈ V → (𝑈 ∈ (UnifOn‘𝑋) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))))
42, 3syl 17 . . . . 5 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → (𝑈 ∈ (UnifOn‘𝑋) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))))
51, 4mpbid 235 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣))))
65simp3d 1141 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))
7 simp1 1133 . . . 4 ((∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)) → ∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈))
87ralimi 3131 . . 3 (∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)) → ∀𝑣𝑈𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈))
96, 8syl 17 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → ∀𝑣𝑈𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈))
10 simp2 1134 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → 𝑉𝑈)
112, 2xpexd 7458 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → (𝑋 × 𝑋) ∈ V)
12 simp3 1135 . . . 4 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → 𝑊 ⊆ (𝑋 × 𝑋))
1311, 12sselpwd 5197 . . 3 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → 𝑊 ∈ 𝒫 (𝑋 × 𝑋))
14 sseq1 3943 . . . . 5 (𝑣 = 𝑉 → (𝑣𝑤𝑉𝑤))
1514imbi1d 345 . . . 4 (𝑣 = 𝑉 → ((𝑣𝑤𝑤𝑈) ↔ (𝑉𝑤𝑤𝑈)))
16 sseq2 3944 . . . . 5 (𝑤 = 𝑊 → (𝑉𝑤𝑉𝑊))
17 eleq1 2880 . . . . 5 (𝑤 = 𝑊 → (𝑤𝑈𝑊𝑈))
1816, 17imbi12d 348 . . . 4 (𝑤 = 𝑊 → ((𝑉𝑤𝑤𝑈) ↔ (𝑉𝑊𝑊𝑈)))
1915, 18rspc2v 3584 . . 3 ((𝑉𝑈𝑊 ∈ 𝒫 (𝑋 × 𝑋)) → (∀𝑣𝑈𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) → (𝑉𝑊𝑊𝑈)))
2010, 13, 19syl2anc 587 . 2 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → (∀𝑣𝑈𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) → (𝑉𝑊𝑊𝑈)))
219, 20mpd 15 1 ((𝑈 ∈ (UnifOn‘𝑋) ∧ 𝑉𝑈𝑊 ⊆ (𝑋 × 𝑋)) → (𝑉𝑊𝑊𝑈))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 209  w3a 1084   = wceq 1538  wcel 2112  wral 3109  wrex 3110  Vcvv 3444  cin 3883  wss 3884  𝒫 cpw 4500   I cid 5427   × cxp 5521  ccnv 5522  cres 5525  ccom 5527  cfv 6328  UnifOncust 22809
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 1911  ax-6 1970  ax-7 2015  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2773  ax-sep 5170  ax-nul 5177  ax-pow 5234  ax-pr 5298  ax-un 7445
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 845  df-3an 1086  df-tru 1541  df-ex 1782  df-nf 1786  df-sb 2070  df-mo 2601  df-eu 2632  df-clab 2780  df-cleq 2794  df-clel 2873  df-nfc 2941  df-ral 3114  df-rex 3115  df-rab 3118  df-v 3446  df-sbc 3724  df-dif 3887  df-un 3889  df-in 3891  df-ss 3901  df-nul 4247  df-if 4429  df-pw 4502  df-sn 4529  df-pr 4531  df-op 4535  df-uni 4804  df-br 5034  df-opab 5096  df-mpt 5114  df-id 5428  df-xp 5529  df-rel 5530  df-cnv 5531  df-co 5532  df-dm 5533  df-res 5535  df-iota 6287  df-fun 6330  df-fv 6336  df-ust 22810
This theorem is referenced by:  trust  22839  ustuqtop1  22851  ucnprima  22892
  Copyright terms: Public domain W3C validator