| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: Induction step for constructing a substitution instance of ax-11o 1224 without using ax-11o 1224. Quantification case. When z and y are distinct, this theorem avoids the dummy variables needed by the more general ax11inda 1377. |
| Ref | Expression |
|---|---|
| ax11inda2.1 | ⊢ (¬ ∀x x = y → (x = y → (φ → ∀x(x = y → φ)))) |
| Ref | Expression |
|---|---|
| ax11inda2 | ⊢ (¬ ∀x x = y → (x = y → (∀zφ → ∀x(x = y → ∀zφ)))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | a16g 1282 | . . . . 5 ⊢ (∀y y = z → ((x = y → ∀zφ) → ∀x(x = y → ∀zφ))) | |
| 2 | ax-1 4 | . . . . 5 ⊢ (∀zφ → (x = y → ∀zφ)) | |
| 3 | 1, 2 | syl5 21 | . . . 4 ⊢ (∀y y = z → (∀zφ → ∀x(x = y → ∀zφ))) |
| 4 | 3 | a1d 12 | . . 3 ⊢ (∀y y = z → (x = y → (∀zφ → ∀x(x = y → ∀zφ)))) |
| 5 | 4 | a1d 12 | . 2 ⊢ (∀y y = z → (¬ ∀x x = y → (x = y → (∀zφ → ∀x(x = y → ∀zφ))))) |
| 6 | ax11inda2.1 | . . 3 ⊢ (¬ ∀x x = y → (x = y → (φ → ∀x(x = y → φ)))) | |
| 7 | 6 | ax11indalem 1374 | . 2 ⊢ (¬ ∀y y = z → (¬ ∀x x = y → (x = y → (∀zφ → ∀x(x = y → ∀zφ))))) |
| 8 | 5, 7 | pm2.61i 126 | 1 ⊢ (¬ ∀x x = y → (x = y → (∀zφ → ∀x(x = y → ∀zφ)))) |
| Colors of variables: wff set class |
| Syntax hints: ¬ wn 2 → wi 3 ∀wal 958 = wceq 960 |
| This theorem is referenced by: ax11inda 1377 |
| This theorem was proved from axioms: ax-1 4 ax-2 5 ax-3 6 ax-mp 7 ax-7 966 ax-gen 967 ax-8 968 ax-9 969 ax-10 970 ax-12 972 ax-4 977 ax-5o 979 ax-6o 982 ax-9o 1129 ax-10o 1146 ax-16 1216 |
| This theorem depends on definitions: df-bi 147 df-an 225 |