Re: [tlaplus] proving a property of some predefined set item

[Алексей Тимаков <timakov.alan@xxxxxxxxx>]

Hi. Thanks a lot. I will use ASSUME for a while. The example i provided is a simplified version of a real one ).

четверг, 17 февраля 2022 г. в 10:32:39 UTC+3, Stephan Merz:

Hello,

tuple declarations will soon be supported, apologies for the long wait!

However, in your example, they are unnecessary: you can simply write

LEMMA LEM1 ==  ASSUME NEW S1, NEW S2,

                      NEW Set \in SUBSET (S1 \X S2),

                      NEW p \in Set
                      PROVE  p[1] \in S1
               OBVIOUS

which is equivalent, and proved.

Regards,

Stephan

On 16 Feb 2022, at 22:21, Алексей Тимаков <timako...@xxxxxxxxx> wrote:

Hi all.
I'm a newbie on TLAPS and need some help.
Can not manage to prove a simple fact

LEMMA LEM1 ==  ASSUME NEW S1, NEW S2,
                      NEW Set \in SUBSET {<<x, y>> : x \in S1, y \in S2},
                      NEW p \in Set
                      PROVE  p[1] \in S1
               OBVIOUS

Set of tuples is not supported.

However

LEMMA LEM2 ==  ASSUME NEW S1,
                      NEW Set \in SUBSET {x : x \in S1},
                      NEW p \in Set
                      PROVE  p \in S1
               OBVIOUS

works.

Should we accept LEMMA1 as an axiom?

Thanks in advance.

--
You received this message because you are subscribed to the Google Groups "tlaplus" group.
To unsubscribe from this group and stop receiving emails from it, send an email to tlaplus+u...@xxxxxxxxxxxxxxxx.
To view this discussion on the web visit https://groups.google.com/d/msgid/tlaplus/27027cc2-b30b-4efa-a6bd-7dee86f8235bn%40googlegroups.com.

-- 
You received this message because you are subscribed to the Google Groups "tlaplus" group.
To unsubscribe from this group and stop receiving emails from it, send an email to tlaplus+unsubscribe@xxxxxxxxxxxxxxxx.
To view this discussion on the web visit https://groups.google.com/d/msgid/tlaplus/2ba0b528-4c96-47ca-826c-b9bbc51dc70cn%40googlegroups.com.