Mathbox for Richard Penner |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > elinlem | Structured version Visualization version GIF version |
Description: Two ways to say a set is a member of an intersection. (Contributed by RP, 19-Aug-2020.) |
Ref | Expression |
---|---|
elinlem | ⊢ (𝐴 ∈ (𝐵 ∩ 𝐶) ↔ (𝐴 ∈ 𝐵 ∧ ( I ‘𝐴) ∈ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elin 4168 | . 2 ⊢ (𝐴 ∈ (𝐵 ∩ 𝐶) ↔ (𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶)) | |
2 | fvi 6734 | . . . . 5 ⊢ (𝐴 ∈ 𝐵 → ( I ‘𝐴) = 𝐴) | |
3 | 2 | eqcomd 2827 | . . . 4 ⊢ (𝐴 ∈ 𝐵 → 𝐴 = ( I ‘𝐴)) |
4 | 3 | eleq1d 2897 | . . 3 ⊢ (𝐴 ∈ 𝐵 → (𝐴 ∈ 𝐶 ↔ ( I ‘𝐴) ∈ 𝐶)) |
5 | 4 | pm5.32i 577 | . 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐴 ∈ 𝐶) ↔ (𝐴 ∈ 𝐵 ∧ ( I ‘𝐴) ∈ 𝐶)) |
6 | 1, 5 | bitri 277 | 1 ⊢ (𝐴 ∈ (𝐵 ∩ 𝐶) ↔ (𝐴 ∈ 𝐵 ∧ ( I ‘𝐴) ∈ 𝐶)) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 208 ∧ wa 398 ∈ wcel 2110 ∩ cin 3934 I cid 5453 ‘cfv 6349 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2157 ax-12 2173 ax-ext 2793 ax-sep 5195 ax-nul 5202 ax-pr 5321 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3496 df-sbc 3772 df-dif 3938 df-un 3940 df-in 3942 df-ss 3951 df-nul 4291 df-if 4467 df-sn 4561 df-pr 4563 df-op 4567 df-uni 4832 df-br 5059 df-opab 5121 df-id 5454 df-xp 5555 df-rel 5556 df-cnv 5557 df-co 5558 df-dm 5559 df-iota 6308 df-fun 6351 df-fv 6357 |
This theorem is referenced by: elcnvcnvlem 39952 |
Copyright terms: Public domain | W3C validator |