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

Theorem ustn0 24245
Description: The empty set is not an uniform structure. (Contributed by Thierry Arnoux, 3-Dec-2017.)
Assertion
Ref Expression
ustn0 ¬ ∅ ∈ ran UnifOn

Proof of Theorem ustn0
Dummy variables 𝑣 𝑢 𝑤 𝑥 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 noel 4344 . . . . 5 ¬ (𝑥 × 𝑥) ∈ ∅
2 0ex 5313 . . . . . 6 ∅ ∈ V
3 eleq2 2828 . . . . . 6 (𝑢 = ∅ → ((𝑥 × 𝑥) ∈ 𝑢 ↔ (𝑥 × 𝑥) ∈ ∅))
42, 3elab 3681 . . . . 5 (∅ ∈ {𝑢 ∣ (𝑥 × 𝑥) ∈ 𝑢} ↔ (𝑥 × 𝑥) ∈ ∅)
51, 4mtbir 323 . . . 4 ¬ ∅ ∈ {𝑢 ∣ (𝑥 × 𝑥) ∈ 𝑢}
6 vex 3482 . . . . . . 7 𝑥 ∈ V
7 velpw 4610 . . . . . . . . . 10 (𝑢 ∈ 𝒫 𝒫 (𝑥 × 𝑥) ↔ 𝑢 ⊆ 𝒫 (𝑥 × 𝑥))
87abbii 2807 . . . . . . . . 9 {𝑢𝑢 ∈ 𝒫 𝒫 (𝑥 × 𝑥)} = {𝑢𝑢 ⊆ 𝒫 (𝑥 × 𝑥)}
9 abid2 2877 . . . . . . . . . 10 {𝑢𝑢 ∈ 𝒫 𝒫 (𝑥 × 𝑥)} = 𝒫 𝒫 (𝑥 × 𝑥)
106, 6xpex 7772 . . . . . . . . . . . 12 (𝑥 × 𝑥) ∈ V
1110pwex 5386 . . . . . . . . . . 11 𝒫 (𝑥 × 𝑥) ∈ V
1211pwex 5386 . . . . . . . . . 10 𝒫 𝒫 (𝑥 × 𝑥) ∈ V
139, 12eqeltri 2835 . . . . . . . . 9 {𝑢𝑢 ∈ 𝒫 𝒫 (𝑥 × 𝑥)} ∈ V
148, 13eqeltrri 2836 . . . . . . . 8 {𝑢𝑢 ⊆ 𝒫 (𝑥 × 𝑥)} ∈ V
15 simp1 1135 . . . . . . . . 9 ((𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣))) → 𝑢 ⊆ 𝒫 (𝑥 × 𝑥))
1615ss2abi 4077 . . . . . . . 8 {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))} ⊆ {𝑢𝑢 ⊆ 𝒫 (𝑥 × 𝑥)}
1714, 16ssexi 5328 . . . . . . 7 {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))} ∈ V
18 df-ust 24225 . . . . . . . 8 UnifOn = (𝑥 ∈ V ↦ {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))})
1918fvmpt2 7027 . . . . . . 7 ((𝑥 ∈ V ∧ {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))} ∈ V) → (UnifOn‘𝑥) = {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))})
206, 17, 19mp2an 692 . . . . . 6 (UnifOn‘𝑥) = {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))}
21 simp2 1136 . . . . . . 7 ((𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣))) → (𝑥 × 𝑥) ∈ 𝑢)
2221ss2abi 4077 . . . . . 6 {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))} ⊆ {𝑢 ∣ (𝑥 × 𝑥) ∈ 𝑢}
2320, 22eqsstri 4030 . . . . 5 (UnifOn‘𝑥) ⊆ {𝑢 ∣ (𝑥 × 𝑥) ∈ 𝑢}
2423sseli 3991 . . . 4 (∅ ∈ (UnifOn‘𝑥) → ∅ ∈ {𝑢 ∣ (𝑥 × 𝑥) ∈ 𝑢})
255, 24mto 197 . . 3 ¬ ∅ ∈ (UnifOn‘𝑥)
2625nex 1797 . 2 ¬ ∃𝑥∅ ∈ (UnifOn‘𝑥)
2718funmpt2 6607 . . . 4 Fun UnifOn
28 elunirn 7271 . . . 4 (Fun UnifOn → (∅ ∈ ran UnifOn ↔ ∃𝑥 ∈ dom UnifOn∅ ∈ (UnifOn‘𝑥)))
2927, 28ax-mp 5 . . 3 (∅ ∈ ran UnifOn ↔ ∃𝑥 ∈ dom UnifOn∅ ∈ (UnifOn‘𝑥))
30 ustfn 24226 . . . . 5 UnifOn Fn V
31 fndm 6672 . . . . 5 (UnifOn Fn V → dom UnifOn = V)
3230, 31ax-mp 5 . . . 4 dom UnifOn = V
3332rexeqi 3323 . . 3 (∃𝑥 ∈ dom UnifOn∅ ∈ (UnifOn‘𝑥) ↔ ∃𝑥 ∈ V ∅ ∈ (UnifOn‘𝑥))
34 rexv 3507 . . 3 (∃𝑥 ∈ V ∅ ∈ (UnifOn‘𝑥) ↔ ∃𝑥∅ ∈ (UnifOn‘𝑥))
3529, 33, 343bitri 297 . 2 (∅ ∈ ran UnifOn ↔ ∃𝑥∅ ∈ (UnifOn‘𝑥))
3626, 35mtbir 323 1 ¬ ∅ ∈ ran UnifOn
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  w3a 1086   = wceq 1537  wex 1776  wcel 2106  {cab 2712  wral 3059  wrex 3068  Vcvv 3478  cin 3962  wss 3963  c0 4339  𝒫 cpw 4605   cuni 4912   I cid 5582   × cxp 5687  ccnv 5688  dom cdm 5689  ran crn 5690  cres 5691  ccom 5693  Fun wfun 6557   Fn wfn 6558  cfv 6563  UnifOncust 24224
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-fv 6571  df-ust 24225
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator