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

Theorem ustn0 22829
 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 4250 . . . . 5 ¬ (𝑥 × 𝑥) ∈ ∅
2 0ex 5178 . . . . . 6 ∅ ∈ V
3 eleq2 2881 . . . . . 6 (𝑢 = ∅ → ((𝑥 × 𝑥) ∈ 𝑢 ↔ (𝑥 × 𝑥) ∈ ∅))
42, 3elab 3618 . . . . 5 (∅ ∈ {𝑢 ∣ (𝑥 × 𝑥) ∈ 𝑢} ↔ (𝑥 × 𝑥) ∈ ∅)
51, 4mtbir 326 . . . 4 ¬ ∅ ∈ {𝑢 ∣ (𝑥 × 𝑥) ∈ 𝑢}
6 vex 3447 . . . . . . 7 𝑥 ∈ V
7 velpw 4505 . . . . . . . . . 10 (𝑢 ∈ 𝒫 𝒫 (𝑥 × 𝑥) ↔ 𝑢 ⊆ 𝒫 (𝑥 × 𝑥))
87abbii 2866 . . . . . . . . 9 {𝑢𝑢 ∈ 𝒫 𝒫 (𝑥 × 𝑥)} = {𝑢𝑢 ⊆ 𝒫 (𝑥 × 𝑥)}
9 abid2 2935 . . . . . . . . . 10 {𝑢𝑢 ∈ 𝒫 𝒫 (𝑥 × 𝑥)} = 𝒫 𝒫 (𝑥 × 𝑥)
106, 6xpex 7460 . . . . . . . . . . . 12 (𝑥 × 𝑥) ∈ V
1110pwex 5249 . . . . . . . . . . 11 𝒫 (𝑥 × 𝑥) ∈ V
1211pwex 5249 . . . . . . . . . 10 𝒫 𝒫 (𝑥 × 𝑥) ∈ V
139, 12eqeltri 2889 . . . . . . . . 9 {𝑢𝑢 ∈ 𝒫 𝒫 (𝑥 × 𝑥)} ∈ V
148, 13eqeltrri 2890 . . . . . . . 8 {𝑢𝑢 ⊆ 𝒫 (𝑥 × 𝑥)} ∈ V
15 simp1 1133 . . . . . . . . 9 ((𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣))) → 𝑢 ⊆ 𝒫 (𝑥 × 𝑥))
1615ss2abi 3997 . . . . . . . 8 {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))} ⊆ {𝑢𝑢 ⊆ 𝒫 (𝑥 × 𝑥)}
1714, 16ssexi 5193 . . . . . . 7 {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))} ∈ V
18 df-ust 22809 . . . . . . . 8 UnifOn = (𝑥 ∈ V ↦ {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))})
1918fvmpt2 6760 . . . . . . 7 ((𝑥 ∈ V ∧ {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))} ∈ V) → (UnifOn‘𝑥) = {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))})
206, 17, 19mp2an 691 . . . . . 6 (UnifOn‘𝑥) = {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))}
21 simp2 1134 . . . . . . 7 ((𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣))) → (𝑥 × 𝑥) ∈ 𝑢)
2221ss2abi 3997 . . . . . 6 {𝑢 ∣ (𝑢 ⊆ 𝒫 (𝑥 × 𝑥) ∧ (𝑥 × 𝑥) ∈ 𝑢 ∧ ∀𝑣𝑢 (∀𝑤 ∈ 𝒫 (𝑥 × 𝑥)(𝑣𝑤𝑤𝑢) ∧ ∀𝑤𝑢 (𝑣𝑤) ∈ 𝑢 ∧ (( I ↾ 𝑥) ⊆ 𝑣𝑣𝑢 ∧ ∃𝑤𝑢 (𝑤𝑤) ⊆ 𝑣)))} ⊆ {𝑢 ∣ (𝑥 × 𝑥) ∈ 𝑢}
2320, 22eqsstri 3952 . . . . 5 (UnifOn‘𝑥) ⊆ {𝑢 ∣ (𝑥 × 𝑥) ∈ 𝑢}
2423sseli 3914 . . . 4 (∅ ∈ (UnifOn‘𝑥) → ∅ ∈ {𝑢 ∣ (𝑥 × 𝑥) ∈ 𝑢})
255, 24mto 200 . . 3 ¬ ∅ ∈ (UnifOn‘𝑥)
2625nex 1802 . 2 ¬ ∃𝑥∅ ∈ (UnifOn‘𝑥)
2718funmpt2 6367 . . . 4 Fun UnifOn
28 elunirn 6992 . . . 4 (Fun UnifOn → (∅ ∈ ran UnifOn ↔ ∃𝑥 ∈ dom UnifOn∅ ∈ (UnifOn‘𝑥)))
2927, 28ax-mp 5 . . 3 (∅ ∈ ran UnifOn ↔ ∃𝑥 ∈ dom UnifOn∅ ∈ (UnifOn‘𝑥))
30 ustfn 22810 . . . . 5 UnifOn Fn V
31 fndm 6429 . . . . 5 (UnifOn Fn V → dom UnifOn = V)
3230, 31ax-mp 5 . . . 4 dom UnifOn = V
3332rexeqi 3366 . . 3 (∃𝑥 ∈ dom UnifOn∅ ∈ (UnifOn‘𝑥) ↔ ∃𝑥 ∈ V ∅ ∈ (UnifOn‘𝑥))
34 rexv 3470 . . 3 (∃𝑥 ∈ V ∅ ∈ (UnifOn‘𝑥) ↔ ∃𝑥∅ ∈ (UnifOn‘𝑥))
3529, 33, 343bitri 300 . 2 (∅ ∈ ran UnifOn ↔ ∃𝑥∅ ∈ (UnifOn‘𝑥))
3626, 35mtbir 326 1 ¬ ∅ ∈ ran UnifOn
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ w3a 1084   = wceq 1538  ∃wex 1781   ∈ wcel 2112  {cab 2779  ∀wral 3109  ∃wrex 3110  Vcvv 3444   ∩ cin 3883   ⊆ wss 3884  ∅c0 4246  𝒫 cpw 4500  ∪ cuni 4803   I cid 5427   × cxp 5521  ◡ccnv 5522  dom cdm 5523  ran crn 5524   ↾ cres 5525   ∘ ccom 5527  Fun wfun 6322   Fn wfn 6323  ‘cfv 6328  UnifOncust 22808 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-csb 3832  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-rn 5534  df-res 5535  df-ima 5536  df-iota 6287  df-fun 6330  df-fn 6331  df-fv 6336  df-ust 22809 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator