The method of proving something works by first assuming something about it. Then other things are deduced from that. If there is a contradiction, it shows that the first something cannot be correct. For example,= = = Sandoz = = =
ð ə WORD_BOUNDARY m ɛ θ ə d WORD_BOUNDARY ʌ v WORD_BOUNDARY p ɹ uː v ɪ ŋ WORD_BOUNDARY s ʌ m θ ɪ ŋ WORD_BOUNDARY w ɜː k s WORD_BOUNDARY b aɪ WORD_BOUNDARY f ɜː s t WORD_BOUNDARY ʌ s uː m ɪ ŋ WORD_BOUNDARY s ʌ m θ ɪ ŋ WORD_BOUNDARY ʌ b aʊ t WORD_BOUNDARY ɪ t WORD_BOUNDARY ð ɛ n WORD_BOUNDARY ʌ ð ə ɹ WORD_BOUNDARY θ ɪ ŋ z WORD_BOUNDARY ɑ ɹ WORD_BOUNDARY d ɪ d uː s t WORD_BOUNDARY f ɹ ʌ m WORD_BOUNDARY ð æ t WORD_BOUNDARY ɪ f WORD_BOUNDARY ð ɛ ɹ WORD_BOUNDARY ɪ z WORD_BOUNDARY ʌ WORD_BOUNDARY k ɑ n t ɹ ə d ɪ k ʃ ə n WORD_BOUNDARY ɪ t WORD_BOUNDARY ʃ oʊ z WORD_BOUNDARY ð æ t ð ə WORD_BOUNDARY f ɜː s t WORD_BOUNDARY s ʌ m θ ɪ ŋ WORD_BOUNDARY k æ n ɑ t WORD_BOUNDARY b iː WORD_BOUNDARY k ə ɹ ɹ ɛ k t WORD_BOUNDARY f ɔ ɹ WORD_BOUNDARY ɛ ɡ z æ m p ə l WORD_BOUNDARY iː k w ə l z WORD_BOUNDARY iː k w ə l z WORD_BOUNDARY iː k w ə l z WORD_BOUNDARY s æ n d ɑ z WORD_BOUNDARY iː k w ə l z WORD_BOUNDARY iː k w ə l z WORD_BOUNDARY iː k w ə l z WORD_BOUNDARY