| Metamath Proof Explorer |
< Previous
Next >
Related theorems GIF version |
| Description: A distinctor elimination lemma. Formula-builder for universal quantifier. |
| Ref | Expression |
|---|---|
| del34.1 | ⊢ (∀x x = y → (φ → ψ)) |
| Ref | Expression |
|---|---|
| del34 | ⊢ (∀x x = y → (∀xφ → ∀yψ)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | del34.1 | . . . 4 ⊢ (∀x x = y → (φ → ψ)) | |
| 2 | 1 | 19.20ii 692 | . . 3 ⊢ (∀x∀x x = y → (∀xφ → ∀xψ)) |
| 3 | 2 | eq5s 825 | . 2 ⊢ (∀x x = y → (∀xφ → ∀xψ)) |
| 4 | ax-10 800 | . 2 ⊢ (∀x x = y → (∀xψ → ∀yψ)) | |
| 5 | 3, 4 | syld 27 | 1 ⊢ (∀x x = y → (∀xφ → ∀yψ)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 2 ∀wal 672 = weq 797 |
| This theorem is referenced by: del34b 837 del41 840 |
| This theorem was proved from axioms: ax-1 3 ax-2 4 ax-3 5 ax-mp 6 ax-4 673 ax-5 674 ax-6 675 ax-7 676 ax-gen 677 ax-8 798 ax-9 799 ax-10 800 ax-12 802 |
| This theorem depends on definitions: df-bi 128 df-an 198 df-ex 679 |