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

Theorem ustn0 22024
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 3919 . . . . 5 ¬ (𝑥 × 𝑥) ∈ ∅
2 0ex 4790 . . . . . 6 ∅ ∈ V
3 eleq2 2690 . . . . . 6 (𝑢 = ∅ → ((𝑥 × 𝑥) ∈ 𝑢 ↔ (𝑥 × 𝑥) ∈ ∅))
42, 3elab 3350 . . . . 5 (∅ ∈ {𝑢 ∣ (𝑥 × 𝑥) ∈ 𝑢} ↔ (𝑥 × 𝑥) ∈ ∅)
51, 4mtbir 313 . . . 4 ¬ ∅ ∈ {𝑢 ∣ (𝑥 × 𝑥) ∈ 𝑢}
6 vex 3203 . . . . . . 7 𝑥 ∈ V
7 selpw 4165 . . . . . . . . . 10 (𝑢 ∈ 𝒫 𝒫 (𝑥 × 𝑥) ↔ 𝑢 ⊆ 𝒫 (𝑥 × 𝑥))
87abbii 2739 . . . . . . . . 9 {𝑢𝑢 ∈ 𝒫 𝒫 (𝑥 × 𝑥)} = {𝑢𝑢 ⊆ 𝒫 (𝑥 × 𝑥)}
9 abid2 2745 . . . . . . . . . 10 {𝑢𝑢 ∈ 𝒫 𝒫 (𝑥 × 𝑥)} = 𝒫 𝒫 (𝑥 × 𝑥)
106, 6xpex 6962 . . . . . . . . . . . 12 (𝑥 × 𝑥) ∈ V
1110pwex 4848 . . . . . . . . . . 11 𝒫 (𝑥 × 𝑥) ∈ V
1211pwex 4848 . . . . . . . . . 10 𝒫 𝒫 (𝑥 × 𝑥) ∈ V
139, 12eqeltri 2697 . . . . . . . . 9 {𝑢𝑢 ∈ 𝒫 𝒫 (𝑥 × 𝑥)} ∈ V
148, 13eqeltrri 2698 . . . . . . . 8 {𝑢𝑢 ⊆ 𝒫 (𝑥 × 𝑥)} ∈ V
15 simp1 1061 . . . . . . . . 9 ((𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣))) → 𝑢 ⊆ 𝒫 (𝑥 × 𝑥))
1615ss2abi 3674 . . . . . . . 8 {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))} ⊆ {𝑢𝑢 ⊆ 𝒫 (𝑥 × 𝑥)}
1714, 16ssexi 4803 . . . . . . 7 {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))} ∈ V
18 df-ust 22004 . . . . . . . 8 UnifOn = (𝑥 ∈ V ↦ {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))})
1918fvmpt2 6291 . . . . . . 7 ((𝑥 ∈ V ∧ {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))} ∈ V) → (UnifOn‘𝑥) = {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))})
206, 17, 19mp2an 708 . . . . . 6 (UnifOn‘𝑥) = {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))}
21 simp2 1062 . . . . . . 7 ((𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣))) → (𝑥 × 𝑥) ∈ 𝑢)
2221ss2abi 3674 . . . . . 6 {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))} ⊆ {𝑢 ∣ (𝑥 × 𝑥) ∈ 𝑢}
2320, 22eqsstri 3635 . . . . 5 (UnifOn‘𝑥) ⊆ {𝑢 ∣ (𝑥 × 𝑥) ∈ 𝑢}
2423sseli 3599 . . . 4 (∅ ∈ (UnifOn‘𝑥) → ∅ ∈ {𝑢 ∣ (𝑥 × 𝑥) ∈ 𝑢})
255, 24mto 188 . . 3 ¬ ∅ ∈ (UnifOn‘𝑥)
2625nex 1731 . 2 ¬ ∃𝑥∅ ∈ (UnifOn‘𝑥)
2718funmpt2 5927 . . . 4 Fun UnifOn
28 elunirn 6509 . . . 4 (Fun UnifOn → (∅ ∈ ran UnifOn ↔ ∃𝑥 ∈ dom UnifOn∅ ∈ (UnifOn‘𝑥)))
2927, 28ax-mp 5 . . 3 (∅ ∈ ran UnifOn ↔ ∃𝑥 ∈ dom UnifOn∅ ∈ (UnifOn‘𝑥))
30 ustfn 22005 . . . . 5 UnifOn Fn V
31 fndm 5990 . . . . 5 (UnifOn Fn V → dom UnifOn = V)
3230, 31ax-mp 5 . . . 4 dom UnifOn = V
3332rexeqi 3143 . . 3 (∃𝑥 ∈ dom UnifOn∅ ∈ (UnifOn‘𝑥) ↔ ∃𝑥 ∈ V ∅ ∈ (UnifOn‘𝑥))
34 rexv 3220 . . 3 (∃𝑥 ∈ V ∅ ∈ (UnifOn‘𝑥) ↔ ∃𝑥∅ ∈ (UnifOn‘𝑥))
3529, 33, 343bitri 286 . 2 (∅ ∈ ran UnifOn ↔ ∃𝑥∅ ∈ (UnifOn‘𝑥))
3626, 35mtbir 313 1 ¬ ∅ ∈ ran UnifOn
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 196  w3a 1037   = wceq 1483  wex 1704  wcel 1990  {cab 2608  wral 2912  wrex 2913  Vcvv 3200  cin 3573  wss 3574  c0 3915  𝒫 cpw 4158   cuni 4436   I cid 5023   × cxp 5112  ccnv 5113  dom cdm 5114  ran crn 5115  cres 5116  ccom 5118  Fun wfun 5882   Fn wfn 5883  cfv 5888  UnifOncust 22003
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-fv 5896  df-ust 22004
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator