![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > ixp0x | Structured version Visualization version GIF version |
Description: An infinite Cartesian product with an empty index set. (Contributed by NM, 21-Sep-2007.) |
Ref | Expression |
---|---|
ixp0x | ⊢ X𝑥 ∈ ∅ 𝐴 = {∅} |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | dfixp 8889 | . 2 ⊢ X𝑥 ∈ ∅ 𝐴 = {𝑓 ∣ (𝑓 Fn ∅ ∧ ∀𝑥 ∈ ∅ (𝑓‘𝑥) ∈ 𝐴)} | |
2 | velsn 4643 | . . . 4 ⊢ (𝑓 ∈ {∅} ↔ 𝑓 = ∅) | |
3 | fn0 6678 | . . . 4 ⊢ (𝑓 Fn ∅ ↔ 𝑓 = ∅) | |
4 | ral0 4511 | . . . . 5 ⊢ ∀𝑥 ∈ ∅ (𝑓‘𝑥) ∈ 𝐴 | |
5 | 4 | biantru 530 | . . . 4 ⊢ (𝑓 Fn ∅ ↔ (𝑓 Fn ∅ ∧ ∀𝑥 ∈ ∅ (𝑓‘𝑥) ∈ 𝐴)) |
6 | 2, 3, 5 | 3bitr2i 298 | . . 3 ⊢ (𝑓 ∈ {∅} ↔ (𝑓 Fn ∅ ∧ ∀𝑥 ∈ ∅ (𝑓‘𝑥) ∈ 𝐴)) |
7 | 6 | eqabi 2869 | . 2 ⊢ {∅} = {𝑓 ∣ (𝑓 Fn ∅ ∧ ∀𝑥 ∈ ∅ (𝑓‘𝑥) ∈ 𝐴)} |
8 | 1, 7 | eqtr4i 2763 | 1 ⊢ X𝑥 ∈ ∅ 𝐴 = {∅} |
Colors of variables: wff setvar class |
Syntax hints: ∧ wa 396 = wceq 1541 ∈ wcel 2106 {cab 2709 ∀wral 3061 ∅c0 4321 {csn 4627 Fn wfn 6535 ‘cfv 6540 Xcixp 8887 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2703 ax-sep 5298 ax-nul 5305 ax-pr 5426 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-mo 2534 df-clab 2710 df-cleq 2724 df-clel 2810 df-ral 3062 df-rex 3071 df-rab 3433 df-v 3476 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-sn 4628 df-pr 4630 df-op 4634 df-br 5148 df-opab 5210 df-id 5573 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-fun 6542 df-fn 6543 df-ixp 8888 |
This theorem is referenced by: 0elixp 8919 ptcmpfi 23308 finixpnum 36461 ioorrnopn 45007 ioorrnopnxr 45009 hoicvr 45250 ovnhoi 45305 ovnlecvr2 45312 hoiqssbl 45327 hoimbl 45333 iunhoiioo 45378 |
Copyright terms: Public domain | W3C validator |