![]() |
Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > ILE Home > Th. List > oprabexd | GIF version |
Description: Existence of an operator abstraction. (Contributed by Jeff Madsen, 2-Sep-2009.) |
Ref | Expression |
---|---|
oprabexd.1 | ⊢ (𝜑 → 𝐴 ∈ V) |
oprabexd.2 | ⊢ (𝜑 → 𝐵 ∈ V) |
oprabexd.3 | ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ∃*𝑧𝜓) |
oprabexd.4 | ⊢ (𝜑 → 𝐹 = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)}) |
Ref | Expression |
---|---|
oprabexd | ⊢ (𝜑 → 𝐹 ∈ V) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | oprabexd.4 | . 2 ⊢ (𝜑 → 𝐹 = {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)}) | |
2 | oprabexd.3 | . . . . . . 7 ⊢ ((𝜑 ∧ (𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)) → ∃*𝑧𝜓) | |
3 | 2 | ex 115 | . . . . . 6 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ∃*𝑧𝜓)) |
4 | moanimv 2101 | . . . . . 6 ⊢ (∃*𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓) ↔ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) → ∃*𝑧𝜓)) | |
5 | 3, 4 | sylibr 134 | . . . . 5 ⊢ (𝜑 → ∃*𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)) |
6 | 5 | alrimivv 1875 | . . . 4 ⊢ (𝜑 → ∀𝑥∀𝑦∃*𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)) |
7 | funoprabg 5967 | . . . 4 ⊢ (∀𝑥∀𝑦∃*𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓) → Fun {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)}) | |
8 | 6, 7 | syl 14 | . . 3 ⊢ (𝜑 → Fun {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)}) |
9 | dmoprabss 5950 | . . . 4 ⊢ dom {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ⊆ (𝐴 × 𝐵) | |
10 | oprabexd.1 | . . . . 5 ⊢ (𝜑 → 𝐴 ∈ V) | |
11 | oprabexd.2 | . . . . 5 ⊢ (𝜑 → 𝐵 ∈ V) | |
12 | xpexg 4736 | . . . . 5 ⊢ ((𝐴 ∈ V ∧ 𝐵 ∈ V) → (𝐴 × 𝐵) ∈ V) | |
13 | 10, 11, 12 | syl2anc 411 | . . . 4 ⊢ (𝜑 → (𝐴 × 𝐵) ∈ V) |
14 | ssexg 4139 | . . . 4 ⊢ ((dom {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ⊆ (𝐴 × 𝐵) ∧ (𝐴 × 𝐵) ∈ V) → dom {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ∈ V) | |
15 | 9, 13, 14 | sylancr 414 | . . 3 ⊢ (𝜑 → dom {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ∈ V) |
16 | funex 5734 | . . 3 ⊢ ((Fun {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ∧ dom {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ∈ V) → {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ∈ V) | |
17 | 8, 15, 16 | syl2anc 411 | . 2 ⊢ (𝜑 → {〈〈𝑥, 𝑦〉, 𝑧〉 ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝜓)} ∈ V) |
18 | 1, 17 | eqeltrd 2254 | 1 ⊢ (𝜑 → 𝐹 ∈ V) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 104 ∀wal 1351 = wceq 1353 ∃*wmo 2027 ∈ wcel 2148 Vcvv 2737 ⊆ wss 3129 × cxp 4620 dom cdm 4622 Fun wfun 5205 {coprab 5869 |
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-13 2150 ax-14 2151 ax-ext 2159 ax-coll 4115 ax-sep 4118 ax-pow 4171 ax-pr 4205 ax-un 4429 |
This theorem depends on definitions: df-bi 117 df-3an 980 df-tru 1356 df-nf 1461 df-sb 1763 df-eu 2029 df-mo 2030 df-clab 2164 df-cleq 2170 df-clel 2173 df-nfc 2308 df-ral 2460 df-rex 2461 df-reu 2462 df-rab 2464 df-v 2739 df-sbc 2963 df-csb 3058 df-un 3133 df-in 3135 df-ss 3142 df-pw 3576 df-sn 3597 df-pr 3598 df-op 3600 df-uni 3808 df-iun 3886 df-br 4001 df-opab 4062 df-mpt 4063 df-id 4289 df-xp 4628 df-rel 4629 df-cnv 4630 df-co 4631 df-dm 4632 df-rn 4633 df-res 4634 df-ima 4635 df-iota 5173 df-fun 5213 df-fn 5214 df-f 5215 df-f1 5216 df-fo 5217 df-f1o 5218 df-fv 5219 df-oprab 5872 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |