Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

revise df-prjsp #3214

Merged
merged 1 commit into from
May 31, 2023
Merged

revise df-prjsp #3214

merged 1 commit into from
May 31, 2023

Conversation

icecream17
Copy link
Contributor

@icecream17 icecream17 commented May 28, 2023

Restricts the domain of the equivalence relation to not include 0, to make theorems using the equivalence operator nicer


sidenote: I'm stumped on trying to prove something like:

  ${
    $d ph y $.  $d t y $.  $d x y $.
    $( Equivalence between ~ df-ssb and ~ df-sb . $)
    sb11 $p |- ( A. y ( y = t -> A. x ( x = y -> ph ) ) <->
                 ( ( x = t -> ph ) /\ E. x ( x = t /\ ph ) ) ) $=
      ? $.
  $}

The reverse direction becomes ( x = t -> ph ) /\ y = t /\ E. x ( x = t /\ ph ) -> A. x ( x = y -> ph ) after a simple alrimiv which seems so possible but I can't find a solution??? ( x = y -> ph ) is easily provable but there's no easy way to add the quantifier. edit: invalid alrimiv because of $d v condition

@benjub
Copy link
Contributor

benjub commented May 28, 2023

sidenote: I'm stumped on trying to prove something like:

  ${
    $d ph y $.  $d t y $.  $d x y $.
    $( Equivalence between ~ df-ssb and ~ df-sb . $)
    sb11 $p |- ( A. y ( y = t -> A. x ( x = y -> ph ) ) <->
                 ( ( x = t -> ph ) /\ E. x ( x = t /\ ph ) ) ) $=
      ? $.
  $}

This is basically https://us.metamath.org/mpeuni/bj-dfssb2.html (its RHS is df-sb by https://us.metamath.org/mpeuni/dfsb7.html).

Copy link
Contributor

@tirix tirix left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Looks good!

Comment on lines +617520 to +617538
$(
TODO: The proof is that <. a , b , c , ... >. has either a = 0 or a =/= 0.
Since <. 0 , b , c , ... >. .~ <. 0 , nb, nc , ... >., the case a = 0
corresponds to the (n-1)-dimensional projective space. When a =/= 0, there
is <. a , b , c , ... >. .~ <. 1 , b/a, c/a, ... >. Since the later terms
are irreducible it corresponds to all (n-1)-tuples of ( Base ` K ) which is
equivalent to the construction of an affine space. Note that the closest
definition to affine space so far seems to be ~ df-ehl , which is specific
to reals.

prjspnf1om1.1 $e |- F = ??? $.
@( A bijection between an n-dimensional projective space and its
(n-1)-dimensional affine and projective spaces. (Contributed by Steven
Nguyen, ??-??-2023.) @)
prjspnf1om1 @p |- ( ( N e. NN /\ K e. DivRing /\ ?? ) ->
F : ( N PrjSpn K ) -1-1-onto-> ( ( K ^m ( 0 ..^ ( N - 1 ) ) ) u.
( ( N - 1 ) PrjSpn K ) ) ) @=
? $.
$)
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

~f1oun seems to be the best top-level theorem to start with.
Then you can probably explicitly construct the mappings.

@wlammen
Copy link
Contributor

wlammen commented May 31, 2023

@icecream17 left a comment in #3219 , so I think he saw the remarks here, too, and it is safe to merge this pull request.

@wlammen wlammen merged commit 4649515 into metamath:develop May 31, 2023
8 checks passed
@icecream17 icecream17 deleted the local branch May 31, 2023 15:13
@icecream17 icecream17 mentioned this pull request Jul 6, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

4 participants