| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > fnexALT | GIF version | ||
| Description: If the domain of a function is a set, the function is a set. Theorem 6.16(1) of [TakeutiZaring] p. 28. This theorem is derived using the Axiom of Replacement in the form of funimaexg 5357. This version of fnex 5805 uses ax-pow 4217 and ax-un 4479, whereas fnex 5805 does not. (Contributed by NM, 14-Aug-1994.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| fnexALT | ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → 𝐹 ∈ V) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | fnrel 5371 | . . . 4 ⊢ (𝐹 Fn 𝐴 → Rel 𝐹) | |
| 2 | relssdmrn 5202 | . . . 4 ⊢ (Rel 𝐹 → 𝐹 ⊆ (dom 𝐹 × ran 𝐹)) | |
| 3 | 1, 2 | syl 14 | . . 3 ⊢ (𝐹 Fn 𝐴 → 𝐹 ⊆ (dom 𝐹 × ran 𝐹)) |
| 4 | 3 | adantr 276 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → 𝐹 ⊆ (dom 𝐹 × ran 𝐹)) |
| 5 | fndm 5372 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → dom 𝐹 = 𝐴) | |
| 6 | 5 | eleq1d 2273 | . . . 4 ⊢ (𝐹 Fn 𝐴 → (dom 𝐹 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵)) |
| 7 | 6 | biimpar 297 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → dom 𝐹 ∈ 𝐵) |
| 8 | fnfun 5370 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → Fun 𝐹) | |
| 9 | funimaexg 5357 | . . . . 5 ⊢ ((Fun 𝐹 ∧ 𝐴 ∈ 𝐵) → (𝐹 “ 𝐴) ∈ V) | |
| 10 | 8, 9 | sylan 283 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → (𝐹 “ 𝐴) ∈ V) |
| 11 | imadmrn 5031 | . . . . . . 7 ⊢ (𝐹 “ dom 𝐹) = ran 𝐹 | |
| 12 | 5 | imaeq2d 5021 | . . . . . . 7 ⊢ (𝐹 Fn 𝐴 → (𝐹 “ dom 𝐹) = (𝐹 “ 𝐴)) |
| 13 | 11, 12 | eqtr3id 2251 | . . . . . 6 ⊢ (𝐹 Fn 𝐴 → ran 𝐹 = (𝐹 “ 𝐴)) |
| 14 | 13 | eleq1d 2273 | . . . . 5 ⊢ (𝐹 Fn 𝐴 → (ran 𝐹 ∈ V ↔ (𝐹 “ 𝐴) ∈ V)) |
| 15 | 14 | biimpar 297 | . . . 4 ⊢ ((𝐹 Fn 𝐴 ∧ (𝐹 “ 𝐴) ∈ V) → ran 𝐹 ∈ V) |
| 16 | 10, 15 | syldan 282 | . . 3 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → ran 𝐹 ∈ V) |
| 17 | xpexg 4788 | . . 3 ⊢ ((dom 𝐹 ∈ 𝐵 ∧ ran 𝐹 ∈ V) → (dom 𝐹 × ran 𝐹) ∈ V) | |
| 18 | 7, 16, 17 | syl2anc 411 | . 2 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → (dom 𝐹 × ran 𝐹) ∈ V) |
| 19 | ssexg 4182 | . 2 ⊢ ((𝐹 ⊆ (dom 𝐹 × ran 𝐹) ∧ (dom 𝐹 × ran 𝐹) ∈ V) → 𝐹 ∈ V) | |
| 20 | 4, 18, 19 | syl2anc 411 | 1 ⊢ ((𝐹 Fn 𝐴 ∧ 𝐴 ∈ 𝐵) → 𝐹 ∈ V) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∈ wcel 2175 Vcvv 2771 ⊆ wss 3165 × cxp 4672 dom cdm 4674 ran crn 4675 “ cima 4677 Rel wrel 4679 Fun wfun 5264 Fn wfn 5265 |
| 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 710 ax-5 1469 ax-7 1470 ax-gen 1471 ax-ie1 1515 ax-ie2 1516 ax-8 1526 ax-10 1527 ax-11 1528 ax-i12 1529 ax-bndl 1531 ax-4 1532 ax-17 1548 ax-i9 1552 ax-ial 1556 ax-i5r 1557 ax-13 2177 ax-14 2178 ax-ext 2186 ax-coll 4158 ax-sep 4161 ax-pow 4217 ax-pr 4252 ax-un 4479 |
| This theorem depends on definitions: df-bi 117 df-3an 982 df-tru 1375 df-nf 1483 df-sb 1785 df-eu 2056 df-mo 2057 df-clab 2191 df-cleq 2197 df-clel 2200 df-nfc 2336 df-ral 2488 df-rex 2489 df-v 2773 df-un 3169 df-in 3171 df-ss 3178 df-pw 3617 df-sn 3638 df-pr 3639 df-op 3641 df-uni 3850 df-br 4044 df-opab 4105 df-id 4339 df-xp 4680 df-rel 4681 df-cnv 4682 df-co 4683 df-dm 4684 df-rn 4685 df-res 4686 df-ima 4687 df-fun 5272 df-fn 5273 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |