 Mathbox for Norm Megill < Previous   Next > Nearby theorems Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  ax12indi Structured version   Visualization version   GIF version

Theorem ax12indi 34965
 Description: Induction step for constructing a substitution instance of ax-c15 34910 without using ax-c15 34910. Implication case. (Contributed by NM, 21-Jan-2007.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypotheses
Ref Expression
ax12indn.1 (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦𝜑))))
ax12indi.2 (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (𝜓 → ∀𝑥(𝑥 = 𝑦𝜓))))
Assertion
Ref Expression
ax12indi (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → ((𝜑𝜓) → ∀𝑥(𝑥 = 𝑦 → (𝜑𝜓)))))

Proof of Theorem ax12indi
StepHypRef Expression
1 ax12indn.1 . . . . . 6 (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (𝜑 → ∀𝑥(𝑥 = 𝑦𝜑))))
21ax12indn 34964 . . . . 5 (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (¬ 𝜑 → ∀𝑥(𝑥 = 𝑦 → ¬ 𝜑))))
32imp 396 . . . 4 ((¬ ∀𝑥 𝑥 = 𝑦𝑥 = 𝑦) → (¬ 𝜑 → ∀𝑥(𝑥 = 𝑦 → ¬ 𝜑)))
4 pm2.21 121 . . . . . 6 𝜑 → (𝜑𝜓))
54imim2i 16 . . . . 5 ((𝑥 = 𝑦 → ¬ 𝜑) → (𝑥 = 𝑦 → (𝜑𝜓)))
65alimi 1907 . . . 4 (∀𝑥(𝑥 = 𝑦 → ¬ 𝜑) → ∀𝑥(𝑥 = 𝑦 → (𝜑𝜓)))
73, 6syl6 35 . . 3 ((¬ ∀𝑥 𝑥 = 𝑦𝑥 = 𝑦) → (¬ 𝜑 → ∀𝑥(𝑥 = 𝑦 → (𝜑𝜓))))
8 ax12indi.2 . . . . 5 (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → (𝜓 → ∀𝑥(𝑥 = 𝑦𝜓))))
98imp 396 . . . 4 ((¬ ∀𝑥 𝑥 = 𝑦𝑥 = 𝑦) → (𝜓 → ∀𝑥(𝑥 = 𝑦𝜓)))
10 ax-1 6 . . . . . 6 (𝜓 → (𝜑𝜓))
1110imim2i 16 . . . . 5 ((𝑥 = 𝑦𝜓) → (𝑥 = 𝑦 → (𝜑𝜓)))
1211alimi 1907 . . . 4 (∀𝑥(𝑥 = 𝑦𝜓) → ∀𝑥(𝑥 = 𝑦 → (𝜑𝜓)))
139, 12syl6 35 . . 3 ((¬ ∀𝑥 𝑥 = 𝑦𝑥 = 𝑦) → (𝜓 → ∀𝑥(𝑥 = 𝑦 → (𝜑𝜓))))
147, 13jad 176 . 2 ((¬ ∀𝑥 𝑥 = 𝑦𝑥 = 𝑦) → ((𝜑𝜓) → ∀𝑥(𝑥 = 𝑦 → (𝜑𝜓))))
1514ex 402 1 (¬ ∀𝑥 𝑥 = 𝑦 → (𝑥 = 𝑦 → ((𝜑𝜓) → ∀𝑥(𝑥 = 𝑦 → (𝜑𝜓)))))
 Colors of variables: wff setvar class Syntax hints:  ¬ wn 3   → wi 4   ∧ wa 385  ∀wal 1651 This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1891  ax-4 1905  ax-5 2006  ax-6 2072  ax-7 2107  ax-10 2185  ax-12 2213 This theorem depends on definitions:  df-bi 199  df-an 386  df-ex 1876 This theorem is referenced by: (None)
 Copyright terms: Public domain W3C validator