![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > intpr | Structured version Visualization version GIF version |
Description: The intersection of a pair is the intersection of its members. Theorem 71 of [Suppes] p. 42. (Contributed by NM, 14-Oct-1999.) Prove from intprg 4984. (Revised by BJ, 1-Sep-2024.) |
Ref | Expression |
---|---|
intpr.1 | ⊢ 𝐴 ∈ V |
intpr.2 | ⊢ 𝐵 ∈ V |
Ref | Expression |
---|---|
intpr | ⊢ ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | intpr.1 | . 2 ⊢ 𝐴 ∈ V | |
2 | intpr.2 | . 2 ⊢ 𝐵 ∈ V | |
3 | intprg 4984 | . 2 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵)) | |
4 | 1, 2, 3 | mp2an 691 | 1 ⊢ ∩ {𝐴, 𝐵} = (𝐴 ∩ 𝐵) |
Colors of variables: wff setvar class |
Syntax hints: = wceq 1542 ∈ wcel 2107 Vcvv 3475 ∩ cin 3946 {cpr 4629 ∩ cint 4949 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-ext 2704 |
This theorem depends on definitions: df-bi 206 df-an 398 df-or 847 df-tru 1545 df-ex 1783 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-v 3477 df-un 3952 df-in 3954 df-sn 4628 df-pr 4630 df-int 4950 |
This theorem is referenced by: intprgOLD 4987 uniintsn 4990 op1stb 5470 fiint 9320 shincli 30593 chincli 30691 |
Copyright terms: Public domain | W3C validator |