New Foundations Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > NFE Home > Th. List > inpreima | GIF version |
Description: Preimage of an intersection. (Contributed by Jeff Madsen, 2-Sep-2009.) |
Ref | Expression |
---|---|
inpreima | ⊢ (Fun F → (◡F “ (A ∩ B)) = ((◡F “ A) ∩ (◡F “ B))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | funfn 5136 | . 2 ⊢ (Fun F ↔ F Fn dom F) | |
2 | elin 3219 | . . . . . . . 8 ⊢ ((F ‘x) ∈ (A ∩ B) ↔ ((F ‘x) ∈ A ∧ (F ‘x) ∈ B)) | |
3 | 2 | anbi2i 675 | . . . . . . 7 ⊢ ((x ∈ dom F ∧ (F ‘x) ∈ (A ∩ B)) ↔ (x ∈ dom F ∧ ((F ‘x) ∈ A ∧ (F ‘x) ∈ B))) |
4 | 3 | a1i 10 | . . . . . 6 ⊢ (F Fn dom F → ((x ∈ dom F ∧ (F ‘x) ∈ (A ∩ B)) ↔ (x ∈ dom F ∧ ((F ‘x) ∈ A ∧ (F ‘x) ∈ B)))) |
5 | anandi 801 | . . . . . 6 ⊢ ((x ∈ dom F ∧ ((F ‘x) ∈ A ∧ (F ‘x) ∈ B)) ↔ ((x ∈ dom F ∧ (F ‘x) ∈ A) ∧ (x ∈ dom F ∧ (F ‘x) ∈ B))) | |
6 | 4, 5 | syl6bb 252 | . . . . 5 ⊢ (F Fn dom F → ((x ∈ dom F ∧ (F ‘x) ∈ (A ∩ B)) ↔ ((x ∈ dom F ∧ (F ‘x) ∈ A) ∧ (x ∈ dom F ∧ (F ‘x) ∈ B)))) |
7 | elpreima 5407 | . . . . 5 ⊢ (F Fn dom F → (x ∈ (◡F “ (A ∩ B)) ↔ (x ∈ dom F ∧ (F ‘x) ∈ (A ∩ B)))) | |
8 | elpreima 5407 | . . . . . 6 ⊢ (F Fn dom F → (x ∈ (◡F “ A) ↔ (x ∈ dom F ∧ (F ‘x) ∈ A))) | |
9 | elpreima 5407 | . . . . . 6 ⊢ (F Fn dom F → (x ∈ (◡F “ B) ↔ (x ∈ dom F ∧ (F ‘x) ∈ B))) | |
10 | 8, 9 | anbi12d 691 | . . . . 5 ⊢ (F Fn dom F → ((x ∈ (◡F “ A) ∧ x ∈ (◡F “ B)) ↔ ((x ∈ dom F ∧ (F ‘x) ∈ A) ∧ (x ∈ dom F ∧ (F ‘x) ∈ B)))) |
11 | 6, 7, 10 | 3bitr4d 276 | . . . 4 ⊢ (F Fn dom F → (x ∈ (◡F “ (A ∩ B)) ↔ (x ∈ (◡F “ A) ∧ x ∈ (◡F “ B)))) |
12 | elin 3219 | . . . 4 ⊢ (x ∈ ((◡F “ A) ∩ (◡F “ B)) ↔ (x ∈ (◡F “ A) ∧ x ∈ (◡F “ B))) | |
13 | 11, 12 | syl6bbr 254 | . . 3 ⊢ (F Fn dom F → (x ∈ (◡F “ (A ∩ B)) ↔ x ∈ ((◡F “ A) ∩ (◡F “ B)))) |
14 | 13 | eqrdv 2351 | . 2 ⊢ (F Fn dom F → (◡F “ (A ∩ B)) = ((◡F “ A) ∩ (◡F “ B))) |
15 | 1, 14 | sylbi 187 | 1 ⊢ (Fun F → (◡F “ (A ∩ B)) = ((◡F “ A) ∩ (◡F “ B))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 176 ∧ wa 358 = wceq 1642 ∈ wcel 1710 ∩ cin 3208 “ cima 4722 ◡ccnv 4771 dom cdm 4772 Fun wfun 4775 Fn wfn 4776 ‘cfv 4781 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1546 ax-5 1557 ax-17 1616 ax-9 1654 ax-8 1675 ax-13 1712 ax-14 1714 ax-6 1729 ax-7 1734 ax-11 1746 ax-12 1925 ax-ext 2334 ax-nin 4078 ax-xp 4079 ax-cnv 4080 ax-1c 4081 ax-sset 4082 ax-si 4083 ax-ins2 4084 ax-ins3 4085 ax-typlower 4086 ax-sn 4087 |
This theorem depends on definitions: df-bi 177 df-or 359 df-an 360 df-3or 935 df-3an 936 df-nan 1288 df-tru 1319 df-ex 1542 df-nf 1545 df-sb 1649 df-eu 2208 df-mo 2209 df-clab 2340 df-cleq 2346 df-clel 2349 df-nfc 2478 df-ne 2518 df-ral 2619 df-rex 2620 df-reu 2621 df-rmo 2622 df-rab 2623 df-v 2861 df-sbc 3047 df-nin 3211 df-compl 3212 df-in 3213 df-un 3214 df-dif 3215 df-symdif 3216 df-ss 3259 df-pss 3261 df-nul 3551 df-if 3663 df-pw 3724 df-sn 3741 df-pr 3742 df-uni 3892 df-int 3927 df-opk 4058 df-1c 4136 df-pw1 4137 df-uni1 4138 df-xpk 4185 df-cnvk 4186 df-ins2k 4187 df-ins3k 4188 df-imak 4189 df-cok 4190 df-p6 4191 df-sik 4192 df-ssetk 4193 df-imagek 4194 df-idk 4195 df-iota 4339 df-0c 4377 df-addc 4378 df-nnc 4379 df-fin 4380 df-lefin 4440 df-ltfin 4441 df-ncfin 4442 df-tfin 4443 df-evenfin 4444 df-oddfin 4445 df-sfin 4446 df-spfin 4447 df-phi 4565 df-op 4566 df-proj1 4567 df-proj2 4568 df-opab 4623 df-br 4640 df-co 4726 df-ima 4727 df-id 4767 df-xp 4784 df-cnv 4785 df-rn 4786 df-dm 4787 df-res 4788 df-fun 4789 df-fn 4790 df-fv 4795 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |