![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > fintm | GIF version |
Description: Function into an intersection. (Contributed by Jim Kingdon, 28-Dec-2018.) |
Ref | Expression |
---|---|
fintm.1 | ⊢ ∃𝑥 𝑥 ∈ 𝐵 |
Ref | Expression |
---|---|
fintm | ⊢ (𝐹:𝐴⟶∩ 𝐵 ↔ ∀𝑥 ∈ 𝐵 𝐹:𝐴⟶𝑥) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | ssint 3860 | . . . 4 ⊢ (ran 𝐹 ⊆ ∩ 𝐵 ↔ ∀𝑥 ∈ 𝐵 ran 𝐹 ⊆ 𝑥) | |
2 | 1 | anbi2i 457 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ ∩ 𝐵) ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐵 ran 𝐹 ⊆ 𝑥)) |
3 | fintm.1 | . . . 4 ⊢ ∃𝑥 𝑥 ∈ 𝐵 | |
4 | r19.28mv 3515 | . . . 4 ⊢ (∃𝑥 𝑥 ∈ 𝐵 → (∀𝑥 ∈ 𝐵 (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝑥) ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐵 ran 𝐹 ⊆ 𝑥))) | |
5 | 3, 4 | ax-mp 5 | . . 3 ⊢ (∀𝑥 ∈ 𝐵 (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝑥) ↔ (𝐹 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐵 ran 𝐹 ⊆ 𝑥)) |
6 | 2, 5 | bitr4i 187 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ ∩ 𝐵) ↔ ∀𝑥 ∈ 𝐵 (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝑥)) |
7 | df-f 5220 | . 2 ⊢ (𝐹:𝐴⟶∩ 𝐵 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ ∩ 𝐵)) | |
8 | df-f 5220 | . . 3 ⊢ (𝐹:𝐴⟶𝑥 ↔ (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝑥)) | |
9 | 8 | ralbii 2483 | . 2 ⊢ (∀𝑥 ∈ 𝐵 𝐹:𝐴⟶𝑥 ↔ ∀𝑥 ∈ 𝐵 (𝐹 Fn 𝐴 ∧ ran 𝐹 ⊆ 𝑥)) |
10 | 6, 7, 9 | 3bitr4i 212 | 1 ⊢ (𝐹:𝐴⟶∩ 𝐵 ↔ ∀𝑥 ∈ 𝐵 𝐹:𝐴⟶𝑥) |
Colors of variables: wff set class |
Syntax hints: ∧ wa 104 ↔ wb 105 ∃wex 1492 ∈ wcel 2148 ∀wral 2455 ⊆ wss 3129 ∩ cint 3844 ran crn 4627 Fn wfn 5211 ⟶wf 5212 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 709 ax-5 1447 ax-7 1448 ax-gen 1449 ax-ie1 1493 ax-ie2 1494 ax-8 1504 ax-10 1505 ax-11 1506 ax-i12 1507 ax-bndl 1509 ax-4 1510 ax-17 1526 ax-i9 1530 ax-ial 1534 ax-i5r 1535 ax-ext 2159 |
This theorem depends on definitions: df-bi 117 df-tru 1356 df-nf 1461 df-sb 1763 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-v 2739 df-in 3135 df-ss 3142 df-int 3845 df-f 5220 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |