![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > biantru | Structured version Visualization version GIF version |
Description: A wff is equivalent to its conjunction with truth. (Contributed by NM, 26-May-1993.) |
Ref | Expression |
---|---|
biantru.1 | ⊢ 𝜑 |
Ref | Expression |
---|---|
biantru | ⊢ (𝜓 ↔ (𝜓 ∧ 𝜑)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | biantru.1 | . 2 ⊢ 𝜑 | |
2 | iba 528 | . 2 ⊢ (𝜑 → (𝜓 ↔ (𝜓 ∧ 𝜑))) | |
3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝜓 ↔ (𝜓 ∧ 𝜑)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 396 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 |
This theorem depends on definitions: df-bi 206 df-an 397 |
This theorem is referenced by: biantrur 531 pm4.71 558 eu6lem 2571 eu6 2572 issetlem 2817 rextru 3079 rexcom4b 3473 eueq 3665 ssrabeq 4041 nsspssun 4216 disjpss 4419 reusngf 4632 reuprg0 4662 reuprg 4663 pr1eqbg 4813 disjprgw 5099 disjprg 5100 ax6vsep 5259 pwun 5528 dfid3 5533 elvv 5705 elvvv 5706 dfres3 5941 resopab 5987 xpcan2 6128 funfn 6529 dffn2 6668 dffn3 6679 dffn4 6760 fsn 7078 sucexb 7736 fparlem1 8041 wfrlem8OLD 8259 ixp0x 8861 ac6sfi 9228 fiint 9265 rankc1 9803 cf0 10184 ccatrcan 14604 prmreclem2 16786 subislly 22828 ovoliunlem1 24862 plyun0 25554 dmscut 27146 tgjustf 27313 ercgrg 27357 0wlk 28958 0trl 28964 0pth 28967 0cycl 28976 nmoolb 29611 hlimreui 30079 nmoplb 30747 nmfnlb 30764 dmdbr5ati 31262 disjunsn 31410 fsumcvg4 32422 ind1a 32509 issibf 32824 bnj1174 33506 derang0 33654 subfacp1lem6 33670 satfdm 33854 bj-denoteslem 35326 bj-rexcom4bv 35338 bj-rexcom4b 35339 bj-tagex 35447 bj-dfid2ALT 35525 bj-restuni 35557 rdgeqoa 35830 ftc1anclem5 36144 disjressuc2 36839 eqvrelcoss3 37069 dfeldisj5 37172 dibord 39611 ifpnot 41722 ifpdfxor 41739 ifpid1g 41746 ifpim1g 41753 ifpimimb 41756 relopabVD 43163 euabsneu 45232 rmotru 46859 reutru 46860 |
Copyright terms: Public domain | W3C validator |