Higher-Order Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > HOLE Home > Th. List > ax7 | Unicode version |
Description: Axiom of Quantifier Commutation. Axiom scheme C6' in [Megill] p. 448 (p. 16 of the preprint). (Contributed by Mario Carneiro, 10-Oct-2014.) |
Ref | Expression |
---|---|
ax7.1 |
Ref | Expression |
---|---|
ax7 |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | wal 134 | . . . . . . . 8 | |
2 | ax7.1 | . . . . . . . . 9 | |
3 | 2 | wl 66 | . . . . . . . 8 |
4 | 1, 3 | wc 50 | . . . . . . 7 |
5 | 4 | ax4 150 | . . . . . 6 |
6 | 2 | ax4 150 | . . . . . 6 |
7 | 5, 6 | syl 16 | . . . . 5 |
8 | 4 | wl 66 | . . . . . 6 |
9 | wv 64 | . . . . . 6 | |
10 | 1, 9 | ax-17 105 | . . . . . 6 |
11 | 4, 9 | ax-hbl1 103 | . . . . . 6 |
12 | 1, 8, 9, 10, 11 | hbc 110 | . . . . 5 |
13 | 7, 12 | alrimi 182 | . . . 4 |
14 | 1, 9 | ax-17 105 | . . . . 5 |
15 | 2, 9 | ax-hbl1 103 | . . . . . . 7 |
16 | 1, 3, 9, 14, 15 | hbc 110 | . . . . . 6 |
17 | 4, 9, 16 | hbl 112 | . . . . 5 |
18 | 1, 8, 9, 14, 17 | hbc 110 | . . . 4 |
19 | 13, 18 | alrimi 182 | . . 3 |
20 | wtru 43 | . . 3 | |
21 | 19, 20 | adantl 56 | . 2 |
22 | 21 | ex 158 | 1 |
Colors of variables: type var term |
Syntax hints: tv 1 ht 2 hb 3 kc 5 kl 6 kt 8 kbr 9 wffMMJ2 11 wffMMJ2t 12 tim 121 tal 122 |
This theorem was proved from axioms: ax-syl 15 ax-jca 17 ax-simpl 20 ax-simpr 21 ax-id 24 ax-trud 26 ax-cb1 29 ax-cb2 30 ax-wctl 31 ax-wctr 32 ax-weq 40 ax-refl 42 ax-eqmp 45 ax-ded 46 ax-wct 47 ax-wc 49 ax-ceq 51 ax-wv 63 ax-wl 65 ax-beta 67 ax-distrc 68 ax-leq 69 ax-distrl 70 ax-wov 71 ax-eqtypi 77 ax-eqtypri 80 ax-hbl1 103 ax-17 105 ax-inst 113 ax-eta 177 |
This theorem depends on definitions: df-ov 73 df-al 126 df-an 128 df-im 129 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |