| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cbv3v2 | Structured version Visualization version GIF version | ||
| Description: Version of cbv3 2400 with two disjoint variable conditions, which does not require ax-11 2156 nor ax-13 2375. (Contributed by BJ, 24-Jun-2019.) (Proof shortened by Wolf Lammen, 30-Aug-2021.) |
| Ref | Expression |
|---|---|
| cbv3v2.nf | ⊢ Ⅎ𝑥𝜓 |
| cbv3v2.1 | ⊢ (𝑥 = 𝑦 → (𝜑 → 𝜓)) |
| Ref | Expression |
|---|---|
| cbv3v2 | ⊢ (∀𝑥𝜑 → ∀𝑦𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbv3v2.nf | . . 3 ⊢ Ⅎ𝑥𝜓 | |
| 2 | cbv3v2.1 | . . 3 ⊢ (𝑥 = 𝑦 → (𝜑 → 𝜓)) | |
| 3 | 1, 2 | spimfv 2238 | . 2 ⊢ (∀𝑥𝜑 → 𝜓) |
| 4 | 3 | alrimiv 1926 | 1 ⊢ (∀𝑥𝜑 → ∀𝑦𝜓) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∀wal 1537 Ⅎwnf 1782 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-12 2176 |
| This theorem depends on definitions: df-bi 207 df-ex 1779 df-nf 1783 |
| This theorem is referenced by: bj-cbv3hv2 36730 |
| Copyright terms: Public domain | W3C validator |