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

Theorem isust 22905
 Description: The predicate "𝑈 is a uniform structure with base 𝑋". (Contributed by Thierry Arnoux, 15-Nov-2017.) (Revised by AV, 17-Sep-2021.)
Assertion
Ref Expression
isust (𝑋𝑉 → (𝑈 ∈ (UnifOn‘𝑋) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))))
Distinct variable groups:   𝑤,𝑣,𝑈   𝑣,𝑋,𝑤
Allowed substitution hints:   𝑉(𝑤,𝑣)

Proof of Theorem isust
Dummy variable 𝑢 is distinct from all other variables.
StepHypRef Expression
1 ustval 22904 . . 3 (𝑋𝑉 → (UnifOn‘𝑋) = {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))})
21eleq2d 2838 . 2 (𝑋𝑉 → (𝑈 ∈ (UnifOn‘𝑋) ↔ 𝑈 ∈ {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))}))
3 simp1 1134 . . . 4 ((𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣))) → 𝑈 ⊆ 𝒫 (𝑋 × 𝑋))
4 sqxpexg 7477 . . . . . . . 8 (𝑋𝑉 → (𝑋 × 𝑋) ∈ V)
54pwexd 5249 . . . . . . 7 (𝑋𝑉 → 𝒫 (𝑋 × 𝑋) ∈ V)
65adantr 485 . . . . . 6 ((𝑋𝑉𝑈 ⊆ 𝒫 (𝑋 × 𝑋)) → 𝒫 (𝑋 × 𝑋) ∈ V)
7 simpr 489 . . . . . 6 ((𝑋𝑉𝑈 ⊆ 𝒫 (𝑋 × 𝑋)) → 𝑈 ⊆ 𝒫 (𝑋 × 𝑋))
86, 7ssexd 5195 . . . . 5 ((𝑋𝑉𝑈 ⊆ 𝒫 (𝑋 × 𝑋)) → 𝑈 ∈ V)
98ex 417 . . . 4 (𝑋𝑉 → (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) → 𝑈 ∈ V))
103, 9syl5 34 . . 3 (𝑋𝑉 → ((𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣))) → 𝑈 ∈ V))
11 sseq1 3918 . . . . 5 (𝑢 = 𝑈 → (𝑢 ⊆ 𝒫 (𝑋 × 𝑋) ↔ 𝑈 ⊆ 𝒫 (𝑋 × 𝑋)))
12 eleq2 2841 . . . . 5 (𝑢 = 𝑈 → ((𝑋 × 𝑋) ∈ 𝑢 ↔ (𝑋 × 𝑋) ∈ 𝑈))
13 eleq2 2841 . . . . . . . . 9 (𝑢 = 𝑈 → (𝑤𝑢𝑤𝑈))
1413imbi2d 345 . . . . . . . 8 (𝑢 = 𝑈 → ((𝑣𝑤𝑤𝑢) ↔ (𝑣𝑤𝑤𝑈)))
1514ralbidv 3127 . . . . . . 7 (𝑢 = 𝑈 → (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑢) ↔ ∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈)))
16 eleq2 2841 . . . . . . . 8 (𝑢 = 𝑈 → ((𝑣𝑤) ∈ 𝑢 ↔ (𝑣𝑤) ∈ 𝑈))
1716raleqbi1dv 3322 . . . . . . 7 (𝑢 = 𝑈 → (∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ↔ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈))
18 eleq2 2841 . . . . . . . 8 (𝑢 = 𝑈 → (𝑣𝑢𝑣𝑈))
19 rexeq 3325 . . . . . . . 8 (𝑢 = 𝑈 → (∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣 ↔ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣))
2018, 193anbi23d 1437 . . . . . . 7 (𝑢 = 𝑈 → ((( I ↾ 𝑋) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣) ↔ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))
2115, 17, 203anbi123d 1434 . . . . . 6 (𝑢 = 𝑈 → ((∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)) ↔ (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣))))
2221raleqbi1dv 3322 . . . . 5 (𝑢 = 𝑈 → (∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)) ↔ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣))))
2311, 12, 223anbi123d 1434 . . . 4 (𝑢 = 𝑈 → ((𝑢 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣))) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))))
2423elab3g 3595 . . 3 (((𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣))) → 𝑈 ∈ V) → (𝑈 ∈ {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))} ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))))
2510, 24syl 17 . 2 (𝑋𝑉 → (𝑈 ∈ {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))} ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))))
262, 25bitrd 282 1 (𝑋𝑉 → (𝑈 ∈ (UnifOn‘𝑋) ↔ (𝑈 ⊆ 𝒫 (𝑋 × 𝑋) ∧ (𝑋 × 𝑋) ∈ 𝑈 ∧ ∀𝑣𝑈 (∀𝑤 ∈ 𝒫 (𝑋 × 𝑋)(𝑣𝑤𝑤𝑈) ∧ ∀𝑤𝑈 (𝑣𝑤) ∈ 𝑈 ∧ (( I ↾ 𝑋) ⊆ 𝑣𝑣𝑈 ∧ ∃𝑤𝑈 (𝑤𝑤) ⊆ 𝑣)))))
 Colors of variables: wff setvar class Syntax hints:   → wi 4   ↔ wb 209   ∧ wa 400   ∧ w3a 1085   = wceq 1539   ∈ wcel 2112  {cab 2736  ∀wral 3071  ∃wrex 3072  Vcvv 3410   ∩ cin 3858   ⊆ wss 3859  𝒫 cpw 4495   I cid 5430   × cxp 5523  ◡ccnv 5524   ↾ cres 5527   ∘ ccom 5529  ‘cfv 6336  UnifOncust 22901 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2114  ax-9 2122  ax-10 2143  ax-11 2159  ax-12 2176  ax-ext 2730  ax-sep 5170  ax-nul 5177  ax-pow 5235  ax-pr 5299  ax-un 7460 This theorem depends on definitions:  df-bi 210  df-an 401  df-or 846  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1783  df-nf 1787  df-sb 2071  df-mo 2558  df-eu 2589  df-clab 2737  df-cleq 2751  df-clel 2831  df-nfc 2902  df-ral 3076  df-rex 3077  df-rab 3080  df-v 3412  df-sbc 3698  df-dif 3862  df-un 3864  df-in 3866  df-ss 3876  df-nul 4227  df-if 4422  df-pw 4497  df-sn 4524  df-pr 4526  df-op 4530  df-uni 4800  df-br 5034  df-opab 5096  df-mpt 5114  df-id 5431  df-xp 5531  df-rel 5532  df-cnv 5533  df-co 5534  df-dm 5535  df-res 5537  df-iota 6295  df-fun 6338  df-fv 6344  df-ust 22902 This theorem is referenced by:  ustssxp  22906  ustssel  22907  ustbasel  22908  ustincl  22909  ustdiag  22910  ustinvel  22911  ustexhalf  22912  ustfilxp  22914  ust0  22921  ustbas2  22927  trust  22931  metust  23261
 Copyright terms: Public domain W3C validator