Mathbox for Wolf Lammen |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > wl-aetr | Structured version Visualization version GIF version |
Description: A transitive law for variable identifying expressions. (Contributed by Wolf Lammen, 30-Jun-2019.) |
Ref | Expression |
---|---|
wl-aetr | ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥 𝑥 = 𝑧 → ∀𝑦 𝑦 = 𝑧)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ax7 2026 | . . 3 ⊢ (𝑥 = 𝑦 → (𝑥 = 𝑧 → 𝑦 = 𝑧)) | |
2 | 1 | al2imi 1823 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥 𝑥 = 𝑧 → ∀𝑥 𝑦 = 𝑧)) |
3 | axc11 2429 | . 2 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥 𝑦 = 𝑧 → ∀𝑦 𝑦 = 𝑧)) | |
4 | 2, 3 | syld 47 | 1 ⊢ (∀𝑥 𝑥 = 𝑦 → (∀𝑥 𝑥 = 𝑧 → ∀𝑦 𝑦 = 𝑧)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∀wal 1541 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1976 ax-7 2018 ax-10 2143 ax-12 2177 ax-13 2371 |
This theorem depends on definitions: df-bi 210 df-an 400 df-ex 1788 df-nf 1792 |
This theorem is referenced by: wl-ax11-lem1 35422 wl-ax11-lem3 35424 |
Copyright terms: Public domain | W3C validator |