Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > rextp | Structured version Visualization version Unicode version |
Description: Convert a quantification over a triple to a disjunction. (Contributed by Mario Carneiro, 23-Apr-2015.) |
Ref | Expression |
---|---|
raltp.1 | |
raltp.2 | |
raltp.3 | |
raltp.4 | |
raltp.5 | |
raltp.6 |
Ref | Expression |
---|---|
rextp |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | raltp.1 | . 2 | |
2 | raltp.2 | . 2 | |
3 | raltp.3 | . 2 | |
4 | raltp.4 | . . 3 | |
5 | raltp.5 | . . 3 | |
6 | raltp.6 | . . 3 | |
7 | 4, 5, 6 | rextpg 4237 | . 2 |
8 | 1, 2, 3, 7 | mp3an 1424 | 1 |
Colors of variables: wff setvar class |
Syntax hints: wi 4 wb 196 w3o 1036 wceq 1483 wcel 1990 wrex 2913 cvv 3200 ctp 4181 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1722 ax-4 1737 ax-5 1839 ax-6 1888 ax-7 1935 ax-9 1999 ax-10 2019 ax-11 2034 ax-12 2047 ax-13 2246 ax-ext 2602 |
This theorem depends on definitions: df-bi 197 df-or 385 df-an 386 df-3or 1038 df-3an 1039 df-tru 1486 df-ex 1705 df-nf 1710 df-sb 1881 df-clab 2609 df-cleq 2615 df-clel 2618 df-nfc 2753 df-rex 2918 df-v 3202 df-sbc 3436 df-un 3579 df-sn 4178 df-pr 4180 df-tp 4182 |
This theorem is referenced by: 1cubr 24569 |
Copyright terms: Public domain | W3C validator |