P1. g=Df (x such that Px) P2. N(Eg–>Pg) P3. N(x)(Px–>NEx) P4. N(Pg–>NEg) P5. N(Eg–>NEg) P6. (g=Df x such that Px) –> N(Eg–>NEg) P7. ~ [(g=Df x such that Px) --> Eg] P8. NEg iif [(g=Df x such that Px) -> Eg] P9. ~NEg C.

P1. g=Df (x such that Px)
P2. N(Eg–>Pg)
P3. N(x)(Px–>NEx)
P4. N(Pg–>NEg)
P5. N(Eg–>NEg)
P6. (g=Df x such that Px) –> N(Eg–>NEg)
P7. ~ [(g=Df x such that Px) --> Eg]
P8. NEg iif [(g=Df x such that Px) -> Eg]
P9. ~NEg
C.  - P1. g=Df (x such that Px)
P2. N(Eg–>Pg)
P3. N(x)(Px–>NEx)
P4. N(Pg–>NEg)
P5. N(Eg–>NEg)
P6. (g=Df x such that Px) –> N(Eg–>NEg)
P7. ~ [(g=Df x such that Px) --> Eg]
P8. NEg iif [(g=Df x such that Px) -> Eg]
P9. ~NEg
C.   Insanity Wolf

106 shares

Like us for More!

Laugh more daily

Like us on Facebook?